Name
Abstract | ||
|---|---|---|
This work provides techniques to apply the channel coding theorem and the resulting error exponent, which was originally derived for totally random block-code ensembles, to ensembles of codes with less restrictive randomness demands. As an example, the random coding technique can even be applied for an ensemble that contains a single code. For a specific linear code, we get an upper bound for the error probability, which equals Gallager's (1968) random coding bound, up to a factor determined by the maximum ratio between the weight distribution of the code, and the expected random weight distribution |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/18.782147 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
weight distribution,random coding,resulting error exponent,specific linear code,error probability,random coding technique,expected random weight distribution,nonrandom code,maximum ratio,single code,random block-code ensemble,binary codes,indexing terms,spectrum,channel coding,information theory,upper bound,block codes,error exponent,convolutional codes,linear code | Discrete mathematics,Combinatorics,Constant-weight code,Low-density parity-check code,Random permutation,Linear code,Shannon–Fano coding,Universal code,Mathematics,Variable-length code,Random function | Journal |
Volume | Issue | ISSN |
45 | 6 | 0018-9448 |
Citations | PageRank | References |
59 | 4.20 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Shulman | 1 | 92 | 6.80 |
| Feder, M. | 2 | 59 | 4.20 |