On algebraic decoding of some maximal quaternary codes and the binary Golay code
From MaRDI portal
Recommendations
Cited in
(10)- Decoding the Golay code with Venn diagrams
- A new algebraic algorithm to decode the ternary Golay code
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
- On Z/sub 4/- and Z/sub 9/-linear lifts of the Golay codes
- Constructing blocks codes over \(GF(p)\) from block codes over \(GF(p^m)\)
- Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability
- Algorithme de Brill-Noether et codes de Goppa
- Comparison of the binary Golay code with the algebro-geometric code
- A projection decoding of a binary extremal self-dual code of length 40
- Decoding of the \((24,12,8)\) extended Golay code up to four errors
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)