When is hard decision decoding enough?
Document Type
Conference Proceeding
Date of Original Version
1-1-1995
Abstract
Many algorithms for soft and near-soft decision decoding of block codes start by implementing hard decision decoding. In several instances it has been noted that simple tests of the hard decision result may allow the algorithm to terminate at this point. This paper explores this notion in detail.
Publication Title, e.g., Journal
IEEE International Symposium on Information Theory - Proceedings
Citation/Publisher Attribution
Swaszek, Peter F.. "When is hard decision decoding enough?." IEEE International Symposium on Information Theory - Proceedings (1995): 54. https://digitalcommons.uri.edu/ele_facpubs/1106
COinS