Zigangirov Kamil' Shamil'evich

Publications in Math-Net.Ru

1. On the Error-Correcting Capability of LDPC Codes
   
   Probl. Peredachi Inf., 44:3 (2008),  50–62
2. Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel
   
   Probl. Peredachi Inf., 42:2 (2006),  44–52
3. On the Minimum Distance of Low-Density Parity-Check Codes with Parity-Check Matrices Constructed from Permutation Matrices
   
   Probl. Peredachi Inf., 41:1 (2005),  39–52
4. To the Theory of Low-Density Convolutional Codes. II
   
   Probl. Peredachi Inf., 37:4 (2001),  15–35
5. Some Results Concerning the Design and Decoding of Turbo-Codes
   
   Probl. Peredachi Inf., 37:3 (2001),  6–23
6. Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes
   
   Probl. Peredachi Inf., 36:4 (2000),  35–46
7. A Posteriori Probability Decoding of Convolutional Codes
   
   Probl. Peredachi Inf., 35:4 (1999),  74–83
8. To the Theory of Low-Density Convolutional Codes. I
   
   Probl. Peredachi Inf., 35:4 (1999),  12–28
9. Comparison Analysis of the Hexagonal Multilevel QAM and Rectangular Multilevel QAM
   
   Probl. Peredachi Inf., 34:4 (1998),  39–50
10. On the Asymptotic Capacity of a Multiple-Access Channel
    
    Probl. Peredachi Inf., 33:1 (1997),  12–20
11. On the Theory of List Decoding of Convolutional Codes
    
    Probl. Peredachi Inf., 32:1 (1996),  122–130
12. Nonbinary Convolutional Coding in Channels with Jamming
    
    Probl. Peredachi Inf., 31:2 (1995),  84–101
13. A Trellis Coding Scheme Based on Signal Alphabet Splitting
    
    Probl. Peredachi Inf., 28:4 (1992),  14–23
14. Mathematical Analysis of Algebraic Sequential Coding
    
    Probl. Peredachi Inf., 28:1 (1992),  3–13
15. On Existence of Fixed Convolutional Codes of Rate $2/c$ for $c\ge 4$ that Attain the Costello Bound
    
    Probl. Peredachi Inf., 27:3 (1991),  16–29
16. Sequential Syndrome Decoding of Convolutional Codes over Large Alphabets
    
    Probl. Peredachi Inf., 27:2 (1991),  92–96
17. New Asymptotic Lower Bounds on the Free Distance of Time-Invariant Convolutional Codes
    
    Probl. Peredachi Inf., 22:2 (1986),  34–42
18. New Upper Bounds for Decoding Error Probability for Convolutional Codes
    
    Probl. Peredachi Inf., 21:2 (1985),  20–31
19. To Expurgated Bounds for Convolutional Codes
    
    Probl. Peredachi Inf., 21:1 (1985),  102–105
20. Centered Codes
    
    Probl. Peredachi Inf., 20:2 (1984),  3–17
21. Lower Bound on the Complexity of Discrimination of Two Statistical Hypotheses
    
    Probl. Peredachi Inf., 17:1 (1981),  108–112
22. Sequential Decoding for Channels with Synchronization Errors
    
    Probl. Peredachi Inf., 15:4 (1979),  12–16
23. Use of Sequential Decoding in Recognition of Continuous Speech
    
    Probl. Peredachi Inf., 13:4 (1977),  81–88
24. Multiple Hypothesis Discrimination Using Finite-State Automata
    
    Probl. Peredachi Inf., 13:3 (1977),  45–55
25. Potential Possibilities of Detection of Random Paths
    
    Probl. Peredachi Inf., 13:2 (1977),  72–82
26. On the Number of Correctable Errors for Transmission over a Binary Symmetrical Channel with Feedback
    
    Probl. Peredachi Inf., 12:2 (1976),  3–19
27. On One Problem of Observation Control
    
    Probl. Peredachi Inf., 11:3 (1975),  44–52
28. An Interval Estimation Problem for Controlled Observations
    
    Probl. Peredachi Inf., 10:3 (1974),  51–61
29. Sequential Transmission from a Source Having a Variable Rate
    
    Probl. Peredachi Inf., 7:2 (1971),  114–118
30. Sequential Decoding in a Channel with Error Bursts
    
    Probl. Peredachi Inf., 7:1 (1971),  29–37
31. Upper Bounds for the Error Probability for Channels with Feedback
    
    Probl. Peredachi Inf., 6:2 (1970),  87–92
32. Distribution of Computations in Sequential Decoding
    
    Probl. Peredachi Inf., 5:4 (1969),  78–80
33. Sequential Decoding for a Binary Channel with Drop-Outs and Insertions
    
    Probl. Peredachi Inf., 5:2 (1969),  23–30
34. Information Transmission Over a Binary Symmetrical Channel with Noiseless Feedback (Random Transmission Time)
    
    Probl. Peredachi Inf., 4:3 (1968),  38–47
35. Sequential Decoding Procedure with Error Probability Exponent Given by Random Coding
    
    Probl. Peredachi Inf., 4:2 (1968),  83–85
36. Sequential Decoding in a Continuous Channel
    
    Probl. Peredachi Inf., 3:4 (1967),  5–17
37. Data Transmission over a Gaussian Channel with Feedback
    
    Probl. Peredachi Inf., 3:2 (1967),  98–101
38. Some Sequential Decoding Procedures
    
    Probl. Peredachi Inf., 2:4 (1966),  13–25
39. On a problem of optimal scanning
    
    Teor. Veroyatnost. i Primenen., 11:2 (1966),  333–338
40. A Nonparametric Criterion for Comparison of Samples
    
    Probl. Peredachi Inf., 1:3 (1965),  118–121


41. Mark Semenovich Pinsker. In Memoriam
    
    Probl. Peredachi Inf., 40:1 (2004),  3–5
42. Book Review. Blahut R. E. “Theory and Practice of Error Control Codes”. Reading, Massachusetts: Addison-Wesley Publishing Company, 1983
    
    Probl. Peredachi Inf., 21:3 (1985),  112
43. Book Review. Kolesnik V. D. and Poltyrev G. Sh. “Information Theory”, M.: Nauka, 1982
    
    Probl. Peredachi Inf., 20:1 (1984),  110–111