Constructions of duadic codes with minimum weights exceeding the square-root lower bound
From MaRDI portal
Cites work
- A generalization of the Tang-Ding binary cyclic codes
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances
- Binary duadic codes and their related codes with a square-root-like lower bound
- Cyclotomy and duadic codes of prime lengths
- Designs from linear codes
- Duadic Codes
- Duadic codes (Corresp.)
- Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes
- Five infinite families of binary cyclic codes and their related codes with good parameters
- Four infinite families of ternary cyclic codes with a square-root-like lower bound
- Fundamentals of Error-Correcting Codes
- LCD Cyclic Codes Over Finite Fields
- Nonbinary Stabilizer Codes Over Finite Fields
- On weights in duadic codes
- Parameters of several families of binary duadic codes and their related codes
- Self-dual codes and invariant theory
- Self-dual cyclic codes with square-root-like lower bounds on their minimum distances
- Self-orthogonal cyclic codes with good parameters
- Some self-dual codes and isodual codes constructed by matrix product codes
- The lengths of Hermitian self-dual extended duadic codes
- Three families of binary cyclic codes with good lower bounds
This page was built for publication: Constructions of duadic codes with minimum weights exceeding the square-root lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345668)
