71 search results - page 1 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
MST
2010
13 years 3 months ago
2010
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always tr...