Large constant dimension codes and lexicodes

DOI10.3934/AMC.2011.5.177MaRDI QIDQ2275871zbMATH OpenOpenAlexFDO

Authors Natalia Silberstein, Tuvi Etzion

Publication date 10 August 2011

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1003.4879

zbMATH Keywords

GrassmannianFerrers diagramconstant dimension codelexicode

Mathematics Subject Classification ID

Grassmannians, Schubert varieties, flag manifolds (14M15) Bounds on codes (94B65) Other types of codes (94B60)

Abstract: Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the codewords in such a code are subspaces of $F_q^n$ with a given dimension. A computer search for large constant dimension codes is usually inefficient since the search space domain is extremely large. Even so, we found that some constant dimension lexicodes are larger than other known codes. We show how to make the computer search more efficient. In this context we present a formula for the computation of the distance between two subspaces, not necessarily of the same dimension.

Recommendations

• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• The interplay of different metrics for the construction of constant dimension codes
• Subspace codes in \(\operatorname{PG}(2N-1; q)\)
• Construction of optimal constant-dimension subspace codes
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound

Cited in

(13)

• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes
• Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
• A subspace code of size 333 in the setting of a binary \(q\)-analog of the Fano plane
• Constructions of optimal Ferrers diagram rank metric codes
• Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
• Bilateral multilevel construction of constant dimension codes
• New constructions of Sidon spaces
• Several classes of optimal Ferrers diagram rank-metric codes
• New lower bounds for partial k‐parallelisms
• Rank subcodes in multicomponent network coding
• Integral lexicographic codes
• The interplay of different metrics for the construction of constant dimension codes
• Constant dimension codes from Riemann-Roch spaces

This page was built for publication: Large constant dimension codes and lexicodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275871)