Decoding spherical codes for the Gaussian channel

DOI10.1109/18.179342zbMATH Open0765.94022OpenAlexW2123851082MaRDI QIDQ4034431

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

Gaussian channelmaximum likelihood decodingcorrelation decoderdecoding algorithm for permutation codesIMLD codespermutation modulation codes

Mathematics Subject Classification ID

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

Related Items (2)

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

Recommendations

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

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