On the Nonexistence of Perfect Codes over Finite Fields
From MaRDI portal
Publication:5642484
DOI10.1137/0124010zbMath0233.94004OpenAlexW2043888621MaRDI QIDQ5642484
Publication date: 1972
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0124010
Related Items
Upper bounds for the cardinality of s-distances codes, Quasi-perfect linear codes from planar and APN functions, Maximal partial spreads and two-weight codes, Perfect codes in Doob graphs, Jack van Lint (1932--2004): a survey of his scientific work, Alphabet-almost-simple 2-neighbour-transitive codes, Perfect codes in additive channels, Algebraic theory of block codes detecting independent errors, Applications of graph containers in the Boolean lattice, On perfect codes in rank distance, Perfect minimally adaptive \(q\)-ary search with unreliable tests, Perfect LRCs and \(k\)-optimal LRCs, A note on the symmetry group of full rank perfect binary codes, Subgroup Perfect Codes in Cayley Graphs, On completely regular codes, On non-antipodal binary completely regular codes, On perfect binary codes, Additive perfect codes in Doob graphs, On some perfect codes with respect to Lee metric, On existence of perfect bitrades in Hamming graphs, On Perfect 2‐Colorings of Johnson Graphs J(v, 3), Structure of \(i\)-components of perfect binary codes, Unrestricted codes with the Golay parameters are unique, The non-existence of some perfect codes over non-prime power alphabets, Ternary (1, 2) optimal linear codes, (1, 2) Optimal codes over GF(5), 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, Least adaptive optimal search with unreliable tests, Lloyd's theorem for perfect codes, Perfect codes from the dual point of view. I, A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry], 2-neighbour-transitive codes with small blocks of imprimitivity, Irredundant families of subcubes, Minimal binary 2-neighbour-transitive codes, Classification of a class of distance-regular graphs via completely regular codes, Two theorems on perfect codes, Perfect codes in graphs, Steganographic schemes from perfect codes on Cayley graphs, On the classification of binary completely transitive codes with almost-simple top-group, 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 two-fault tolerant search with minimum adaptiveness, Perfect codes in the discrete simplex, On completely regular binary codes and t-designs∗
