Nonexistence conjecture for perfect codes over non-prime-power alphabets
Nonexistence conjecture for perfect codes over non-prime-power alphabets
Let be a non-prime power, and let denote the alphabet of size .
Nonexistence conjecture. Let be a non-prime power. Then, there are no perfect error correcting codes over .
Existing results establish nonexistence for several values of and error-correction parameters, but the general classification over non-prime-power alphabets remains open.
Sources & referencesView supporting material
Primary source
Pedro-José Cazorla García, “Perfect codes over non-prime power alphabets: an approach based on Diophantine equations”, arXiv:2405.03347 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.