Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
— In this work, we examine a family of anti-collusion codes using the principle of “Orthogonal Spreading followed by the Inverse Fourier Transform (OSIFT)” as introduced in [...
—This paper studies orthogonal frequency-division multiplexing (OFDM) systems employing coded modulation. Clipping is applied to reduce the peak-to-average-power-ratio (PAPR) of ...
In this paper, we exploit a recently introduced coding algorithm called multidimensional multiscale parser (MMP) as an alternative to the traditional transform quantization-based m...
Nuno M. M. Rodrigues, Eduardo A. B. da Silva, Muri...
In this paper, a method to design regular (2, dc)-LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of thei...
Charly Poulliat, Marc P. C. Fossorier, David Decle...