Further constructions of cyclic subspace codes
From MaRDI portal
Publication:2040347
DOI10.1007/s12095-020-00463-xzbMath1469.94160OpenAlexW3097389091MaRDI QIDQ2040347
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00463-x
linearized polynomialsubspace coderandom network codingconstant dimension codeSidon spacesubspace polynomial
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06) Cyclic codes (94B15)
Related Items (7)
Constructions of Sidon spaces and cyclic subspace codes ⋮ Constructions of large cyclic constant dimension codes via Sidon spaces ⋮ LCD subspace codes ⋮ Generalized block inserting for constructing new constant dimension codes ⋮ Further constructions of large cyclic subspace codes via Sidon spaces ⋮ New constructions of Sidon spaces and large cyclic constant dimension codes ⋮ Improved generalized block inserting construction of constant dimension codes
Cites Work
- Unnamed Item
- Unnamed Item
- Codes and anticodes in the Grassman graph
- Cyclic orbit codes and stabilizer subfields
- Cyclic subspace codes via subspace polynomials
- 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 cyclic subspace codes