A new presentation of Cheng-Sloane's \([32,17,8]\)-code (Q689752): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Cayley / rank | |||
Normal rank |
Revision as of 11:14, 28 February 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
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