A Probabilistic Subspace Approach to the Minimal Stopping Set Problem
Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany
Proceedings: TURBO - CODING - 2006
Pages: 6Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Hu, Xiao–Yu; Eleftheriou, Evangelos (IBM Research, Zurich Research Laboratory, 8803 Rüschlikon, Switzerland)
Determining the minimum size of stopping sets of a linear code is an important and yet difficult combinatorial problem for which the exhaustive search requires exponentially growing complexity. We propose a probabilistic subspace approach that can be applied to discover stopping sets of small size in a linear code, particularly for low-density parity-check (LDPC) codes.