Design Methods for Maximum Minimum-Distance Error-Correcting Codes
From MaRDI portal
Cited in
(19)- An improvement of the Griesmer bound for some small minimum distances
- Algebraic theory of block codes detecting independent errors
- Several new classes of linear codes with few weights
- On generalized MacDonald codes
- Complete weight enumerator of torsion codes
- MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\)
- Locality of optimal binary codes
- A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
- On the covering radius of Simplex codes
- FEW-WEIGHT CODES FROM TRACE CODES OVER
- Binary and ternary LCD codes from projective spaces
- Partial permutation decoding for MacDonald codes
- On the construction of binary optimal LCD codes with short length
- An error correcting code and its implementation†
- A survey on proper codes
- Unit \(\mathbb{Z}_q\)-simplex codes of type \(\alpha\) and zero divisor \(\mathbb{Z}_q\)-simplex codes
- On construction of ternary optimal self-orthogonal codes
- One-weight codes in the sum-rank metric
- LCD codes over finite fields
This page was built for publication: Design Methods for Maximum Minimum-Distance Error-Correcting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3268561)
