Probl. Peredachi Inf., 1998 Volume 34, Issue 4, Pages 13–22
(Mi ppi421)
|
This article is cited in
1 paper
Information Theory and Coding Theory
On Linear Hash Codes
V. Yu. Solomennikov,
Yu. L. Sagalovich
Abstract:
We find bounds on parameters of linear hash codes and estimates for the hash distance of certain known codes.
UDC:
621.391.15
Received: 18.03.1997
Revised: 07.08.1998
English version:
Problems of Information Transmission, 1998,
34:4,
300–308
Bibliographic databases:
© , 2024
Fulltext:
PDF file (914 kB)