Houshou Chen

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)
— In this paper, we consider reduction of PAPR in OFDM systems with BPSK subcarriers by combining SLM and binary cyclic codes. This combining strategy can be used for both error correction and PAPR reduction. We decompose a binary cyclic code into direct sum of two cyclic subcodes: the correction subcode used for error correction and the scrambling subcode(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)
— 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)
— In this paper, we propose 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(More)
Researchers have developed a great number of embedding techniques in steganography. Matrix embedding, otherwise called the binning scheme, is one such technique that has been proven to be an efficient algorithm. Unlike conventional matrix embedding, which requires a maximum likelihood decoding algorithm to find the coset leader, this study proposes an(More)