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

On classes of rate k/(k+1) convolutional codes and their decoding techniques

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

DOI10.1109/18.556606zbMath0874.94037OpenAlexW2155007889MaRDI QIDQ4336400

Kazuhiko Yamaguchi, Pisit Charnkeitkong, Hiroshi Imai

Publication date: 12 May 1997

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

Full work available at URL: https://doi.org/10.1109/18.556606


zbMATH Keywords

convolutional codesmaximum-likelihood decodingdecoding complexities


Mathematics Subject Classification ID

Decoding (94B35) Convolutional codes (94B10)


Related Items (1)

On maximum length convolutional codes under a trellis complexity constraint




This page was built for publication: On classes of rate k/(k+1) convolutional codes and their decoding techniques

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