Patent ID: 7069492

Claim:
A method of interleaving a binary data sequence a represented by a polynomial a ⁡ ( x ) = ∑ i = 0 n - 1 ⁢ a i ⁢ x i , n being a product of two integers R and M such that R≧M, i being an integer which may be written i=r.M+c, r being a non-negative integer and c being an integer in the interval [0, M−1], said method comprising obtaining, from the sequence a , an interleaved binary data sequence a * represented by a polynomial a * ⁡ ( x ) = ∑ i = 0 n - 1 ⁢ a i ⁢ x i * where i*=[r−h(c)].M+c mod n, the numbers h(c) being obtained by: the choice of an M-tuple h 0 =[h 0 (0), . . . , h 0 (M−1)] of non-negative integers less than R−1 such that, given a predetermined set Π of circulating matrices P of dimensions M×M, for any matrix P of Π, the residues modulo R of the components of the vector h 0 .P are not nil; and the corresponding choice of an M-tuple h =[h(0), . . . , h(M−1)] obtained from the M-tuple h 0 by the application of a permutation moving the element h 0 (c) to position L×c mod M, L being an integer relatively prime with M.