Convex-hull characterization of the relaxed code polytope
Convex-hull characterization of the relaxed code polytope
Let be the set defined by the stated integer constraint lemma for and by the all-ones check of length . Let be the relaxed code polytope for associated with the all-ones checks. The notation denotes the convex hull of . Convex-hull conjecture. The relaxed code polytope equals the convex hull of the integral configurations:
This gives an exact polyhedral description for the all-ones check over and would establish tightness of the relaxation in this case. The source does not state a resolution, so the conjecture is recorded as open.
Sources & referencesView supporting material
Primary source
Xishuo Liu and Stark C. Draper, “ADMM LP decoding of non-binary LDPC codes in F_2^m”, arXiv:1409.5141 (2015).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.