On the classification of perfect codes: extended side class structures

From MaRDI portal
(Redirected from Publication:1045141)

DOI10.1016/J.DISC.2009.07.023MaRDI QIDQ1045141zbMATH OpenOpenAlexFDO

Authors Olof Heden, Martin Hessler, Thomas Westerbäck

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.07.023


zbMATH Keywords

code equivalenceperfect codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)




Review text

Two binary codes \(C_1,C_2 \subseteq \mathbb{F}_2^n\) are said to be equivalent if there is a word \(w \in \mathbb{F}_2^n\) and a permutation \(\pi \in S_n\), such that addition by \(w\) followed by the action of \(\pi\) maps the codewords of \(C_1\) onto the codewords of \(C_2\). The action of \(\pi\) can be obtained by multiplying the codewords by a permutation matrix. If one modifies the definition above to allow multiplication by an arbitrary nonsingular matrix (instead of a permutation matrix), then one gets the definition of extended equivalent codes. After introducing the concept of extended equivalent codes, the authors study binary perfect codes with respect to this concept, prove various related results, and classify such codes in some particular cases.


Recommendations


Cites work


Cited in
(4)








This page was built for publication: On the classification of perfect codes: extended side class structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045141)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_classification_of_perfect_codes:_extended_side_class_structures&oldid=66119118"
Powered by MediaWiki