On Computing the Hamming Distance

 Gerzson Kéri1 and Ákos Kisvölcsey2

  Acta Cybernetica 16 (2004) 443-449.

Abstract:

 Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.

Footnotes

 ...Kéri 1 Computer and Automation Research Institute, Hungarian Academy of Sciences, H-1111 Budapest Kende u. 13-17, Hungary, e-mail: keri@sztaki.hu Supported in part by the Hungarian National Research Fund OTKA, Grant No. T043276.

 ...Kisvölcsey 2 Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, H-1053 Budapest Reáltanoda u. 13-15, Hungary, e-mail: ksvlcs@renyi.hu

 Web administrator 2004-09-21