On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata

DOI10.1007/978-3-031-42250-8_8arXiv2305.05340OpenAlexW4386107344MaRDI QIDQ6435898FDOQ6435898

Authors: Luca Mariot, Federico Mazzone 

Publication date: 9 May 2023

Abstract: Motivated by applications to noncoherent network coding, we study subspace codes defined by sets of linear cellular automata (CA). As a first remark, we show that a family of linear CA where the local rules have the same diameter -- and thus the associated polynomials have the same degree -- induces a Grassmannian code. Then, we prove that the minimum distance of such a code is determined by the maximum degree occurring among the pairwise greatest common divisors (GCD) of the polynomials in the family. Finally, we consider the setting where all such polynomials have the same GCD, and determine the cardinality of the corresponding Grassmannian code. As a particular case, we show that if all polynomials in the family are pairwise coprime, the resulting Grassmannian code has the highest minimum distance possible.

Full work available at URL: https://doi.org/10.1007/978-3-031-42250-8_8

Recommendations

• A characterization of cyclic subspace codes via subspace polynomials
• Algebraic codes for network coding
• Bounds on the cardinality of subspace codes with non-maximum code distance
• Cyclic subspace codes via subspace polynomials

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

This page was built for publication: On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata

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