Geodesic
Lower bound for the computation complexity of BCH-codes for branching programs
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 69-77

Voir la notice de l'article provenant de la source Math-Net.Ru

A lower bound $\Omega(n\log n)$ for the computation complexity of characteristic functions of Bose–Chaudhuri–Hoquinghem codes (BCH-codes) for some values of parameters of these codes by nondeterministic branching programs is obtained. Bibl. 9.
Keywords: complexity, lower bound, branching program
Mots-clés : codes. 
@article{DA_2009_16_5_a6,
     author = {E. A. Okolnishnikova},
     title = {Lower bound for the computation complexity of {BCH-codes} for branching programs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {69--77},
     publisher = {mathdoc},
     volume = {16},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_5_a6/}
}
TY  - JOUR
AU  - E. A. Okolnishnikova
TI  - Lower bound for the computation complexity of BCH-codes for branching programs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 69
EP  - 77
VL  - 16
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_5_a6/
LA  - ru
ID  - DA_2009_16_5_a6
ER  - 
%0 Journal Article
%A E. A. Okolnishnikova
%T Lower bound for the computation complexity of BCH-codes for branching programs
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 69-77
%V 16
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_5_a6/
%G ru
%F DA_2009_16_5_a6
E. A. Okolnishnikova. Lower bound for the computation complexity of BCH-codes for branching programs. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 5, pp. 69-77. http://geodesic.mathdoc.fr/item/DA_2009_16_5_a6/