Shtar'kov Yurii Mikhailovich

Publications in Math-Net.Ru

1. Universal coding algorithm for a family of context Markov sources
   
   Probl. Peredachi Inf., 50:3 (2014),  93–100
2. Individual redundancy of adaptive and weighted source coding
   
   Probl. Peredachi Inf., 49:4 (2013),  105–109
3. Optimal Universal Coding by the Maximum Individual Redundancy Criterion
   
   Probl. Peredachi Inf., 40:1 (2004),  98–110
4. Joint Matrix Universal Coding of Sequences of Independent Symbols
   
   Probl. Peredachi Inf., 38:2 (2002),  64–76
5. Aim Functions and Sequential Estimation of the Source Model for Universal Coding
   
   Probl. Peredachi Inf., 35:3 (1999),  99–111
6. On Key and Message Equivocation in Secrecy Systems
   
   Probl. Peredachi Inf., 34:2 (1998),  117–127
7. Multialphabet Weighting Universal Coding of Context Tree Sources
   
   Probl. Peredachi Inf., 33:1 (1997),  21–34
8. Combinatorial Entropy of Images
   
   Probl. Peredachi Inf., 33:1 (1997),  3–11
9. Multi-Alphabet Universal Coding of Memoryless Sources
   
   Probl. Peredachi Inf., 31:2 (1995),  20–35
10. Some Information-Theoretic Problems of Discrete Data Protection
    
    Probl. Peredachi Inf., 30:2 (1994),  49–60
11. Switching Discrete Sources and Their Universal Encoding
    
    Probl. Peredachi Inf., 28:3 (1992),  95–111
12. Relative-Redundancy Universal Coding of Memoryless Sources
    
    Probl. Peredachi Inf., 27:4 (1991),  9–16
13. Output-Uniform Universal Coding of Discrete Memoryless Sources
    
    Probl. Peredachi Inf., 27:1 (1991),  3–13
14. Universal Sequential Coding of Single Messages
    
    Probl. Peredachi Inf., 23:3 (1987),  3–17
15. Generalized Shannon Codes
    
    Probl. Peredachi Inf., 20:3 (1984),  3–16
16. Methods of Constructing Lower Bounds for Redundancy of Universal Coding
    
    Probl. Peredachi Inf., 18:2 (1982),  3–11
17. A Method of Majority Decoding of Truncated Cyclic Codes
    
    Probl. Peredachi Inf., 3:1 (1967),  3–9
18. The Correction of Errors of Multiplicity $t\geq\frac{d}{2}$ in Majority Decoding
    
    Probl. Peredachi Inf., 2:3 (1966),  39–47