Parameters of several families of binary duadic codes and their related codes
From MaRDI portal
Publication:6146589
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 1339967 (Why is no real title available?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Cyclotomy and duadic codes of prime lengths
- Duadic Codes
- Five infinite families of binary cyclic codes and their related codes with good parameters
- Fundamentals of Error-Correcting Codes
- New quantum codes from CSS codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On Cyclic Codes of Composite Length and the Minimum Distance II
- On weights in duadic codes
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)