Login / Signup

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates.

Anna GálKristoffer Arnsfelt HansenMichal KouckýPavel PudlákEmanuele Viola
Published in: IEEE Trans. Inf. Theory (2013)
Keyphrases
  • tight bounds
  • error correcting codes
  • upper bound
  • logic circuits
  • error correction
  • depth map
  • error correcting
  • minimum distance
  • genetic algorithm
  • lower bound
  • decision trees
  • image sequences
  • high speed