On computing the Hamming distance
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.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2004
|
| Series: | Acta cybernetica
16 No. 3 |
| Kulcsszavak: | Számítástechnika, Nyelvészet - számítógép alkalmazása |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12733 |
| Summary: | 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. |
|---|---|
| Physical Description: | 443-449 |
| ISSN: | 0324-721X |