Efficient coding of side information for selected mapping PAPR reduction

Design of linear block codes for efficient coding of selected mapping side information is considered. We define an efficient code as one which resolves the following fundamental tradeoff: the code rate has to be low in order to keep the payload bit error rate as close as required to the payload bit error rate when side information is errorless, and has to be high in order not to waste bandwidth. First we derive a general upper bound on the code rate of such efficient linear block codes. We then specifically formulate the design of BCH codes, and show that their achieved code rates are very close to upper bound. Although we focus on OFDM with selected mapping, our approach is applicable to all cases where there is a need to transmit side information along with payload, and the knowledge of side information at the receiver is crucial for decoding.