Learn More
We give here an efficient algorithm for recovering the permutation of an unknown turbo-code when several noisy codewords are given. The algorithm presented here uses the same information as some other algorithms given previously for this problem but in an optimal fashion. This paper also clarifies the link between this problem and the BCJR decoding(More)
  • Audrey Tixier
  • 2015
We give here an efficient algorithm for recovering the block interleaver and the convolutional code when several noisy interleaver codewords are given. This method applies to any interleaver, structured or not and computes in a first step low weight parity-check equations of the interleaved convolutional code. Then a graph representing how these(More)
  • 1