Four infinite families of ternary cyclic codes with a square-root-like lower bound

DOI10.1016/J.FFA.2023.102308MaRDI QIDQ6063263zbMATH OpenOpenAlexFDO

Authors Tingfang Chen, Cunsheng Ding, Chengju Li, Zhonghua Sun

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

zbMATH Keywords

BCH boundcyclic codelinear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, and the arXiv paper arXiv:2301.06446, the objectives of this paper are the construction and analyses of four infinite families of ternary cyclic codes with length $n=3^m-1$ for odd $m$ and dimension $kinn/2,(n+2)/2$ whose minimum distances have a square-root-like lower bound. Their duals have parameters $[n,k^{p}erp,d^{p}erp]$, where $k^{p}erpinn/2,(n-2)/2$ and $d^{p}erp$ also has a square-root-like lower bound. These families of codes and their duals contain distance-optimal cyclic codes.

Recommendations

• A family of optimal ternary cyclic codes with minimum distance five and their duals
• Optimal ternary cyclic codes with minimum distance four and five
• A family of cyclic codes with two zeros
• Several families of binary cyclic codes with good parameters

Cites work

• A class of minimal cyclic codes over finite fields
• A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
• A family of optimal ternary cyclic codes with minimum distance five and their duals
• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• A new lower bound for the minimum distance of a cyclic code
• BCH codes with minimum distance proportional to code length
• Designed distances and parameters of new LCD BCH codes over finite fields
• Duadic Codes
• Five infinite families of binary cyclic codes and their related codes with good parameters
• Fundamentals of Error-Correcting Codes
• Generalizations of the BCH bound
• How Many Weights Can a Cyclic Code Have?
• scientific article; zbMATH DE number 1284424 (Why is no real title available?)
• On Cyclic Codes of Composite Length and the Minimum Distance
• On Cyclic Codes of Composite Length and the Minimum Distance II
• On the minimum distance of cyclic codes
• On the weight distributions of a class of cyclic codes
• On weights in duadic codes
• Some binary BCH codes with length \(n = 2^m + 1\)
• Some results on the minimum weight of primitive BCH codes (Corresp.)
• The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
• The Enumeration of Information Symbols in BCH Codes
• The minimum distance of some narrow-sense primitive BCH codes

Cited in

(11)

• A family of cyclic codes with two zeros
• Self-orthogonal cyclic codes with good parameters
• Some cyclic and negacyclic codes with square-root-like bounds on their minimum distances
• Binary duadic codes and their related codes with a square-root-like lower bound
• An infinite family of binary cyclic codes and two infinite families of ternary cyclic codes with good parameters
• Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
• A tighter bound on the minimum distances for an infinite family of binary BCH codes and its generalization
• Several infinite families of binary cyclic codes with square-root-like lower bounds
• A generalization of the Tang-Ding binary cyclic codes
• Several families of q-ary cyclic codes with length q^m -1
• Constructions of duadic codes with minimum weights exceeding the square-root lower bound

This page was built for publication: Four infinite families of ternary cyclic codes with a square-root-like lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063263)