A new presentation of Cheng-Sloane's \([32,17,8]\)-code (Q689752): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Codes From Symmetry Groups, and a $[32, 17, 8]$ Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An updated table of minimum-distance bounds for binary linear codes / rank
 
Normal rank

Latest revision as of 10:43, 22 May 2024

scientific article
Language Label Description Also known as
English
A new presentation of Cheng-Sloane's \([32,17,8]\)-code
scientific article

    Statements

    A new presentation of Cheng-Sloane's \([32,17,8]\)-code (English)
    0 references
    0 references
    15 November 1993
    0 references
    In 1989 \textit{Y. Cheng} and \textit{N. J. A. Sloane} [SIAM J. Discrete Math. 2, No. 1, 28-37 (1989; Zbl 0669.94016)] presented a binary record-code of block length 32, dimension 17 and minimum distance 8, the highest possible minimum distance, a [32,17]-code can reach. The original construction was based on a submodule of a permutation module involving a group of order 384, and thus by means of a non-regular modular representation. In this paper the author gives a regular representation of this code as a right ideal of a 32-dimensional group algebra over \(GF(2)\). In fact, there are exactly 4 non-isomorphic types of groups of order 32, whose group algebras contain the described code.
    0 references
    coding theory
    0 references
    representation theory
    0 references
    linear binary code
    0 references
    minimum distance
    0 references
    modular representation
    0 references
    group algebra
    0 references

    Identifiers