Iteratively maximum likelihood decodable spherical codes and a method for their construction

DOI10.1109/18.6027zbMATH Open0653.94017OpenAlexW2054763203MaRDI QIDQ3799953

Luther D. Rudolph, Carlos R. P. Hartmann, Jiapeng Gao

Publication date: 1988

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

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

zbMATH Keywords

spherical codesbinary maximal length sequence code.iterative maximum likelihood decoding algorithmVoronoi corners

Mathematics Subject Classification ID

Cyclic codes (94B15) Combinatorial codes (94B25)

Related Items (2)

Decoding spherical codes for the Gaussian channel ⋮ The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On spherical codes with inner products in a prescribed interval 👍 👎
• Constructive spherical codes near the Shannon bound 👍 👎
• Iterative maximum-likelihood trellis decoding for block codes 👍 👎
• On a spherical code in the space of spherical harmonics 👍 👎
• Finding and Investigating Exact Spherical Codes 👍 👎
• Decoding spherical codes for the Gaussian channel 👍 👎
• Asymptotically dense spherical codes. I. Wrapped spherical codes 👍 👎
• Gaussian source coding with spherical codes 👍 👎

This page was built for publication: Iteratively maximum likelihood decodable spherical codes and a method for their construction

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