Five infinite families of binary cyclic codes and their related codes with good parameters
From MaRDI portal
Publication:6136718
DOI10.1016/J.FFA.2023.102270arXiv2301.06446OpenAlexW4385505927MaRDI QIDQ6136718FDOQ6136718
Cunsheng Ding, Chengju Li, Hai Liu
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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, the objectives of this paper are the construction and analyses of five infinite families of binary cyclic codes with parameters and . Three of the five families of binary cyclic codes and their duals have a very good lower bound on their minimum distances and contain distance-optimal codes. The other two families of binary cyclic codes are composed of binary duadic codes with a square-root-like lower bound on their minimum distances. As a by-product, two infinite families of self-dual binary codes with a square-root-like lower bound on their minimum distances are obtained.
Full work available at URL: https://arxiv.org/abs/2301.06446
Recommendations
- Several families of binary cyclic codes with good parameters
- On a sequence of cyclic codes with minimum distance six
- scientific article; zbMATH DE number 7434616
- Repeated-root cyclic codes
- scientific article; zbMATH DE number 493082
- scientific article; zbMATH DE number 1284424
- Error Detection With a Class of Irreducible Binary Cyclic Codes and Their Dual Codes
- Triadic codes
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Some new binary, quasi-cyclic codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- Hamming weights in irreducible cyclic codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Fundamentals of Error-Correcting Codes
- Title not available (Why is that?)
- Cyclotomy and duadic codes of prime lengths
- Duadic Codes
- Title not available (Why is that?)
- On weights in duadic codes
- The Minimum Distance of Some Narrow-Sense Primitive BCH Codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On Cyclic Codes of Composite Length and the Minimum Distance II
- The dual-containing primitive BCH codes with the maximum designed distance and their applications to quantum codes
- The Dual Codes of Several Classes of BCH Codes
- BCH Codes with Minimum Distance Proportional to Code Length
Cited In (5)
- A class of binary cyclic codes with five weights
- Parameters of several families of binary duadic codes and their related codes
- Four infinite families of ternary cyclic codes with a square-root-like lower bound
- Self-orthogonal cyclic codes with good parameters
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
This page was built for publication: Five infinite families of binary cyclic codes and their related codes with good parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136718)