|
|
Publications in Math-Net.Ru
-
Accelerated determination of codes and hash-functions
Dokl. Akad. Nauk SSSR, 305:5 (1989), 1069–1072
-
Construction of universal numerators and formulas for threshold functions
Sibirsk. Mat. Zh., 29:5 (1988), 143–152
-
Entropy doubling effect
Dokl. Akad. Nauk SSSR, 284:4 (1985), 795–798
-
Almost-injective mappings and hash functions
Dokl. Akad. Nauk SSSR, 277:5 (1984), 1053–1056
-
Digital enumeration of binary dictionaries
Dokl. Akad. Nauk SSSR, 239:5 (1978), 1044–1047
-
The complexity of enumerating a finite set of words
Dokl. Akad. Nauk SSSR, 228:2 (1976), 287–289
-
Optimal Encoding of a Source on the Basis of Observations
Probl. Peredachi Inf., 11:1 (1975), 37–42
-
On the number of errors which can be corrected by the Reed–Muller code
Dokl. Akad. Nauk SSSR, 191:3 (1970), 544–547
-
The Relation Between Redundancy Coding and the Reliability of Information from a Source
Probl. Peredachi Inf., 4:3 (1968), 48–57
-
The length of a block which is necessary to obtain a prescribed surplus
Dokl. Akad. Nauk SSSR, 171:1 (1966), 37–40
-
Complexity of contact circuits realizing a function of logical algebra
Dokl. Akad. Nauk SSSR, 151:4 (1963), 803–806
© , 2026