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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Due to their weak algebraic structure, low rank parity check (LRPC) codeshave been employed in several post-quantum cryptographic schemes. In this paperwe propose new improved decoding algorithms for (n, k) LRPC codes of dual rankweight d. The proposed algorithms can efficiently decode LRPC codes with theparameters satisfying n - k = rd - c, where r is the dimension of the errorsupport and c <= d - 2. They outperform the original decoding algorithm of LRPCcodes when d > 2 and allow for decoding LRPC codes with a higher code rate andsmaller values m.

Two new algorithms for error support recovery of low rank parity check codes