Asymptotically good generalized quasi-cyclic codes over finite chain rings
From MaRDI portal
Publication:6646786
DOI10.3934/amc.2023034MaRDI QIDQ6646786
Xiangrui Meng, Fang-Wei Fu, Unnamed Author
Publication date: 3 December 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- On double cyclic codes over \(\mathbb{Z}_4\)
- Generalized quasi-cyclic codes over Galois rings: structural properties and enumeration
- 1-generator generalized quasi-cyclic codes over \(\mathbb {Z}_{4}\)
- Generalized quasi-cyclic codes: Structural properties and code construction
- On the structure of Hermitian codes
- On the structure of linear and cyclic codes over a finite chain ring
- Asymptotically good quasi-cyclic codes of fractional index
- A class of 1-generator quasi-cyclic codes over finite chain rings
- Quasi-Cyclic Codes of Index $1\frac {1}{3}$
- Thresholds of Random Quasi-Abelian Codes
- Some randomized code constructions from group actions
- Is the class of cyclic codes asymptotically good?
- Codes on finite geometries
- The Gray Image of Codes over Finite Chain Rings
- Information, Physics, and Computation
- Automorphisms and Encoding of AG and Order Domain Codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A link between quasi-cyclic codes and convolutional codes
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Random codes: minimum distances and error exponents
- Probability and Computing
- \(\mathbb{Z}_4 \mathbb{Z}_4 \mathbb{Z}_4\)-additive cyclic codes are asymptotically good
This page was built for publication: Asymptotically good generalized quasi-cyclic codes over finite chain rings