Phelps enumerated all perfect codes of length 15 and of rank 13 and 14, that can be obtained by the Phelps construction. It is known that all perfect codes of that length and of rank 13 are Phelps codes. It was an open problem to determine whether the same is true in the case of rank 14. We give an answer to that problem, as we construct perfect codes of length 15 and rank 14, that are not equivalent to any Phelps code.
|Number of pages||13|
|Journal||Australasian Journal of Combinatorics|
|Publication status||Published - 2007|
|MoE publication type||A1 Journal article-refereed|