A pruned bit-reversal interleaver supports different packet sizes and variable code rates and provides good spreading and puncturing properties. To interleave data, a packet of input data of a first size is received. The packet is extended to a second size that is a power of two, e.g., by appending padding or properly generating write addresses. The extended packet is interleaved in accordance with a bit-reversal interleaver of the second size, which reorders the bits in the extended packet based on their indices. A packet of interleaved data is formed by pruning the output of the bit-reversal interleaver, e.g., by removing the padding or properly generating read addresses. The pruned bit-reversal interleaver may be used in combination with various types of FEC codes such as a Turbo code, a convolutional code, or a low density parity check (LDPC) code.