Perfect byte-correcting codes

DOI10.1109/18.737544zbMath0953.94027OpenAlexW2146499601MaRDI QIDQ4701238

Tuvi Etzion

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fbe0d32b7469dccd4231b22d1b6c6738673c06f6

zbMATH Keywords

perfect codeequivalent codessyndromebyte-correcting codeperfect mixed code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Burst-correcting codes (94B20)

Related Items

Bounds on subspace codes based on totally isotropic subspaces in unitary spaces ⋮ The maximum size of a partial spread in a finite projective space ⋮ Galois geometries and coding theory ⋮ Byte protecting perfect burst code ⋮ bi-Byte correcting non-binary perfect codes ⋮ Restricted bi-byte correcting non-binary optimal codes ⋮ The maximum size of a partial spread. II: Upper bounds ⋮ b_i-BYTE CORRECTING PERFECT CODES ⋮ Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 ⋮ Johnson type bounds on constant dimension codes ⋮ Hamming and simplex codes for the sum-rank metric ⋮ A Note on Optimal Constant Dimension Codes ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space ⋮ Codes and anticodes in the Grassman graph