The linear-components conjecture for perfect codes containing Preparata codes
Let be a binary perfect code containing a Preparata code, and let an -component denote the corresponding component of . The set is the model linear component, where denotes the parity of .
Linear-components conjecture. Every -component of , for every , is linear; equivalently, it is equivalent to
This conjecture concerns the structure of components in perfect codes containing Preparata codes. The paper gives no proof or resolution of the assertion.
References
Primary source
Denis S. Krotov and Anastasia Yu. Vasil'eva, “On perfect codes that do not contain Preparata-like codes”, arXiv:1512.03048 (2019).
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
No solutions have been posted yet.