Prunable S-random interleavers

We propose a variation of the algorithm for the construction of "spread" or S-random interleavers. This new version guarantees good spread properties that are also maintained under pruning. This makes this kind of interleaver attractive for those applications which require flexible size interleavers, such as flexible block size turbo codes, and flexible rate serially concatenated turbo codes.