Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3147923 (Why is no real title available?)
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- A generalization of the Tang-Ding binary cyclic codes
- An infinite family of binary cyclic codes with best parameters
- BCH cyclic codes
- Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances
- Cyclic and negacyclic codes with optimal and best known minimum distances
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Explicit cyclic and quasi-cyclic codes with optimal, best known parameters, and large relative minimum distances
- 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
- Further results on error correcting binary group codes
- Idempotents and the BCH bound
- Is the class of cyclic codes asymptotically good?
- LCD Cyclic Codes Over Finite Fields
- New Nonbinary Self-Dual Codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On Cyclic Codes of Composite Length and the Minimum Distance II
- On Quantum and Classical BCH Codes
- On a class of error correcting binary group codes
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
- On the number of information symbols in Bose-Chaudhuri codes
- Parameters of Several Classes of BCH Codes
- Parameters of several families of binary duadic codes and their related codes
- Self-dual cyclic codes with square-root-like lower bounds on their minimum distances
- Self-dual negacyclic codes with variable lengths and square-root-like lower bounds on the minimum distances
- Several families of binary cyclic codes with good parameters
- Several families of ternary negacyclic codes and their duals
- Studying the locator polynomials of minimum weight codewords of BCH codes
- The Bose and Minimum Distance of a Class of BCH Codes
- The Enumeration of Information Symbols in BCH Codes
- The dimension and minimum distance of two classes of primitive BCH codes
- Two classes of constacyclic codes with variable parameters \([(q^m -1)/r, k, d]\)
This page was built for publication: Constructions of binary cyclic 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 Q6933658)