Change search

Cite
Citation style
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
Maximal partial packings of Z(2)(n) with perfect codes
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2007 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 42, no 3, p. 335-355Article in journal (Refereed) Published
##### Abstract [en]

A maximal partial Hamming packing of Z(2)(n) is a family S of mutually disjoint translates of Hamming codes of length n, such that any translate of any Hamming code of length n intersects at least one of the translates of Hamming codes in S. The number of translates of Hamming codes in S is the packing number, and a partial Hamming packing is strictly partial if the family S does not constitute a partition of Z(2)(n). A simple and useful condition describing when two translates of Hamming codes are disjoint or not disjoint is proved. This condition depends on the dual codes of the corresponding Hamming codes. Partly, by using this condition, it is shown that the packing number p, for anymaximal strictly partial Hamming packing of Z(2)(n), n = 2(m)-1, satisfies m + 1 = 4, there exist maximal strictly partial Hamming packings of Z(2)(n) with packing numbers n- 10, n- 9, n- 8,..., n- 1. This implies that the upper bound is tight for any n = 2(m) - 1, m >= 4. All packing numbers for maximal strictly partial Hamming packings of Z(2)(n), n = 7 and 15, are found by a computer search. In the case n = 7 the packing number is 5, and in the case n = 15 the possible packing numbers are 5, 6, 7,..., 13 and 14.

##### Place, publisher, year, edition, pages
2007. Vol. 42, no 3, p. 335-355
perfect codes
Mathematics
##### Identifiers
ISI: 000244723100007Scopus ID: 2-s2.0-33847733106OAI: oai:DiVA.org:kth-37297DiVA, id: diva2:432932
Available from: 2011-08-08 Created: 2011-08-08 Last updated: 2017-12-08Bibliographically approved

#### Open Access in DiVA

No full text in DiVA

Publisher's full textScopus

#### Search in DiVA

##### By author/editor
Westerbäck, Thomas
##### By organisation
Mathematics (Div.)
##### In the same journal
Designs, Codes and Cryptography
Mathematics

doi
urn-nbn

#### Altmetric score

doi
urn-nbn
Total: 26 hits

Cite
Citation style
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
v. 2.33.0
| | | |