Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph-based iterative decoding algorithms for parity-concatenated trellis codes

From MaRDI portal
Publication:4544542
Jump to:navigation, search

DOI10.1109/18.915663zbMath1024.94015OpenAlexW2143957155MaRDI QIDQ4544542

Qi Wang, Lei Wei

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/66a3376d74d279883334ee977f614ffcbb0eb9ad


zbMATH Keywords

concatenated codesViterbi algorithmtrellis codesiterative decoding algorithmstrellis-coded modulationTanner-Wiberg-Loeliger graph


Mathematics Subject Classification ID

Applications of graph theory (05C90) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)





This page was built for publication: Graph-based iterative decoding algorithms for parity-concatenated trellis codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4544542&oldid=18665415"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 10:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki