Citation
Abstract
For coded telemetry systems it is important to know the tradeoff between the error probability and the complexity of implementation. For systems using block codes, the block coding error exponent is a good way to estimate this tradeoff. In this article we show how the new upper bounds on the minimum distance of binary codes obtained by McEliece et al. result in improved upper bounds on the coding error exponents for binary input memoryless channels. 8(n,R) = = max Anin(C) (1) n>eo
Details
- Volume
- 42-36
- Published
- December 15, 1976
- Pages
- 45–48
- File Size
- 288.5 KB