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

This paper is concerned with list decoding of $2$-interleaved binaryalternant codes. The principle of the proposed algorithm is based on acombination of a list decoding algorithm for (interleaved) Reed-Solomon codesand an algorithm for (non-interleaved) alternant codes. A new upper bound onthe decoding radius is derived and the list size is shown to scale polynomiallyin the code parameters. While it remains an open problem whether this upperbound is achievable, the provided simulation results show that a decodingradius exceeding the binary Johnson radius can be achieved with a highprobability of decoding success by the proposed algorithm.

List Decoding of 2-Interleaved Binary Alternant Codes