Sciweavers

68 search results - page 9 / 14
» dcc 2006
Sort
View
DCC
2006
IEEE
15 years 9 months ago
LDPC codes generated by conics in the classical projective plane
We construct various classes of low-density parity-check codes using point-line incidence structures in the classical projective plane PG(2, q). Each incidence structure is based ...
Sean V. Droms, Keith E. Mellinger, Chris Meyer
92
Voted
DCC
2006
IEEE
15 years 9 months ago
Roux-type constructions for covering arrays of strengths three and four
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
Charles J. Colbourn, Sosina Martirosyan, Tran van ...
DCC
2006
IEEE
15 years 9 months ago
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. ...
90
Voted
DCC
2006
IEEE
15 years 9 months ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...
86
Voted
DCC
2006
IEEE
15 years 9 months ago
Making the Correct Mistakes
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
Dharmendra S. Modha, Narayana P. Santhanam