The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengths n≡2 (mod 3) and n≥8. Combining this with Etzion’s result, the existence problem for...The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengths n≡2 (mod 3) and n≥8. Combining this with Etzion’s result, the existence problem for an optimal ternary (n, 3,3)code is solved completely.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No. 19671064)
文摘The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengths n≡2 (mod 3) and n≥8. Combining this with Etzion’s result, the existence problem for an optimal ternary (n, 3,3)code is solved completely.
