English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the problem of Linear Programming (LP) decoding of binary linearcodes. The LP excess lemma was introduced by the first author, B. Ghazi, and R.Urbanke (IEEE Trans. Inf. Th., 2014) as a technique to trade crossoverprobability for "LP excess" over the Binary Symmetric Channel. We generalizethe LP excess lemma to discrete, binary-input, Memoryless, Symmetric andLLR-Bounded (MSB) channels. As an application, we extend a result by the firstauthor and H. Audah (IEEE Trans. Inf. Th., 2015) on the impact of redundantchecks on LP decoding to discrete MSB channels.

LP decoding excess over symmetric channels