On cyclotomic cosets and code constructions
From MaRDI portal
Abstract: New properties of -ary cyclotomic cosets modulo , where is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed. As an application, new families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new families of convolutional codes are constructed in this work. These new CSS codes have parameters better than the ones available in the literature. The convolutional codes constructed here have free distance greater than the ones available in the literature.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- A matrix ring description for cyclic convolutional codes
- BCH convolutional codes
- Constructions of MDS-convolutional codes
- Constructions of new families of nonbinary CSS codes
- Convolutional codes I: Algebraic structure
- Convolutional codes. An algebraic approach
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\)
- Enlargement of Calderbank-Shor-Steane quantum codes
- Maximum distance separable convolutional codes
- Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa codes
- New Quantum MDS Codes
- Nonbinary Stabilizer Codes Over Finite Fields
- Nonbinary convolutional codes derived from group character codes
- Nonbinary quantum stabilizer codes
- On Classical and Quantum MDS-Convolutional BCH Codes
- On Quantum and Classical BCH Codes
- On negacyclic MDS-convolutional codes
- Quantum Cyclic and Constacyclic Codes
- Quantum error correction via codes over GF(4)
- Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)
- Strongly-MDS convolutional codes
- Two applications of cyclotomic cosets to certain BCH codes (Corresp.)
Cited in
(14)- Cyclotomic trace codes
- On cryptographic properties of the cosets of R(1, m)
- Some arithmetical properties of cyclotomic cosets and their applications
- Quantum codes with improved minimum distance
- Cosets of convolutional codes with least possible maximum zero- and one-run lengths
- Cyclotomy and its application to duadic codes
- On steane-enlargement of quantum codes from Cartesian product point sets
- Four classes of linear codes from cyclotomic cosets
- On optimal constacyclic codes
- On codes, \(\omega\)-codes and \(\omega\)-generators
- Coprimitive sets and inextendable codes
- Quantum variations of cyclotomic cosets for cyclic stabiliser codes construction
- Large quaternary cyclic codes of length 85 and related quantum error-correcting
- Quantum codes derived from cyclic codes
This page was built for publication: On cyclotomic cosets and code constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896856)
