281 citations
- University of AmsterdamNL23 papers
- Eindhoven University of TechnologyNL17 papers
- College of Western IdahoUS5 papers
- Universidad Pública de Navarra (UPNA)ES4 papers
- University of WaterlooCA4 papers
- Vrije Universiteit AmsterdamNL4 papers
- Berkeley CollegeUS2 papers
- National University of SingaporeSG2 papers
- Radboud University NijmegenNL2 papers
- University of BristolGB2 papers
- University of California, BerkeleyUS2 papers
- University of CambridgeGB2 papers
Showing 2007 · cs.ITShow all
2 papers · 2 filters
cs.IT2007
Noise threshold for universality of 2-input gates
Falk Unger
Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail inde…
cs.IT2007
Lower bounds on the minimum average distance of binary codes
Beniamin Mounits
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.