Maximum distance holey packings of type 3n with triples

✍ Scribed by J. Wang; Y. Lu; J. Yin

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 115 KB
• Volume: 8
• Category: Article
• ISSN: 1063-8539
• DOI: 10.1002/(sici)1520-6610(2000)8:2<132::aid-jcd5>3.0.co;2-#

✦ Synopsis

Maximum distance holey packings of type g n with triples, MDHP(2, 3, n, g)'s, are equivalent to optimal g 1-ary (n, 3, 3) codes. The problem of existence of MDHP(2, 3, n, 2)'s has been settled completely. For g 3, only the case of odd n has been investigated. With the aid of a computer, we provides the existence result for an MDHP(2, 3, n, 3) with n even, in which singular indirect product construction for MDHPs is developed.