Turbocoding methods use a first RSC coder operating on sequences of binary data a, and a second RSC coder operating on binary sequences a* each obtained from a by means of a predetermined permutation. These permutations are designed so that, for any sequence a represented by a polynomial divisible by the recursion polynomial, the associated sequence a* is also represented by a polynomial divisible by the recursion polynomial. These permutations are relatively simple to implement, and are applicable to all the data sequences a which have a length which is a multiple of the period of the recursion polynomial. In addition, once the transfer functions of the coders and the sequence length have been chosen, it is possible to select, amongst the corresponding permutations, the one which will probably offer the highest minimum distance of the code. Application to devices and apparatus implementing these methods.