Sequential decoding: Difference between revisions

Revision as of 21:40, 18 January 2022

Revision as of 01:25, 17 November 2023

Line 49:

==Computational cutoff rate==

For sequential decoding to be a good choice of decoding algorithm, the number of states explored wants toshould remain small (otherwise an algorithm which deliberately explores all states, e.g. the [[Viterbi algorithm]], may be more suitable). For a particular noise level there is a maximum coding rate <math>R_0</math> called the computational cutoff rate where there is a finite backtracking limit. For the binary symmetric channel:

:<math>R_0 = 1-\log_2(1+2\sqrt{p(1-p)})</math>