On adaptive linear programming decoding of ternary linear codes

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Information Theory Workshop

• Publication date

  2015-06-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ITW.2015.7133150
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels

  2014cited by this paper
• ADMM decoding of non-binary LDPC codes in F2m

  2014cited by this paper
• Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity

  2013cited by this paper
• Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes

  2011cited by this paper
• Decomposition methods for large scale LP decoding

  2011cited by this paper
• Characterization of graph-cover pseudocodewords of codes over F3

  2010cited by this paper
• Linear-Programming Decoding of Nonbinary Linear Codes

  2007influential reference
• Adaptive Methods for Linear Programming Decoding

  2007cited by this paper
• Towards Low-Complexity Linear-Programming Decoding

  2006cited by this paper
• Using linear programming to Decode Binary linear codes

  2005cited by this paper

• Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields

  2020influential citation
• On adaptive linear programming decoding of nonbinary linear codes over prime fields

  2016influential citation
• On adaptive linear programming decoding of linear codes over GF(8)

  2016cites this paper
• Constructing valid convex hull inequalities for single parity-check codes over prime fields

  2016cites this paper