Methods for the Reconstruction of Parallel Turbo Codes
Mathieu Cluzeau, Matthieu Finiasz, and Jean-Pierre Tillich

TL;DR
This paper introduces two novel algorithms capable of reconstructing turbo codes from noisy data, successfully recovering entire permutations even under high noise conditions, advancing the field of code reconstruction.
Contribution
The paper presents the first algorithms that can recover the complete permutation of turbo codes from noisy intercepted data.
Findings
Successfully reconstructed turbo codes with realistic parameters
Able to recover entire permutations in high noise environments
First algorithms to achieve full permutation recovery under such conditions
Abstract
We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo codes with realistic parameter sizes. To the best of our knowledge, these are the first algorithms able to recover the whole permutation of a turbo code in the presence of high noise levels.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · Error Correcting Code Techniques
