Title :
Pseudo-random turbo-codes
Author_Institution :
Dept. Commun., Ecole Nat. Superieure des Telecommun., Paris, France
Abstract :
Convolutional codes with a distance distribution close to that obtained in the average by random coding are necessarily recursive. We introduce pseudo-random recursive (PRR) codes with a weight distribution which fits well that of random coding, at least in its central part. Decoding these codes is simple only if their free distance is low and thus, the error-event high. However, combining such codes according to the turbo-code scheme may be used to decrease the bit error rate to meet the user´s specification
Keywords :
coding errors; concatenated codes; convolutional codes; decoding; error statistics; pseudonoise codes; bit error rate; convolutional codes; decoding; distance distribution; error event; free distance; pseudorandom recursive codes; pseudorandom turbo codes; random coding; recursive codes; weight distribution; Bit error rate; Block codes; Channel capacity; Convolutional codes; Decoding; H infinity control; Linearity; Reed-Solomon codes; Turbo codes;
Conference_Titel :
Signals, Systems, and Electronics, 1995. ISSSE '95, Proceedings., 1995 URSI International Symposium on
Conference_Location :
San Francisco
Print_ISBN :
0-7803-2516-8
DOI :
10.1109/ISSSE.1995.498022
