Maximum distance holey packings and related codes |
| |
| Authors: | Jianxing Yin Yucai Lu Jianmin Wang |
| |
| Institution: | (1) Department of Mathematics, Suzhou University, 215006 Suzhou, China;(2) Department of Mathematics, Suzhou Medical College, 215007 Suzhou, China;(3) Department of Mathematics, Suzhou University, 215006 Suzhou, China |
| |
| Abstract: | The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengthsn=2 (mod 3) andn≥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). |
| |
| Keywords: | maximum distence holey padbgs constant weight codes constructions |
| 本文献已被 SpringerLink 等数据库收录！ |
|
