Large constant dimension codes and lexicodes

Natalia Silberstein, Tuvi Etzion

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

Constant dimension codes, with a prescribed minimum distance, have found recently an application in network coding. All the code words in such a code are subspaces of Fnq with a given dimension. A computer search for large constant dimension codes is usually in efficient 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.

Original languageEnglish
Pages (from-to)177-189
Number of pages13
JournalAdvances in Mathematics of Communications
Volume5
Issue number2
DOIs
StatePublished - 1 May 2011
Externally publishedYes

Keywords

  • Constant dimension code
  • Ferrers diagram
  • Grassmannian
  • Lexicode

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Large constant dimension codes and lexicodes'. Together they form a unique fingerprint.

Cite this