Learn More
Generalized Hamming weight hierarchies and permutation-optimal trellis decoders are found for several extremal self-dual codes. The latter problem involves finding chains of subcodes that allow construction of a uniformly efficient permutation. The task of finding such chains of subcodes is shown to be substantially simplifiable in the case of self-dual(More)
This paper proposes a novel peak-to-average power ratio (PAPR) reduction method with low complexity by combining the RM-PTS scheme with the PCGA-PTS scheme, called RM-PCGA-PTS. The RM-PTS scheme not only the transmitted signal has error correction capability but also the transmitter has no need to transmit side information. However, one major drawback of(More)
This paper proposed a PAPR reduction method for BPSK OFDM systems and 16-QAM OFDM systems respectively. The strategy of the algorithms is to use a correction subcode for error control and a scrambling subcode for PAPR control. The transmitted OFDM sequence is selected with minimum PAPR from a number of candidates which form a coset of scrambling subcode for(More)
This paper examines the performance gains achievable by adding interblock memory to, and altering the mapping of coded bits to symbols in, block coded modulation systems. The channel noise considered is additive Gaussian, and the twin design goals are to maximize the asymptotic coding gain and to minimize the number of apparent nearest neighbors. In the(More)
One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) is the high peak-to-average ratio (PAPR) of the transmitted signal. The PTS method divides the input data block into disjoint subblocks and recombines them by using weighting factors. The searching complexity of the original PTS method increases exponentially with the number of(More)
A novel suboptimal hiding algorithm for binary data based on weight approximation embedding, WAE, is proposed. Given a specified embedding rate, this algorithm exhibits an advantage of efficient binary embedding with reduced embedding complexity. The suboptimal WAE algorithm performs an embedding procedure through a parity check matrix. The optimal(More)