Soft-decision decoding of linear block codes based on ordered statistics
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (5) , 1379-1396
- https://doi.org/10.1109/18.412683
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On Survivor Error Patterns For Maximum Likelihood Soft DecodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Further results on decoding linear block codes using a generalized Dijkstra's algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Asymptotically good codes have infinite trellis complexityIEEE Transactions on Information Theory, 1995
- Maximum-likelihood soft decision decoding of BCH codesIEEE Transactions on Information Theory, 1994
- An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codesIEEE Transactions on Communications, 1994
- On complexity of trellis structure of linear block codesIEEE Transactions on Information Theory, 1993
- Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codesIEEE Transactions on Information Theory, 1993
- Closest coset decoding of mod u mod u+v mod codesIEEE Journal on Selected Areas in Communications, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988