Maximum-likelihood soft decision decoding of BCH codes

DOI10.1109/18.312184zbMath0812.94017OpenAlexW2111481360MaRDI QIDQ4308800

Alexander Vardy, Yair Be'ery

Publication date: 10 October 1994

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

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

zbMATH Keywords

binary BCH codesminimal trellisprimitive BCH codesmaximum-likelihood soft decision decoding

Mathematics Subject Classification ID

Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12) Cyclic codes (94B15) Decoding (94B35)

Related Items (9)

Finite projective geometries and classification of the weight hierarchies of codes. I ⋮ On the intersection of binary linear codes ⋮ On codes satisfying the double chain condition ⋮ The weight hierarchies of \(q\)-ary linear codes of dimension 4 ⋮ Weight hierarchies of linear codes of dimension 3 ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ On Viterbi-like algorithms and their application to Reed-Muller codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes

This page was built for publication: Maximum-likelihood soft decision decoding of BCH codes