Abstract
The error probability performance of binary codes were analyzed. The codewords of the binary codes were partitioned and each part was transmitted over one of the independent channels in parallel. The channel model consisted of parallel binary-input symmetric-output (BISO) discrete memoryless channels. The achievable reliable channel regions based on parallel-channel Gallager bound and its derivatives averaged over random channel assignments was also described.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 224 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 2004 |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: Jun 27 2004 → Jul 2 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics