Two decyclical lengthening methods for block codes (Q1069905)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two decyclical lengthening methods for block codes |
scientific article; zbMATH DE number 3932947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two decyclical lengthening methods for block codes |
scientific article; zbMATH DE number 3932947 |
Statements
Two decyclical lengthening methods for block codes (English)
0 references
1983
0 references
We propose two lengthening methods for block codes that are variants of the constructs of decyclical lengthening. Their use makes it possible to construct new block codes with parameters that are better than the available ones. Suitable examples are given. By lengthening Hamming codes of length \(2^ m-1\) by 2m symbols, we construct a class of codes with minimum distance 7 and redundancy 3m.
0 references
Hamming codes
0 references
0.87277555
0 references
0.8701943
0 references
0.8690573
0 references
0.86733264
0 references
0.8661957
0 references
0 references
0.8645701
0 references
