Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"linear programming (LP) decoding"”.

  1. Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory

    Linear programming (LP) decoding of low-density parity-check codes was introduced by Feldman et al. in [1]. In his formulation it is assumed that communication takes place over a memoryless channel and that the source is uniform. Here, we extend the LP decoding paradigm by studying its application …

    queens Repository record for Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory (opens in a new tab)

  2. ADMM Decoding of LDPC Codes: Simplification and Improvement

    In this dissertation, we study linear programming (LP) decoding of low-density parity-check (LDPC) codes based on the alternating direction method of multipliers (ADMM) technique, or ADMM decoding for short. The decoding of LDPC codes is formulated as an LP model and solved efficiently by the ADMM …

    carleton Repository record for ADMM Decoding of LDPC Codes: Simplification and Improvement (opens in a new tab)

  3. Analysis of Failures of Decoders for LDPC Codes

    … when decoded using low complexity sub-optimal decoding algorithms. Iterative decoders are one such class of decoders that work on a graphical representation of a code known as the Tanner graph. Their properties have been well understood in the asymptotic limit of the code length going to …

    arizona-thes Repository record for Analysis of Failures of Decoders for LDPC Codes (opens in a new tab)

  4. Pseudocodewords of Parity-Check Codes

    The success of modern algorithms for the decoding problem such as message-passing iterative decoding and linear programming decoding lies in their local nature. This feature allows the algorithms to be extremely fast and capable of correcting more errors than guaranteed by the classical minimum …

    clemson Repository record for Pseudocodewords of Parity-Check Codes (opens in a new tab)

  5. Joint Equalization and Decoding via Convex Optimization

    … is the development of new solutions for decoding and inference problems based on convex optimization methods. Th first part considers the joint detection and decoding problem for low-density parity-check (LDPC) codes on finite-state channels (FSCs). Hard-disk drives (or magnetic recording …

    tamu Repository record for Joint Equalization and Decoding via Convex Optimization (opens in a new tab)