Further constructions of large cyclic subspace codes via Sidon spaces
From MaRDI portal
Publication:2682851
DOI10.1016/J.LAA.2022.12.011OpenAlexW4311906437MaRDI QIDQ2682851
Publication date: 1 February 2023
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2022.12.011
Related Items (2)
New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Constructions and equivalence of Sidon spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Codes and anticodes in the Grassman graph
- Revisiting Kneser's theorem for field extensions
- A generalization of an addition theorem of Kneser.
- Anticodes for the Grassmann and bilinear forms graphs
- Further constructions of cyclic subspace codes
- Cyclic orbit codes and stabilizer subfields
- 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
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Subspace Polynomials and Cyclic Subspace Codes
- Coding for Errors and Erasures in Random Network Coding
- On the Zeros of the Askey–Wilson Polynomials, with Applications to Coding Theory
- Error-Correcting Codes in Projective Space
- Cyclic Orbit Codes
- An analogue of Vosper's theorem for extension fields
- Construction of Sidon Spaces With Applications to Coding
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- On perfect codes and related concepts
This page was built for publication: Further constructions of large cyclic subspace codes via Sidon spaces
