Three measures of the complexity of error correcting decoders are considered, namely, logic complexity, computation time and computational work (the number of logical operations). Bounds on the complexity required with each measure to decode with probability of error P <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">e</inf> at code rate R are given and the complexity of a number of ad hoc decoding procedures is examined.
No takes yet. Share an insight, caveat, or question.
John E. Savage (1970) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: