Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness by Bazzi, Louay Mohamad Jamil, 1974-

Get full text

Limits on representing boolean functions by linear combinations of simple functions: Thresholds, relus, and low-degree polynomials by Williams, Richard Ryan

“…When C forms a basis for the space of Boolean functions (e.g., the set of PARITY functions or the set of conjunctions) this sort of problem has a well-understood answer; the problem becomes interesting when C is "overcomplete" and the set of functions is not linearly independent. …”
Get full text