Four infinite families of ternary cyclic codes with a square-root-like lower bound
From MaRDI portal
Publication:6063263
DOI10.1016/j.ffa.2023.102308arXiv2303.06849OpenAlexW4387479707MaRDI QIDQ6063263
Chengju Li, Cunsheng Ding, Zhonghua Sun, Tingfang Chen
Publication date: 7 November 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.06849
Cites Work
- Unnamed Item
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
- Some binary BCH codes with length \(n = 2^m + 1\)
- On the weight distributions of a class of cyclic codes
- On weights in duadic codes
- A family of optimal ternary cyclic codes with minimum distance five and their duals
- Designed distances and parameters of new LCD BCH codes over finite fields
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- A new lower bound for the minimum distance of a cyclic code
- Duadic Codes
- Fundamentals of Error-Correcting Codes
- The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On the minimum distance of cyclic codes
- On Cyclic Codes of Composite Length and the Minimum Distance II
- How Many Weights Can a Cyclic Code Have?
- BCH Codes with Minimum Distance Proportional to Code Length
- The Enumeration of Information Symbols in BCH Codes
- Generalizations of the BCH bound
- Some results on the minimum weight of primitive BCH codes (Corresp.)
- A class of minimal cyclic codes over finite fields
- Five infinite families of binary cyclic codes and their related codes with good parameters
This page was built for publication: Four infinite families of ternary cyclic codes with a square-root-like lower bound
