126. Сложность вычисления характеристических функций БЧХ-кодов ветвящимися программами

The computation of characteristic functions of
Bose-Chaudhuri-Hocquenghem codes (BCH-codes) by nondeterministic
branching programs is considered. For a wide  range of parameter
values of these codes the known lower bounds of these functions are
improved.