New LMRD bounds for constant dimension codes and improved constructions

2018/01/15 by Daniel Heinlein, Heinlein, Daniel
Computer Science · Engineering · #05B25 #51E20 #94B65 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1801.04803

openalex publication_date 2018/01/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.

Related

• Lifted codes and the multilevel construction for constant dimension codes
• New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks
• A lower bound for constant dimension codes from multi-component lifted MRD codes
• Constant-Rank Codes
• New Constant Dimension Codes From the Inserting Mixed Dimension Construction and Multilevel Construction