3373 search results - page 109 / 675 » Linear transformations on codes |
137
click to vote
CIE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
117
click to vote
TIT
2008
15 years 3 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...
114
click to vote
CORR
2007
Springer
15 years 3 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...
116
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
— In 1982 Ungerboeck presented a set-partitioning design technique for trellis coded modulation (TCM). Although this technique directly assigns constellation points to the branch...
100
click to vote
TCOM
2008
15 years 3 months ago
2008
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...