Sciweavers

2572 search results - page 90 / 515
» codes 2008
Sort
View
121
Voted
TIT
2002
78views more  TIT 2002»
15 years 3 months ago
Improved upper bounds on sizes of codes
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...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
ISCAS
2008
IEEE
155views Hardware» more  ISCAS 2008»
15 years 10 months ago
Advanced colluder detection techniques for OSIFT-based hiding codes
— 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 [...
Byung-Ho Cha, C. C. Jay Kuo
93
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Iterative Detection Techniques for Clipped OFDM Systems
—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 ...
Jun Tong, Li Ping
TIP
2008
144views more  TIP 2008»
15 years 3 months ago
On Dictionary Adaptation for Recurrent Pattern Image Coding
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...
152
Voted
TCOM
2008
151views more  TCOM 2008»
15 years 1 months ago
Design of regular (2, dc)-LDPC codes over GF(q) using their binary images
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...