|
|
Publications in Math-Net.Ru
-
Universal coding for memoryless sources with countably infinite alphabets
Probl. Peredachi Inf., 50:4 (2014), 100–109
-
Dual convolutional codes and the MacWilliams identities
Probl. Peredachi Inf., 48:1 (2012), 26–36
-
Woven convolutional graph codes with large free distances
Probl. Peredachi Inf., 47:1 (2011), 3–18
-
Graph-based convolutional and block LDPC codes
Probl. Peredachi Inf., 45:4 (2009), 69–90
-
Random Coding Bound for the Second Moment of
Multidimensional Numerical Lattices
Probl. Peredachi Inf., 43:1 (2007), 67–79
-
Development of Discrete Models for Fading Channels
Probl. Peredachi Inf., 29:1 (1993), 58–67
-
List Decoding in a Gaussian Channel
Probl. Peredachi Inf., 27:3 (1991), 30–38
-
Decoding of Block Codes Obtained from Convolution Codes
Probl. Peredachi Inf., 26:2 (1990), 18–26
-
Block Codes from Convolution Codes
Probl. Peredachi Inf., 25:4 (1989), 98–102
-
List Decoding of Convolutional Codes
Probl. Peredachi Inf., 25:1 (1989), 16–23
-
Some Markov Chain Functions and Associated Nonsymmetric Random Walks with Absorbing Barriers
Probl. Peredachi Inf., 24:3 (1988), 83–93
-
Convolutional-Block Coding in Channels with Decision Feedback
Probl. Peredachi Inf., 21:1 (1985), 17–27
-
Viterbi Algorithm for Decoding of Convolutional Codes in a System with Decision Feedback
Probl. Peredachi Inf., 20:2 (1984), 18–26
-
Upper Bounds for Decoding Error Probability in Some Broadcast Channels
Probl. Peredachi Inf., 15:3 (1979), 3–17
-
On Message Transmission over a Discrete Channel with Noiseless Feedback
Probl. Peredachi Inf., 15:1 (1979), 3–13
© , 2024