Ellipsoidal lists and maximum-likelihood decoding

DOI10.1109/18.825836MaRDI QIDQ4503532zbMATH OpenOpenAlexFDO

Authors I. I. Dumer

Publication date 7 September 2000

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

Full work available at URL https://semanticscholar.org/paper/4155b54fe88764ca05232cd964cd673dc5c631c0

zbMATH Keywords

linear codessoft-decision decodingmaximum-likelihood decodingellipsoidal distancediscrete ellipsoidsML decoding complexity

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1498801
• Soft maximum likelihood decoding of partial unit memory codes
• Soft-decision decoding using punctured codes
• On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
• On maximum likelihood soft-decision decoding of binary linear codes

Cited in

(2)

• Rational maps and maximum likelihood decodings
• scientific article; zbMATH DE number 4112537 (Why is no real title available?)

This page was built for publication: Ellipsoidal lists and maximum-likelihood decoding

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