On the non-existence of extended 1-perfect codes and MDS codes
From MaRDI portal
Publication:2120824
DOI10.1016/j.jcta.2022.105607zbMath1495.94140OpenAlexW4214487603MaRDI QIDQ2120824
Publication date: 1 April 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2022.105607
Hamming graphcompletely regular codeequitable partitionperfect coloringMDS codeextended perfect code
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on the classification of MDS codes
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
- On weight distributions of perfect colorings and completely regular codes
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- A note on completely regular codes
- Completely regular codes
- Caps and codes
- Orthogonal arrays. Theory and applications
- Problems in algebraic combinatorics
- Arcs in finite projective spaces
- Algebraic properties of perfect structures
- The non-existence of some perfect codes over non-prime power alphabets
- On sets of vectors of a finite vector space in which every subset of basis size is a basis
- (6,3)-MDS codes over an alphabet of size 4
- Two theorems on perfect codes
- Enumeration of MOLS of small order
- On the Classification of MDS Codes
- n-Ary Quasigroups of Order 4
- A Census of Small Latin Hypercubes
- The Existence of Perfect Codes in Doob Graphs
- Rook domains, Latin squares, affine planes, and error-distributing codes
- A survey of perfect codes
- On perfect codes and related concepts
- On completely regular codes
This page was built for publication: On the non-existence of extended 1-perfect codes and MDS codes
