Channel capacity of ( O, G/I ) codes
Mihajlo C. Stefanovic, Bane V. Vasic · Electronics Letters · 1993
The tables of channel capacities of the (O, G/I) constrained systems are presented. It is shown that for the given timing parameter G there exists a critical path memory length of the Viterbi algorithm, Iδ, over which it is not possible to improve the code efficiency if data and codeword lengths are limited. These maximal code efficiencies for practically interesting values of G are listed.