DocumentCode
3028757
Title
Hash codes
Author
Bassalygo, L.A. ; Burmester, M. ; Dyachkov, A. ; Kabatianski, G.
Author_Institution
Inst. for Problems of Inf. Transmission, Moscow, Russia
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
174
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613089
Filename
613089
Link To Document