An improved upper bound on the block coding error exponent for binary input discrete memoryless channels
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. The new upper bounds on the minimum distance of binary codes result in improved upper bounds on the coding error exponents for binary input memoryless channels.
- Publication:
-
The Deep Space Network
- Pub Date:
- December 1976
- Bibcode:
- 1976dsn..nasa...45M
- Keywords:
-
- Binary Codes;
- Channels (Data Transmission);
- Error Analysis;
- Deep Space Network;
- Information Theory;
- Probability Theory;
- Telemetry;
- Space Communications, Spacecraft Communications, Command and Tracking