On computing the Hamming distance

  • Gerzson Kéri
  • Ákos Kisvölcsey

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.

Downloads

Download data is not yet available.
Published
2004-01-01
How to Cite
Kéri, G., & Kisvölcsey, Ákos. (2004). On computing the Hamming distance. Acta Cybernetica, 16(3), 443-449. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3634
Issue
Vol 16 No 3 (2004)
Section
Regular articles