|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 4, Pages 5–18
(Mi ppi826)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
Improved Upper Bound on the Probability of Decoding Error for Codes of Complex Structure
G. Sh. Poltyrev
Abstract:
Two methods without expurgation are proposed for constructing an upper bound of the probability of decoding error in a memoryless discrete channel, which is better than the random coding bound for low rates. Although in general the bounds obtained by these methods are worse than the expurgated bound, they are applicable to codes with structure constraints. We examine the application of these bounds to trellis codes, to codes for multiple access channels, to $(s,t)$-designs, and to $B_s$-codes.
Received: 15.07.1985
Citation:
G. Sh. Poltyrev, “Improved Upper Bound on the Probability of Decoding Error for Codes of Complex Structure”, Probl. Peredachi Inf., 23:4 (1987), 5–18; Problems Inform. Transmission, 23:4 (1987), 251–262
Linking options:
https://www.mathnet.ru/eng/ppi826 https://www.mathnet.ru/eng/ppi/v23/i4/p5
|
Statistics & downloads: |
Abstract page: | 252 | Full-text PDF : | 121 |
|