Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding

DOI10.1109/TIT.2009.2039034MaRDI QIDQ5281571zbMATHFDO

Authors Dominik Seethaler, Helmut Bölcskei

Publication date 27 July 2017

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Cited in

(3)

• On the sphere-decoding algorithm I. Expected complexity
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes
• Lossless Dimension Reduction for Integer Least Squares With Application to Sphere Decoding

This page was built for publication: Performance and Complexity Analysis of Infinity-Norm Sphere-Decoding

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