|
|
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
-
A new method for ensuring anonymity and security in network coding
Probl. Peredachi Inf., 51:1 (2015), 82–89
-
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
-
Algebraic codes for network coding
Probl. Peredachi Inf., 45:4 (2009), 54–68
-
Modeling Hexagonal Constellations with Eisenstein–Jacobi Graphs
Probl. Peredachi Inf., 44:1 (2008), 3–14
-
Symmetric Rank Codes
Probl. Peredachi Inf., 40:2 (2004), 3–18
-
Codes in the Vandermonde $\mathcal F$-Metric and Their Applications
Probl. Peredachi Inf., 39:2 (2003), 3–14
-
New Sequences with Zero Autocorrelation
Probl. Peredachi Inf., 38:4 (2002), 10–23
-
Perfect Codes for Metrics Generated by Primitive 2-Error-Correcting Binary BCH Codes
Probl. Peredachi Inf., 35:3 (1999), 40–47
-
Optimum Codes Correcting Lattice Errors
Probl. Peredachi Inf., 21:2 (1985), 103–108
-
Theory of Codes with Maximum Rank Distance
Probl. Peredachi Inf., 21:1 (1985), 3–16
-
On One General Bound for Code Volume
Probl. Peredachi Inf., 12:4 (1976), 31–35
-
Propagation of Errors in the Decoding of Uniform Convolutional Codes
Probl. Peredachi Inf., 5:3 (1969), 73–77
-
Bounds for the Probability of Error for Certain Channels with Memory
Probl. Peredachi Inf., 5:1 (1969), 40–46
-
Limits for the Decoding Error Probability when Linear Codes Are Used in Memoryless Channels
Probl. Peredachi Inf., 3:2 (1967), 55–62
-
K. Sh. Zigangirov. Sequential Decoding Procedures (review)
Probl. Peredachi Inf., 13:3 (1977), 109–110
© , 2026