80 search results - page 4 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
136
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
131
click to vote
TCOM
2008
15 years 4 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...
138
Voted
STOC
1998
ACM
15 years 8 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
149
Voted
WCNC
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT × 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are...
145
Voted
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...