|
|
Publications in Math-Net.Ru
-
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
-
Low-complexity error correction of Hamming-code-based LDPC codes
Probl. Peredachi Inf., 45:2 (2009), 25–40
-
Detection and Correction Capabilities of Convolutional Codes
Probl. Peredachi Inf., 40:3 (2004), 3–12
-
A Distance Measure Tailored to Tailbiting Codes
Probl. Peredachi Inf., 38:4 (2002), 37–55
-
Distance Approach to Window Decoding
Probl. Peredachi Inf., 38:3 (2002), 3–19
-
A Note on Systematic Tailbiting Encoders
Probl. Peredachi Inf., 38:1 (2002), 64–74
-
Encoder and Distance Properties of Woven Convolutional Codes with One Tailbiting Component Code
Probl. Peredachi Inf., 38:1 (2002), 48–58
-
Asymptotic Distance Properties of Binary Woven Convolutional Codes
Probl. Peredachi Inf., 35:4 (1999), 29–46
-
Nonequivalent Cascaded Convolutional Codes Obtained from Equivalent Constituent Convolutional Encoders
Probl. Peredachi Inf., 34:4 (1998), 3–12
-
On the Theory of List Decoding of Convolutional Codes
Probl. Peredachi Inf., 32:1 (1996), 122–130
-
A Trellis Coding Scheme Based on Signal Alphabet Splitting
Probl. Peredachi Inf., 28:4 (1992), 14–23
© , 2024