Corpus ID: 16969105

A new Algorithm to construct LDPC codes with large stopping sets

@inproceedings{Ripoll2013ANA,
  title={A new Algorithm to construct LDPC codes with large stopping sets},
  author={Juan Camilo Salazar Ripoll and N. R. Barraza},
  year={2013}
}
A new algorithm to construct good low-density parity-check (LDPC) codes with large stopping sets is presented. Since the minimum stopping set characterizes an LDPC code, searching for stopping sets in LDPC codes is an important issue. Large minimum stopping sets avoid the LDPC code to get trapped in cycles specially on the binary erasure channel. Dealing with stopping sets is not an easy task since their discovering is a well known NP hard problem. Conversely, we propose an algorithm in order… Expand

Figures from this paper

A Survey on Trapping Sets and Stopping Sets
Detection and Removal of Cycles in LDPC Codes

References

SHOWING 1-8 OF 8 REFERENCES
On a Construction Method of Irregular LDPC Codes Without Small Stopping Sets
  • G. Richter, A. Hof
  • Computer Science
  • 2006 IEEE International Conference on Communications
  • 2006
Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes
Coset graphs for low-density parity check codes: performance on the binary erasure channel
Low-density parity-check codes
  • R. Gallager
  • Mathematics, Computer Science
  • IRE Trans. Inf. Theory
  • 1962
Construction of Girth 8 LDPC Codes based on Multidimensional Finite Lattices
Near Shannon limit performance of low density parity check codes
On the Complexity of finding Stopping Distance in Tanner Graphs