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

Product codes (PCs) protect a two-dimensional array of bits using shortcomponent codes. Assuming transmission over the binary symmetric channel, thedecoding is commonly performed by iteratively applying bounded-distancedecoding to the component codes. For this coding scheme, undetected errors inthe component decoding-also known as miscorrections-significantly degrade theperformance. In this paper, we propose a novel iterative decoding algorithm forPCs which can detect and avoid most miscorrections. The algorithm can also beused to decode many recently proposed classes of generalized PCs such asstaircase, braided, and half-product codes. Depending on the component codeparameters, our algorithm significantly outperforms the conventional iterativedecoding method. As an example, for double-error-correctingBose-Chaudhuri-Hocquenghem component codes, the net coding gain can beincreased by up to 0.4 dB. Moreover, the error floor can be lowered by ordersof magnitude, up to the point where the decoder performs virtually identical toa genie-aided decoder that avoids all miscorrections. We also discusspost-processing techniques that can be used to reduce the error floor evenfurther.

Approaching Miscorrection-free Performance of Product and Generalized Product Codes