On the classification of perfect codes: extended side class structures (Q1045141): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.07.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973690320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ranks and kernels problem for perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Detecting and Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes from the dual point of view. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full rank perfect code of length 31 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of perfect codes: side class structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect codes as isomorphic spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5709000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect codes: Rank and kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary extended perfect codes of length 16 by the generalized concatenated construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary perfect codes of length 15 by the generalized concatenated construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary extended perfect codes of length 16 and rank 14 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 06:56, 2 July 2024

scientific article
Language Label Description Also known as
English
On the classification of perfect codes: extended side class structures
scientific article

    Statements

    On the classification of perfect codes: extended side class structures (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    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.
    0 references
    code equivalence
    0 references
    perfect codes
    0 references

    Identifiers