Change search
CiteExportLink to record
Permanent link

Direct link
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
On the classification of perfect codes: Extended side class structures
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2010 (English)In: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 310, no 1, 43-55 p.Article in journal (Refereed) Published
Abstract [en]

The two 1-error correcting perfect binary codes. C and C' are said to be equivalent if there exists a permutation pi of the set of the n coordinate positions and a word (d) over bar such that C' = pi((d) over bar + C). Hessler defined C and C' to be linearly equivalent if there exists a non-singular linear map phi such that C' = phi(C). Two perfect codes C and C' of length n will be defined to be extended equivalent if there exists a non-singular linear map W and a word (d) over bar such that C' = phi((d) over bar + C). Heden and Hessler, associated with each linear equivalence class an invariant L-C and this invariant was shown to be a subspace of the kernel of some perfect code. It is shown here that, in the case of extended equivalence, the corresponding invariant will be the extension of the code L-C. This fact will be used to give, in some particular cases, a complete enumeration of all extended equivalence classes of perfect codes.

Place, publisher, year, edition, pages
2010. Vol. 310, no 1, 43-55 p.
Keyword [en]
Perfect codes, Side class structures, rank
Identifiers
URN: urn:nbn:se:kth:diva-19017DOI: 10.1016/j.disc.2009.07.023ISI: 000272437800007Scopus ID: 2-s2.0-70350716446OAI: oai:DiVA.org:kth-19017DiVA: diva2:337064
Note
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2017-12-12Bibliographically approved
In thesis
1. Parity check systems, perfect codes and codes over Frobenius rings
Open this publication in new window or tab >>Parity check systems, perfect codes and codes over Frobenius rings
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis consists of five papers related to coding theory. The first four papers are mainly devoted to perfect 1-error correcting binary codes. The fifth paper concerns codes over finite Abelian groups and finite commutative Frobenius rings.

In Paper A we construct a new class of perfect binary codes of length 15. These codes can not be obtained by a construction of Phelps and Solov’eva. The verification of the existence of these kind of codes gives an answer to a question by Zinoviev and Zinoviev from 2003.

In Paper B the concept of extended equivalence for binary codes is introduced. A linear code L*C, which is an invariant for this equivalence relation, is associated with every perfect binary code C. By using L*C we give, in some particular cases, a complete enumeration of the extended equivalence classes of perfect binary codes.

In Paper C and D we prove that there exist perfect binary codes and extended perfect binary codes with a trivial symmetry group for most admissible cases of lengths and ranks. The results of these two papers have, together with previously known results, completely solved the problem of for which lengths and ranks there exist perfect binary codes with a trivial symmetry group, except in a handful of cases.

In Paper E the concept of parity check matrices of linear codes over finite fields is generalized to parity check systems of both linear and nonlinear codes over finite Abelian groups and finite commutative Frobenius rings. A parity check system is a concatenation of two matrices and can be found by the use of Fourier analysis over finite Abelian groups. It is shown how some fundamental properties of a code can be derived from the set of columns or the set of rows in an associated parity check system. Furthermore, in Paper E, Cayley graphs and integral group rings are associated with parity check systems in order to investigate some problems in coding theory.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2012. vii, 28 p.
Series
Trita-MAT. MA, ISSN 1401-2278 ; 11:12
National Category
Mathematics
Identifiers
urn:nbn:se:kth:diva-67336 (URN)978-91-7501-237-7 (ISBN)
Public defence
2012-02-17, Sal F3, Lindstedtsvägen 26, KTH, Stockholm, 13:00 (English)
Opponent
Supervisors
Note
QC 20120131Available from: 2012-01-31 Created: 2012-01-27 Last updated: 2012-01-31Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

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

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 61 hits
CiteExportLink to record
Permanent link

Direct link
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