On the Stopping Distance and the Stopping Redundancy of Codes

Details On the Stopping Distance and the Stopping Redundancy of Codes On the Stopping Distance and the Stopping Redundancy of Codes

2005-03-23

arxiv.org/abs/cs/0503058v2

Computer Science

Information Theory

11 pages, 1 figure; to appear in the IEEE Transactions on Information Theory, March 2006

Scientific paper

It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent papers refer to this parameter as the \emph{stopping distance} $s$ of $C$. This is somewhat of a misnomer since the size of the smallest stopping set in the Tanner graph for $C$ depends on the corresponding choice of a parity-check matrix. It is easy to see that $s \le d$, where $d$ is the minimum Hamming distance of $C$, and we show that it is always possible to choose a parity-check matrix for $C$ (with sufficiently many dependent rows) such that $s = d$. We thus introduce a new parameter, termed the \emph{stopping redundancy} of $C$, defined as the minimum number of rows in a parity-check matrix $H$ for $C$ such that the corresponding stopping distance $s(H)$ attains its largest possible value, namely $s(H) = d$. We then derive general bounds on the stopping redundancy of linear codes. We also examine several simple ways of constructing codes from other codes, and study the effect of these constructions on the stopping redundancy. Specifically, for the family of binary Reed-Muller codes (of all orders), we prove that their stopping redundancy is at most a constant times their conventional redundancy. We show that the stopping redundancies of the binary and ternary extended Golay codes are at most 35 and 22, respectively. Finally, we provide upper and lower bounds on the stopping redundancy of MDS codes.

Affiliated with

Also associated with

No associations

Rating

On the Stopping Distance and the Stopping Redundancy of Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Stopping Distance and the Stopping Redundancy of Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Stopping Distance and the Stopping Redundancy of Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134739