13 problems
Let denote the number of -perfect binary codes of length , and let be the lower-bound expression satisfying…
Nonexistence conjecture. Let be a non-prime power. Then, there are no perfect error correcting codes over .
Let , and let a Cayley sum graph of the symmetric group be connected. A subgroup total perfect code is a subgroup of that is a total perfect code in this graph…
Let , and let a Cayley sum graph of the symmetric group be connected. A subgroup perfect code is a subgroup of that is a perfect code in this graph. Subgroup p…
Generalized Fibonacci cube perfect-code conjecture. If is a perfect code in , then
Let denote a perfect -error-correcting Lee code over . Assume that is prime. Prime-order perfect Lee code conjecture. Every -code i…
For integers , let a -code mean a perfect -error-correcting code in the Lee metric on . Golomb--Welch strong conjecture. There is no -code f…
For integers , let a -code mean a perfect -error-correcting code in the Lee metric on . Golomb--Welch weak conjecture. There is no -…
Linear-components conjecture. Every -component of , for every , is linear; equivalently, it is equivalent to
Weight-support system conjecture. All codewords of weight of a perfect code containing a Preparata code, and all codewords of weight of an extended perfect code containing…
Conjecture. There are no linear perfect codes with parameters except when or
Cyclicity conjecture for Abelian planar difference sets. The period of in along is equal to for at least one vector …
Prime power conjecture. There exists a linear -perfect code in , equivalently in , if and only if is a prime power.