Method and apparatus for mapping bits to an information burst
 A first group of bits (100, 102, 106), e.g., header symbols/bits, are interleaved to form a first group of interleaved bits. A second group of bits (104), e.g., data symbols/bits, are interleaved to form a second group of interleaved bits. The first and second groups of interleaved bits are mapped to an information burst (114). The first and second groups of interleaved bits may be mapped to the information burst relative to a group of known symbols (116) forming a training sequence. A disadvantaged bit location, i.e., a bit location within the mapping having a relative high probability of incurring a bit error, is identified and an advantaged bit location, i.e., a bit location within the mapping having a relatively low probability of incurring a bit error, is identified. A first group bit from the first group of interleaved bits mapped to the disadvantaged bit location is remapped to the advantaged bit location while a second group bit from the second group of interleaved bits mapped to the advantaged bit location is remapped to the disadvantaged bit location. 
Motorola, Inc.
H H H H H H H H H
H04L H04L H04L H04L H04L H04L H04L H04L H04L
inventional inventional inventional inventional inventional inventional inventional additional inventional
Yumin Brian Keith Joseph Michael
Lee Classon Nowack