The Nordstrom-Robinson code: representation over GF(4) and efficient decoding

DOI10.1109/18.333895zbMath0814.94029OpenAlexW2101150134MaRDI QIDQ4324157

Alexander Vardy

Publication date: 1 March 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.333895

zbMATH Keywords

complexitydecoding algorithmNordstrom-Robinson codesphere-packingsAdoulhard-decision decodingquadracode

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Lattice packing and covering (number-theoretic aspects) (11H31) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (4)

A new sphere packing in 20 dimensions ⋮ Dual codes of systematic group codes over abelian groups ⋮ Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\) ⋮ On the generalized concatenated construction for the Nordstrom-Robinson code and the binary Golay code

This page was built for publication: The Nordstrom-Robinson code: representation over GF(4) and efficient decoding