On algebraic decoding of some maximal quaternary codes and the binary Golay code
From MaRDI portal
A new decoding algorithm is developed for the family of quaternary double-error-correcting codes constructed by \textit{I. I. Dumer} and \textit{V. A. Zinov'ev} [Probl. Peredachi Inf. 14, No. 3, 24-34 (1978; Zbl 0396.94011)]. The connection between the \([12,6,6]\) quaternary code and the [24,12,8] binary extended Golay code is further used to develop a decoding algorithm for the latter code (and a decoding algorithm for the \([23,12,7]\) binary Golay code can be obtained from this with minor modifications).
Recommendations
Cited in
(11)- On the decoding of some exceptional ternary codes
- Decoding of the (24,12,8) extended Golay code up to four errors
- A new algebraic algorithm to decode the ternary Golay code
- Decoding the Golay code with Venn diagrams
- Constructing blocks codes over \(GF(p)\) from block codes over \(GF(p^m)\)
- On Z/sub 4/- and Z/sub 9/-linear lifts of the Golay codes
- Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
- Comparison of the binary Golay code with the algebro-geometric code
- A projection decoding of a binary extremal self-dual code of length 40
- Algorithme de Brill-Noether et codes de Goppa
This page was built for publication: On algebraic decoding of some maximal quaternary codes and the binary Golay code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569281)