Low-complexity concatenated two-state TCM schemes with near-capacity performance
From MaRDI portal
Publication:3547481
DOI10.1109/TIT.2003.820011zbMATH Open1301.94142OpenAlexW2099615248MaRDI QIDQ3547481FDOQ3547481
Authors: Li Ping, Baoming Bai, Xinmei Wang
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.820011
Recommendations
- Concatenated tree codes: a low-complexity, high-performance approach
- Low complexity, high performance and bandwidth efficient concatenated coded 8-PSK schemes for reliable data communications
- High-Rate Concatenated Space–Time Block Code M-TCM Designs
- Constructions of generalized concatenated codes and their trellis-based decoding complexity
- scientific article; zbMATH DE number 417963
Coding theorems (Shannon theory) (94A24) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (3)
This page was built for publication: Low-complexity concatenated two-state TCM schemes with near-capacity performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547481)