Lower Bounds on Stopping Distance of Linear Codes and Their Applications
نویسندگان
چکیده
One of the most important open problems in the communication society is to determine the performance of iterative message passing algorithms over loopy graphs. Some recent work addresses this problem for loopy Tanner graphs by introducing the concepts of stopping distance and stopping redundancy. By analyzing the eigenvalues and eigenvectors of the normalized incidence matrix representing a Tanner graph, we derive lower bounds on its stopping distance. Using these lower bounds, an upper bound on stopping redundancy of the difference-set codes is derived as well.
منابع مشابه
Eigenvalue bounds on the pseudocodeword weight of expander codes
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derived. These bounds are compared with the known eigenvalue-based lower bounds on the minimum distance of expander codes. Furthermore, Tanner’s parity-oriented eigenva...
متن کاملMinimum distance and pseudodistance lower bounds for generalised LDPC codes
Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملCharacterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets
In this paper, we propose a characterization for non-elementary trapping sets (NETSs) of lowdensity parity-check (LDPC) codes. The characterization is based on viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The characterization corresponds to an efficient search algorithm that under certain conditions is exhaustive. As an application of the proposed characterization/sear...
متن کاملThe Stopping Redundancy Hierarchy of Cyclic Codes
We extend the framework for studying the stopping redundancy of a linear block code by introducing and analyzing the stopping redundancy hierarchy. The stopping redundancy hierarchy of a code represents a measure of the trade-off between performance and complexity of iteratively decoding a code used over the binary erasure channel. It is defined as an ordered list of positive integers in which ...
متن کامل