The following pages link to Perfect byte-correcting codes (Q4701238):
Displaying 15 items.
- The maximum size of a partial spread. II: Upper bounds (Q526224) (← links)
- Hamming and simplex codes for the sum-rank metric (Q782849) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Johnson type bounds on constant dimension codes (Q1009103) (← links)
- Codes and anticodes in the Grassman graph (Q1604569) (← links)
- Integer codes correcting sparse byte errors (Q2325306) (← links)
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space (Q2336478) (← links)
- The maximum size of a partial spread in a finite projective space (Q2401987) (← links)
- bi-Byte correcting non-binary perfect codes (Q4634290) (← links)
- Restricted bi-byte correcting non-binary optimal codes (Q4634291) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- A Note on Optimal Constant Dimension Codes (Q5250281) (← links)
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces (Q5298339) (← links)
- Byte protecting perfect burst code (Q5370825) (← links)
- b<sub>i</sub>-BYTE CORRECTING PERFECT CODES (Q5417501) (← links)