Fukawa, Kisho and Zhao, Dan and Tolli, Antti and Matsumoto, Tad (2011) Irregular repetition and single parity check coded BICM-ID using extended mapping -Optimal node degree allocation-. In: 5th International ICST Conference on Communications and Networking in China.
![[thumbnail of 12828.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "12828.pdf")
PDF
12828.pdf
Download (1MB)
Abstract
Since BICM-ID is a concatenation between channel coding and mapping, its performances strongly depend on the matching between mapping rule and code structure. In our previous papers, we proposed a yet very simple, close Shannon-limit achieving BICM-ID system. It uses very simple codes, irregular rep
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:12 |
| Last Modified: | 18 Apr 2026 03:08 |
| URI: | http://eprints.eai.eu/id/eprint/4478 |
Actions (login required)
- View Item