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  -