Poltyrev G Sh

Publications in Math-Net.Ru

1. Improved Upper Bound on the Probability of Decoding Error for Codes of Complex Structure
   
   Probl. Peredachi Inf., 23:4 (1987),  5–18
2. Coding in an Asynchronous Multiple-Access Channel
   
   Probl. Peredachi Inf., 19:3 (1983),  12–21
3. Random-Coding Bounds for Some Broadcast Channels
   
   Probl. Peredachi Inf., 19:1 (1983),  9–20
4. Random Coding Bounds for Discrete Memoryless Channels
   
   Probl. Peredachi Inf., 18:1 (1982),  12–26
5. Bounds for Codes with Unequal Protection of Two Sets of Messag
   
   Probl. Peredachi Inf., 15:3 (1979),  40–49
6. Upper Bounds for Decoding Error Probability in Some Broadcast Channels
   
   Probl. Peredachi Inf., 15:3 (1979),  3–17
7. Capacity for a Sum of Broadcast Channels
   
   Probl. Peredachi Inf., 15:2 (1979),  40–44
8. Carrying Capacity for Parallel Broadcast Channels with Degraded Components
   
   Probl. Peredachi Inf., 13:2 (1977),  23–35


9. Book Review. Csiszár I. and Körner J. “Information Theory. Coding Theorems for Discrete Memoryless Systems”
   
   Probl. Peredachi Inf., 18:1 (1982),  108–111
10. Book Review. E. L. Bloch and В. B. Zyablov “Generalized Concatenated Codes”. M., “Sviaz”, 1976
    
    Probl. Peredachi Inf., 14:1 (1978),  109–110