1016 search results - page 47 / 204 » Linear error-block codes |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we propose a rate-compatible serially concatenated structure consisting of an outer linear extended BCH code and an inner recursive systematic convolutional code...
TIT
2008
13 years 9 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
DAM
1998
13 years 9 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...