On the Nonexistence of Perfect Codes over Finite Fields

Cited in

(58)

Upper bounds for the cardinality of s-distances codes
Maximal partial spreads and two-weight codes
Algebraic theory of block codes detecting independent errors
Unrestricted codes with the Golay parameters are unique
On perfect codes in the Hamming schemes H(n,q) with q arbitrary
Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)
Codes projectifs à deux poids, caps complets et ensembles de différences
Lloyd's theorem for perfect codes
Classification of a class of distance-regular graphs via completely regular codes
A note on codes having no finite completions
Perfect two-fault tolerant search with minimum adaptiveness
A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
Additive perfect codes in Doob graphs
On existence of perfect bitrades in Hamming graphs
On the classification of binary completely transitive codes with almost-simple top-group
On the non-existence of extended 1-perfect codes and MDS codes
The non-existence of some perfect codes over non-prime power alphabets
2-neighbour-transitive codes with small blocks of imprimitivity
Minimal binary 2-neighbour-transitive codes
Steganographic schemes from perfect codes on Cayley graphs
Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases
Perfect codes in the discrete simplex
Perfect minimally adaptive \(q\)-ary search with unreliable tests
On some perfect codes with respect to Lee metric
Two theorems on perfect codes
Perfect codes in graphs
Quasi-perfect linear codes from planar and APN functions
Perfect LRCs and k-optimal LRCs
Applications of graph containers in the Boolean lattice
On full-rank perfect codes over finite fields
Perfect codes in Doob graphs
Irredundant families of subcubes
scientific article; zbMATH DE number 6004977 (Why is no real title available?)
On completely regular binary codes and t-designs∗
On perfect codes in rank distance
scientific article; zbMATH DE number 1188976 (Why is no real title available?)
scientific article; zbMATH DE number 3499625 (Why is no real title available?)
On codes having no finite completion
A note on the symmetry group of full rank perfect binary codes
Alphabet-almost-simple 2-neighbour-transitive codes
On the Nonexistence of Perfect Codes in the Johnson Scheme
On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
Subgroup Perfect Codes in Cayley Graphs
The nonexistence of robust codes for subsets of ω₁
Ternary (1, 2) optimal linear codes
(1, 2) Optimal codes over GF(5)
On perfect binary codes
Structure of \(i\)-components of perfect binary codes
Least adaptive optimal search with unreliable tests
On completely regular codes
Perfect codes in additive channels
Multifold 1-perfect codes
A testing set for Preparata-like codes
Alphabet-affine 2-neighbour-transitive codes
On self-dual completely regular codes with covering radius 3
Jack van Lint (1932--2004): a survey of his scientific work
On non-antipodal binary completely regular codes
Perfect codes from the dual point of view. I

This page was built for publication: On the Nonexistence of Perfect Codes over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5642484)