Abstract
Maximum likelihood decoding (MLD) of binary linear block codes is addressed by combining the approaches of processing the generator matrix G and parity-check matrix H.
| Original language | English |
|---|---|
| Pages | 415 |
| Number of pages | 1 |
| State | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 17 Sep 1995 → 22 Sep 1995 |
Conference
| Conference | Proceedings of the 1995 IEEE International Symposium on Information Theory |
|---|---|
| City | Whistler, BC, Can |
| Period | 17/09/95 → 22/09/95 |