On computing the Hamming distance

Authors:
Gerzson Kéri;Ákos Kisvölcsey
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, H-1111 Budapest Kende u. 13-17, Hungary;Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, H-1053 Budapest Reáltanoda u. 13-15, Hungary
Venue:
Acta Cybernetica
Year:
2004

Citing 1
Cited 1

Efficient Algorithms for Computing Differential Properties of Addition

FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption

A Framework for Trajectory Clustering

GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks

Quantified Score

Hi-index	0.00

Visualization

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.