Change search
ReferencesLink to record
Permanent link

Direct link
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2009 (English)Article in journal (Refereed) Published
Abstract [en]

We investigate partitions of the set F-n of all binary vectors of length n into cosets of pairwise distinct linear Hamming codes ("non-parallel Hamming codes") of length n. We present several constructions of partitions of F-n into non-parallel Hamming codes of length n and discuss a lower bound on the number of different such partitions.

Place, publisher, year, edition, pages
2009. Vol. 3, no 4, 385-397 p.
Keyword [en]
Perfect code, Hamming code, non-parallel Hamming codes, Phelps partition, perfect codes
URN: urn:nbn:se:kth:diva-19095DOI: 10.3934/amc.2009.3.385ISI: 000273229300006ScopusID: 2-s2.0-72049113332OAI: diva2:337142
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2010-12-23Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Heden, Olof
By organisation
Mathematics (Div.)

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: 21 hits
ReferencesLink to record
Permanent link

Direct link