14 search results - page 2 / 3 » Information sets and partial permutation decoding for codes ... |
NIPS
2001
13 years 6 months ago
2001
We report a result of perturbation analysis on decoding error of the belief propagation decoder for Gallager codes. The analysis is based on information geometry, and it shows tha...
TIT
2008
13 years 5 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
JSAC
2010
13 years 3 months ago
2010
Abstract— There is a well-known error-floor phenomenon associated with iterative LDPC decoders which has delayed the use of LDPC codes in certain communication and storage syste...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...