Author :
Bassalygo, L.A. ; Burmester, M. ; Dyachkov, A. ; Kabatianski, G.
Author_Institution :
Inst. for Problems of Inf. Transmission, Moscow, Russia
fDate :
29 Jun-4 Jul 1997
Abstract :
We introduce and investigate the hash distance of codes. In the particular case of perfect hash functions we get new results about the size of such families
Keywords :
cryptography; linear codes; Hamming distance; code size; hash codes; hash distance; linear codes; lower bounds; perfect hash functions; upper bounds; Entropy; Hamming distance; Linear code; Upper bound;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613089
