4 search results - page 1 / 1 » On the optimum distance profiles about linear block codes |
TIT
2010
13 years 14 days ago
2010
In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) are introduced to consider how to construct and then exclude (or include) the basis codewo...
CIC
2006
13 years 7 months ago
2006
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
TIT
2008
13 years 5 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...