71 search results - page 2 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
STOC
1995
ACM
13 years 9 months ago
1995
ACM
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...