Code construction and decoding of parallel concatenated tail-biting codes
From MaRDI portal
Publication:4544480
DOI10.1109/18.904537zbMATH Open0998.94042OpenAlexW2105627117MaRDI QIDQ4544480FDOQ4544480
Authors: Christian H. Weiß, Christian Bettstetter, Sven Riedel
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.904537
Recommendations
Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Other types of codes (94B60)
Cited In (7)
- Iterative decoding of parallel concatenated block codes and coset based MAP decoding algorithm for F24 code
- Title not available (Why is that?)
- Simultaneous zero-tailing of parallel concatenated codes
- A note on tailbiting codes and their feedback encoders
- On Tail Biting Convolutional Codes
- A note on performance of generalized tail biting trellis codes
- Exponential error bounds and decoding complexity for block concatenated codes with tail biting trellis inner codes
This page was built for publication: Code construction and decoding of parallel concatenated tail-biting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544480)