Change search
ReferencesLink to record
Permanent link

Direct link
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, 335-355 p.Article 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, 335-355 p.
Keyword [en]
perfect codes
National Category
URN: urn:nbn:se:kth:diva-37297DOI: 10.1007/s10623-007-9040-2ISI: 000244723100007ScopusID: 2-s2.0-33847733106OAI: diva2:432932
Available from: 2011-08-08 Created: 2011-08-08 Last updated: 2011-08-08Bibliographically approved

Open Access in DiVA

No full text

Other links

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

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link