Quasi-Perfect Codes With Small Distance
From MaRDI portal
Recommendations
- Quasi-perfect Lee distance codes
- Quasi-Perfect Linear Codes With Minimum Distance $4$
- Quasi-perfect codes in the \(\ell _p\) metric
- A Bound on the Minimum Distance of Quasi-cyclic Codes
- scientific article; zbMATH DE number 1353832
- On the minimum distance of some quadratic residue codes (Corresp.)
- Perfect and Quasi-Perfect Codes Under the $l_{p}$ Metric
- A minimum distance bound for quasi-\(n\)D-cyclic codes
- A class of quaternary linear codes improving known minimum distances
- On perfect codes in rank distance
Cited in
(12)- A family of ternary quasi-perfect BCH codes
- On the covering radius of some binary cyclic codes
- A family of constacyclic ternary quasi-perfect codes with covering radius 3
- Quasi-perfect linear codes from planar and APN functions
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Quasi-Perfect Linear Codes With Minimum Distance $4$
- No binary quadratic residue code of length 8m-1 is quasi-perfect
- On nonlinear 1-quasi-perfect codes and their structural properties
- Constructions of covering sequences and 2D-sequences
- Quasi perfect codes in the Cartesian product of some graphs
- On perfect symmetric rank-metric codes
- Quasi-perfect codes in the \(\ell _p\) metric
This page was built for publication: Quasi-Perfect Codes With Small Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546852)
