György E. Révész
Theoretical Computer Science
We present some results on families of balanced binary error-correcting codes that extend those in the literature. The idea is to consider balanced blocks as symbols over an alphabet and to construct error-correcting codes over that alphabet. Encoding and decoding procedures are presented. Several improvements to the general construction are also discussed. © 1989 IEEE
György E. Révész
Theoretical Computer Science
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009