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

DOI10.1109/18.6027MaRDI QIDQ3799953zbMATH OpenOpenAlexFDO

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

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

binary maximal length sequence code.iterative maximum likelihood decoding algorithmspherical codesVoronoi corners

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1057745
• Decoding spherical codes for the Gaussian channel
• Constructive spherical codes near the Shannon bound
• scientific article; zbMATH DE number 1341365
• Iterative maximum-likelihood trellis decoding for block codes
• Finding and investigating exact spherical codes
• Gaussian source coding with spherical codes
• Asymptotically dense spherical codes. I. Wrapped spherical codes
• On a spherical code in the space of spherical harmonics
• On spherical codes with inner products in a prescribed interval

Cited in

(3)

• The concatenation method for construction of spherical codes in \(n\)-dimensional Euclidean space
• Decoding spherical codes for the Gaussian channel
• scientific article; zbMATH DE number 1461538 (Why is no real title available?)

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)