|
|
|
Publications in Math-Net.Ru |
Citations |
|
2014 |
| 1. |
Yu. M. Shtarkov, “Universal coding algorithm for a family of context Markov sources”, Probl. Peredachi Inf., 50:3 (2014), 93–100  ; Problems Inform. Transmission, 50:3 (2014), 285–291   |
|
2013 |
| 2. |
Yu. M. Shtarkov, “Individual redundancy of adaptive and weighted source coding”, Probl. Peredachi Inf., 49:4 (2013), 105–109 ; Problems Inform. Transmission, 49:4 (2013), 391–395 |
|
2004 |
| 3. |
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems, “Optimal Universal Coding by the Maximum Individual Redundancy Criterion”, Probl. Peredachi Inf., 40:1 (2004), 98–110   ; Problems Inform. Transmission, 40:1 (2004), 90–101 |
1
|
|
2002 |
| 4. |
Yu. M. Shtar'kov, “Joint Matrix Universal Coding of Sequences of Independent Symbols”, Probl. Peredachi Inf., 38:2 (2002), 64–76 ; Problems Inform. Transmission, 38:2 (2002), 154–165 |
|
1999 |
| 5. |
Yu. M. Shtar'kov, “Aim Functions and Sequential Estimation of the Source Model for Universal Coding”, Probl. Peredachi Inf., 35:3 (1999), 99–111 ; Problems Inform. Transmission, 35:3 (1999), 275–285 |
1
|
|
1998 |
| 6. |
Yu. M. Shtar'kov, T. Johansson, B. Smeets, “On Key and Message Equivocation in Secrecy Systems”, Probl. Peredachi Inf., 34:2 (1998), 117–127 ; Problems Inform. Transmission, 34:2 (1998), 197–206 |
|
1997 |
| 7. |
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems, “Multialphabet Weighting Universal Coding of Context Tree Sources”, Probl. Peredachi Inf., 33:1 (1997), 21–34 ; Problems Inform. Transmission, 33:1 (1997), 17–28 |
7
|
| 8. |
J. Justesen, Yu. M. Shtar'kov, “Combinatorial Entropy of Images”, Probl. Peredachi Inf., 33:1 (1997), 3–11 ; Problems Inform. Transmission, 33:1 (1997), 1–8 |
8
|
|
1995 |
| 9. |
Yu. M. Shtar'kov, Tj. J. Tjalkens, F. M. J. Willems, “Multi-Alphabet Universal Coding of Memoryless Sources”, Probl. Peredachi Inf., 31:2 (1995), 20–35 ; Problems Inform. Transmission, 31:2 (1995), 114–127 |
12
|
|
1994 |
| 10. |
Yu. M. Shtar'kov, “Some Information-Theoretic Problems of Discrete Data Protection”, Probl. Peredachi Inf., 30:2 (1994), 49–60 ; Problems Inform. Transmission, 30:2 (1994), 135–144 |
1
|
|
1992 |
| 11. |
Yu. M. Shtar'kov, “Switching Discrete Sources and Their Universal Encoding”, Probl. Peredachi Inf., 28:3 (1992), 95–111 ; Problems Inform. Transmission, 28:3 (1992), 282–296 |
|
1991 |
| 12. |
Yu. M. Shtar'kov, “Relative-Redundancy Universal Coding of Memoryless Sources”, Probl. Peredachi Inf., 27:4 (1991), 9–16 ; Problems Inform. Transmission, 27:4 (1991), 282–288 |
1
|
| 13. |
Yu. M. Shtar'kov, “Output-Uniform Universal Coding of Discrete Memoryless Sources”, Probl. Peredachi Inf., 27:1 (1991), 3–13 ; Problems Inform. Transmission, 27:1 (1991), 1–10 |
|
1987 |
| 14. |
Yu. M. Shtar'kov, “Universal Sequential Coding of Single Messages”, Probl. Peredachi Inf., 23:3 (1987), 3–17 ; Problems Inform. Transmission, 23:3 (1987), 175–186 |
27
|
|
1984 |
| 15. |
Yu. M. Shtar'kov, “Generalized Shannon Codes”, Probl. Peredachi Inf., 20:3 (1984), 3–16 ; Problems Inform. Transmission, 20:3 (1984), 155–167 |
1
|
|
1982 |
| 16. |
Yu. M. Shtar'kov, “Methods of Constructing Lower Bounds for Redundancy of Universal Coding”, Probl. Peredachi Inf., 18:2 (1982), 3–11 ; Problems Inform. Transmission, 18:2 (1982), 85–92 |
|
1967 |
| 17. |
Yu. M. Shtar'kov, “A Method of Majority Decoding of Truncated Cyclic Codes”, Probl. Peredachi Inf., 3:1 (1967), 3–9 ; Problems Inform. Transmission, 3:1 (1967), 1–6 |
|
1966 |
| 18. |
Yu. M. Shtar'kov, “The Correction of Errors of Multiplicity $t\geq\frac{d}{2}$ in Majority Decoding”, Probl. Peredachi Inf., 2:3 (1966), 39–47 ; Problems Inform. Transmission, 2:3 (1966), 32–38 |
|
| Organisations |
|
| |
|
|
Contact us: