Generalized minimum-distance decoding of Euclidean-space codes and lattices
From MaRDI portal
Publication:3129484
DOI10.1109/18.556693zbMath0876.94050OpenAlexW2001749918MaRDI QIDQ3129484
Alexander Vardy, G. David jun. Forney
Publication date: 2 December 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.556693
latticessphere packingsdecoding complexitymultilevel codesmultistage decodingeffective error coefficientEuclidean-space codesgeneralized minimum-distance decoding
Related Items
Reed-Muller codes and Barnes-Wall lattices: generalized multilevel constructions and representation over \(\mathrm{GF}(2^q)\), Unnamed Item, List-decoding Barnes-Wall lattices