Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Optimized turbo codes for delay constrained applications

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

DOI10.1109/18.971759zbMATH Open1059.94027OpenAlexW2160335134MaRDI QIDQ4544786FDOQ4544786


Authors: Fred Daneshgaran, Marina Mondin Edit this on Wikidata


Publication date: 4 August 2002

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

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




Recommendations

  • Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity
  • Design of parallel concatenated convolutional codes
  • Interleaver Pruning for Construction of Variable-Length Turbo Codes
  • Some results concerning the design and decoding of turbo-codes
  • Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation


Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)



Cited In (3)

  • Stream-oriented turbo codes
  • Interleaver Pruning for Construction of Variable-Length Turbo Codes
  • On the frame-error rate of concatenated turbo codes





This page was built for publication: Optimized turbo codes for delay constrained applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544786)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4544786&oldid=18667105"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 10:28. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki