Fast Essentially Maximum Likelihood Decoding of the Golden Code

DOI10.1109/TIT.2011.2136870MaRDI QIDQ5273611zbMATH OpenOpenAlexFDO

Authors Songsri Sirinaunpiboon, Robert Calderbank, Stephen D. Howard

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Recommendations

• Fast maximum likelihood decoding of Reed-Muller codes
• Fast maximum likelihood decoding of Reed-Muller codes
• Implementation of a fast maximum-likelihood decoding algorithm for the extended Nordstrom-Robinson code
• scientific article; zbMATH DE number 57521
• Fast Decoding of Expander Codes
• scientific article; zbMATH DE number 4010397
• scientific article; zbMATH DE number 177859
• scientific article; zbMATH DE number 3924676
• Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes

Cited in

(2)

• On fast-decodable algebraic space-time codes
• The Golden Code: A<tex>$2,times,2$</tex>Full-Rate Space–Time Code With Nonvanishing Determinants

This page was built for publication: Fast Essentially Maximum Likelihood Decoding of the Golden Code

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