Pages that link to "Item:Q5642484"
From MaRDI portal
The following pages link to On the Nonexistence of Perfect Codes over Finite Fields (Q5642484):
Displaying 36 items.
- Quasi-perfect linear codes from planar and APN functions (Q269565) (← links)
- Perfect codes in Doob graphs (Q300388) (← links)
- A note on the symmetry group of full rank perfect binary codes (Q449148) (← links)
- Perfect codes in additive channels (Q610513) (← links)
- Jack van Lint (1932--2004): a survey of his scientific work (Q855858) (← links)
- On non-antipodal binary completely regular codes (Q932675) (← links)
- Perfect codes from the dual point of view. I (Q998352) (← links)
- Upper bounds for the cardinality of s-distances codes (Q1077373) (← links)
- Maximal partial spreads and two-weight codes (Q1084669) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Unrestricted codes with the Golay parameters are unique (Q1218393) (← links)
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary (Q1237695) (← links)
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\) (Q1241419) (← links)
- Codes projectifs à deux poids, ''caps'' complets et ensembles de différences (Q1241489) (← links)
- Lloyd's theorem for perfect codes (Q1243264) (← links)
- Classification of a class of distance-regular graphs via completely regular codes (Q1262870) (← links)
- Perfect two-fault tolerant search with minimum adaptiveness (Q1585493) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- Additive perfect codes in Doob graphs (Q1999903) (← links)
- On existence of perfect bitrades in Hamming graphs (Q2005721) (← links)
- On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
- The non-existence of some perfect codes over non-prime power alphabets (Q2275366) (← links)
- 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
- Minimal binary 2-neighbour-transitive codes (Q2299621) (← links)
- Steganographic schemes from perfect codes on Cayley graphs (Q2324771) (← links)
- Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases (Q2329321) (← links)
- Perfect codes in the discrete simplex (Q2339137) (← links)
- Perfect minimally adaptive \(q\)-ary search with unreliable tests (Q2433824) (← links)
- On some perfect codes with respect to Lee metric (Q2484232) (← links)
- Two theorems on perfect codes (Q2556304) (← links)
- Perfect codes in graphs (Q2559208) (← links)
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Applications of graph containers in the Boolean lattice (Q2953701) (← links)
- Irredundant families of subcubes (Q3081469) (← links)
- On completely regular binary codes and t-designs∗ (Q3438940) (← links)
- On Perfect 2‐Colorings of Johnson Graphs <i>J</i>(<i>v</i>, 3) (Q4929281) (← links)
