Construction of spread codes based on abelian non-cyclic orbit codes

DOI10.1016/J.LAA.2020.08.021MaRDI QIDQ2226416zbMATH OpenOpenAlexFDO

Authors Shangdi Chen, Jun-ying Liang

Publication date 12 February 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2020.08.021

zbMATH Keywords

companion matricesnon-cyclic groupsorbit codesprimitive polynomialsspread

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

Subspace codes are an important class of error-correcting codes that have important applications in network coding (see [\textit{R. Koetter} and \textit{F. R. Kschischang}, IEEE Trans. Inf. Theory 54, No. 8, 3579--3591 (2008; Zbl 1318.94111)]). These codes consist of a collection of subspaces over a base finite field, and the distance between two elements \(U_1\) and \(U_2\) is defined by \(d(U_1,U_2)=\dim(U_1)+\dim(U_2)-2\dim(U_1\cap U_2)\). Usually, it is interesting to study codes where all the codewords have the same dimension \(k\), which are called \textit{constant dimension codes} (i.e. elements of the Grassmannian variety \(\mathcal{G}_q(n,k)\)). This paper deals with orbit codes, which are codes defined by the orbits of a subgroup of \(\mathrm{GL}_n(\mathbb{F}_q)\) acting on \(\mathcal{G}_q(n,k)\). The class of codes arising from cyclic subgroups, that are called \textit{cyclic orbit codes}, are widely investigated. In this paper, the authors investigate abelian non-cyclic orbit codes arising from companion matrices of primitive polynomials over finite fields. They investigate their parameters and show that these codes are optimal partial spreads. These results answer an open problem in [\textit{J.-J. Climent} et al., Cryptogr. Commun. 11, No. 5, 839--852 (2019; Zbl 1419.94082)].

Recommendations

• A construction of abelian non-cyclic orbit codes
• A construction of orbit codes
• A new construction of spread codes
• Abelian non-cyclic orbit codes and multishot subspace codes
• Cyclic orbit codes and stabilizer subfields

Cites work

• A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
• Construction of subspace codes through linkage
• Cyclic Orbit Codes

Cited in

(9)

• Message encoding and retrieval for spread and cyclic orbit codes
• A construction of orbit codes
• New constructions of orbit codes based on the operations of orbit codes
• Abelian non-cyclic orbit codes and multishot subspace codes
• A construction of abelian non-cyclic orbit codes
• Cyclic orbit codes and stabilizer subfields
• On some arithmetical properties of orbit codes in a space of matrices
• A new construction of spread codes
• Spread codes from abelian non-cyclic groups

This page was built for publication: Construction of spread codes based on abelian non-cyclic orbit codes

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