A bounded-distance decoding algorithm for lattices obtained from a generalized code formula

DOI10.1109/18.340485zbMATH Open0826.94024OpenAlexW2117366036MaRDI QIDQ4850313FDOQ4850313

Authors: Mauro A. O. da Costa e Silva, Reginaldo jun. Palazzo 

Publication date: 4 December 1995

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

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

Recommendations

• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
• scientific article; zbMATH DE number 1456829

zbMATH Keywords

complexity reductionmaximum-likelihood decodingmultistage decoding algorithm

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (7)

• Title not available (Why is that?)
• Multilevel lattices for compute-and-forward and lattice network coding
• On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
• Encoding and Decoding Binary Product Lattices
• Generalized minimum-distance decoding of Euclidean-space codes and lattices
• Title not available (Why is that?)
• The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions

This page was built for publication: A bounded-distance decoding algorithm for lattices obtained from a generalized code formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850313)