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

On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes

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

DOI10.1109/TIT.2008.2006461zbMath1319.94111arXiv0711.3077MaRDI QIDQ3604863

Jie Luo

Publication date: 24 February 2009

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

Full work available at URL: https://arxiv.org/abs/0711.3077


zbMATH Keywords

hidden Markov modelconvolutional codemaximum-likelihood (ML) decodingcoding complexityViterbi algorithm (VA)


Mathematics Subject Classification ID

Decoding (94B35) Convolutional codes (94B10)








This page was built for publication: On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes

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