Jar decoding: LDPC coding theorems for binary input memoryless channels

Recently, a new decoding rule called jar decoding was proposed, under which the decoder first forms a set of suitable size, called a jar, consisting of sequences from the channel input alphabet considered to be closely related to yn, and then takes any codeword from the jar as the estimate of the transmitted codeword. In this paper, we show that under jar… CONTINUE READING