| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 16, Number 3, 2004>>> |
 Magyarul
|
On Computing the Hamming Distance
Gerzson Kéri and Ákos Kisvölcsey
Abstract (in LaTeX format)
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.
Keywords: covering radius, Hamming distance, Hamming weight, intersecting sets, minimum distance.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Keri:2004:ActaCybernetica,author = {Gerzson K\'eri and \'Akos Kisv\"olcsey},
title = {On Computing the Hamming Distance},
journal = {Acta Cybernetica},
year = {2004},
volume = {16},
number = {3},
pages = {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.},
keywords = {covering radius, Hamming distance, Hamming weight, intersecting sets, minimum distance}
}