Gray Codes and Enumerative Coding for Vector Spaces

DOI10.1109/TIT.2013.2286616MaRDI QIDQ5346158zbMATH OpenOpenAlexWikidataFDO

Authors Moshe Schwartz

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes are given for all parameters. As for the projective-space graph, two constructions for specific parameters are provided, as well some non-existence results. Furthermore, encoding and decoding algorithms are given for the Grassmannian Gray code, which induce an enumerative-coding scheme. The computational complexity of the algorithms is at least as low as known schemes, and for certain parameter ranges, the new scheme outperforms previously-known ones.

Cited in

(7)

• Message encoding and retrieval for spread and cyclic orbit codes
• Canonical form of Gray codes in N-cubes
• Index system and separability of constant weight Gray codes
• scientific article; zbMATH DE number 4139306 (Why is no real title available?)
• Gray Codes for the Ideals of Interval Orders
• On the \(q\)-analog of the revolving door algorithm
• scientific article; zbMATH DE number 7684688 (Why is no real title available?)

This page was built for publication: Gray Codes and Enumerative Coding for Vector Spaces

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