Change search
ReferencesLink to record
Permanent link

Direct link
On rank and kernel of some mixed perfect codes
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2009 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 309, no 9, 2763-2774 p.Article in journal (Refereed) Published
Abstract [en]

Mixed perfect 1-error correcting codes and the associated dual codes over the group Z (n, l), Z (n, l) = under(under(Z2 × Z2 × ⋯ × Z2, {presentation form for vertical right curly bracket}), n) × underover(Z, 2, l), n ≥ 1 and l ≥ 2, are investigated. A lower and an upper bound for the rank k of the kernel of mixed perfect 1-error correcting codes in Z (n, l), depending on the rank r of the mixed perfect code and the structure of the corresponding dual code, are given. Due to a general construction of mixed perfect 1-error correcting group codes in Z (n, l), we show that the upper bound is tight for some n, l and r.

Place, publisher, year, edition, pages
2009. Vol. 309, no 9, 2763-2774 p.
Keyword [en]
Mixed perfect code, Rank, Fourier coefficient
National Category
URN: urn:nbn:se:kth:diva-32559DOI: 10.1016/j.disc.2008.06.037ISI: 000266541200016ScopusID: 2-s2.0-67349187685OAI: diva2:411023
QC 20110415Available from: 2011-04-15 Created: 2011-04-15 Last updated: 2011-04-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Pasticci, FabioWesterbäck, Thomas
By organisation
Mathematics (Div.)
In the same journal
Discrete Mathematics

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

Direct link