Subspace Polynomials and Cyclic Subspace Codes
From MaRDI portal
Abstract: Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and decoding algorithms. In this paper we consider such cyclic codes and provide constructions of optimal codes for which their codewords do not have full orbits. We further introduce a new way to represent subspace codes by a class of polynomials called subspace polynomials. We present some constructions of such codes which are cyclic and analyze their parameters.
Cited in
(48)- Message encoding and retrieval for spread and cyclic orbit codes
- Constructions of cyclic constant dimension codes
- Polycyclic codes as invariant subspaces
- New constructions of orbit codes based on the operations of orbit codes
- Further constructions of cyclic subspace codes
- Orbit codes from forms on vector spaces over a finite field
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Constructions of rank metric codes under actions of the unitary groups
- New constructions of Sidon spaces
- Constructions of Sidon spaces and cyclic subspace codes
- Linearized trinomials with maximum kernel
- Cyclic orbit flag codes
- Several kinds of large cyclic subspace codes via Sidon spaces
- A construction of abelian non-cyclic orbit codes
- Cyclic subspace codes via subspace polynomials
- A characterization of cyclic subspace codes via subspace polynomials
- Distance distributions of cyclic orbit codes
- New constructions of large cyclic subspace codes and Sidon spaces
- Constructions of large cyclic constant dimension codes via Sidon spaces
- Further constructions of large cyclic subspace codes via Sidon spaces
- Multi-orbit cyclic subspace codes and linear sets
- Cyclic constant dimension subspace codes via the sum of Sidon spaces
- Automorphism groups and isometries for cyclic orbit codes
- New constructions of Sidon spaces and large cyclic constant dimension codes
- Constructions and equivalence of Sidon spaces
- New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products
- New constructions of constant dimension subspace codes with large sizes
- Large optimal cyclic subspace codes
- New constructions of large cyclic subspace codes via Sidon spaces
- Two new constructions of cyclic subspace codes via Sidon spaces
- On generalized Sidon spaces
- Multi-orbit cyclic subspace codes via direct sum of Sidon spaces
- Construction of large cyclic subspace codes with dimension k+1 via Sidon spaces
- Two methods of constructing optimum distance flag codes
- New constructions of cyclic subspace codes via variants of Sidon spaces
- Quasi-optimal cyclic orbit codes
- Constructions of optimal cyclic subspace codes via Sidon spaces
- Cardinality-consistent flag codes with larger cardinality
- Large cyclic subspace codes over finite fields
- New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
- Distance distribution of cyclic orbit flag codes
- On the vector subspaces of \(\mathbb{F}_{2^n}\) over which the multiplicative inverse function sums to zero
- Three families of large cyclic subspace codes
- A new construction of cyclic subspace codes
- New construction of cyclic subspace codes via Sidon spaces
- On the distance distributions of single-orbit cyclic subspace codes
- Two kinds of optimal multi-orbit cyclic subspace codes via Sidon spaces
- Galois geometries and coding theory
This page was built for publication: Subspace Polynomials and Cyclic Subspace Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976951)
