%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