A quadratic lower bound for BCH-codes formulae over the {&,∨,-} basis
Abstract:
The article deals with the realization of BCH-codes' characteristic functions by P-circuits. Using the Rychkov inequality, quadratic lower bounds for circuit complexity are obtained.