|
Problemy Peredachi Informatsii, 1998, Volume 34, Issue 4, Pages 13–22
(Mi ppi421)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 18.03.1997 Revised: 07.08.1998
Citation:
V. Yu. Solomennikov, Yu. L. Sagalovich, “On Linear Hash Codes”, Probl. Peredachi Inf., 34:4 (1998), 13–22; Problems Inform. Transmission, 34:4 (1998), 300–308
Linking options:
https://www.mathnet.ru/eng/ppi421 https://www.mathnet.ru/eng/ppi/v34/i4/p13
|
Statistics & downloads: |
Abstract page: | 262 | Full-text PDF : | 112 | References: | 36 |
|