Publications in Math-Net.Ru
-
Bounds on the cardinality of subspace codes with non-maximum code distance
Probl. Peredachi Inf., 57:3 (2021), 48–54
-
Multicomponent codes with maximum code distance
Probl. Peredachi Inf., 52:3 (2016), 84–91
-
Information security in a random network coding network
Probl. Peredachi Inf., 49:2 (2013), 92–106
-
Rank subcodes in multicomponent network coding
Probl. Peredachi Inf., 49:1 (2013), 46–60
-
Decoding of random network codes
Probl. Peredachi Inf., 46:4 (2010), 33–55
-
Symmetric Rank Codes
Probl. Peredachi Inf., 40:2 (2004), 3–18
-
Synchronization Errors in an Adaptive Quantizer
Probl. Peredachi Inf., 15:3 (1979), 83–92
-
Calculation of Statistical Characteristics of an Adaptive Quantizer
Probl. Peredachi Inf., 13:2 (1977), 62–71
-
Statistical Description of an Adaptive Quantizer
Probl. Peredachi Inf., 12:3 (1976), 20–27
© , 2026