Decoding spherical codes for the Gaussian channel

DOI10.1109/18.179342MaRDI QIDQ4034431zbMATH OpenOpenAlexFDO

Authors John K. Karlof

Publication date 16 May 1993

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

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

zbMATH Keywords

maximum likelihood decodingGaussian channelcorrelation decoderdecoding algorithm for permutation codesIMLD codespermutation modulation codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Gaussian source coding with spherical codes
• On the complexity of sphere decoding in digital communications
• On the Complexity Distribution of Sphere Decoding
• Constructive spherical codes near the Shannon bound
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Sparsity-Aware Sphere Decoding: Algorithms and Complexity Analysis
• Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel
• Asymptotic bounds for spherical codes
• Finding and investigating exact spherical codes
• On a spherical code in the space of spherical harmonics

Cited in

(2)

• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Lossless Dimension Reduction for Integer Least Squares With Application to Sphere Decoding

This page was built for publication: Decoding spherical codes for the Gaussian channel

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