Parameters of several families of binary duadic codes and their related codes
From MaRDI portal
Publication:6146589
DOI10.1007/S10623-023-01285-7arXiv2302.13461OpenAlexW4387059272MaRDI QIDQ6146589FDOQ6146589
Authors: Hai Liu, Chengju Li, Haifeng Qian
Publication date: 15 January 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length and develop some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one case of the open problem proposed in cite{LLD}. It is shown that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are investigated.
Full work available at URL: https://arxiv.org/abs/2302.13461
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- Fundamentals of Error-Correcting Codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Title not available (Why is that?)
- Cyclotomy and duadic codes of prime lengths
- Duadic Codes
- Title not available (Why is that?)
- Five infinite families of binary cyclic codes and their related codes with good parameters
- On weights in duadic codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On Cyclic Codes of Composite Length and the Minimum Distance II
- New quantum codes from CSS codes
- Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances
Cited In (1)
This page was built for publication: Parameters of several families of binary duadic codes and their related codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146589)