Abstract
By a combination of construction and random search based on a
careful analysis of the low weight words and the distance
properties of the component codes, it is possible to find
interleavers for turbo coding with a high minimum distance. We
have designed a block interleaver with permutations of each row,
and found a combination of permutations where a tight upper bound
to the minimum distance of the complete turbo scheme is 108.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Turbo Codes & Related Topics |
| Place of Publication | Brest |
| Publisher | ENST de Bretagne |
| Publication date | 1997 |
| Pages | 154-156 |
| Publication status | Published - 1997 |
| Event | International Symposium on Turbo Codes and Related Topics - Brest, France Duration: 1 Jan 1997 → … |
Conference
| Conference | International Symposium on Turbo Codes and Related Topics |
|---|---|
| City | Brest, France |
| Period | 01/01/1997 → … |