Two decyclical lengthening methods for block codes
From MaRDI portal
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.
Recommendations
- Generalized quasi-cyclic codes with arbitrary block lengths
- scientific article; zbMATH DE number 1106311
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- Two dimensional constacyclic codes of arbitrary length over finite fields
- scientific article; zbMATH DE number 1181550
- Construction and decomposition of cyclic codes of composite length (Corresp.)
- Two decoding algorithms for linear codes
- Cyclic codes of length \(2^m\)
- A decoding method of an n length binary BCH code through (n+1)n length binary cyclic code
- scientific article; zbMATH DE number 1135091
This page was built for publication: Two decyclical lengthening methods for block codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069905)
