Perfect byte-correcting codes
From MaRDI portal
Recommendations
- Codes for perfectly correcting errors of limited size
- \(b_i\)-byte correcting perfect codes
- On perfect binary codes
- b_i-byte correcting non-binary perfect codes
- Nearly perfect binary codes
- Perfect Multiple Error-Correcting Arithmetic Codes
- PHASED ERROR CORRECTING PERFECT CODES
- scientific article; zbMATH DE number 3172224
- Error-correcting codes
Cited in
(18)- Johnson type bounds on constant dimension codes
- Codes and anticodes in the Grassman graph
- Integer codes correcting sparse byte errors
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
- The maximum size of a partial spread in a finite projective space
- Constructions for perfect 2-burst-correcting codes
- b_i-byte correcting non-binary perfect codes
- Restricted b_i-byte correcting non-binary optimal codes
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- A note on optimal constant dimension codes
- The maximum size of a partial spread. II: Upper bounds
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Byte protecting perfect burst code
- \(b_i\)-byte correcting perfect codes
- Linear codes in the folded Hamming distance and the quasi MDS property
- New nonuniform group divisible designs and mixed Steiner systems
- Hamming and simplex codes for the sum-rank metric
- Galois geometries and coding theory
This page was built for publication: Perfect byte-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701238)
