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 proposes a novel algorithm for finding error-locators ofalgebraic-geometric codes that can eliminate the division-calculations offinite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-freealgorithm provides full performance in correcting a certain class of errors,generic errors, which includes most errors, and can decode codes on algebraiccurves without the determination of unknown syndromes. Moreover, we proposethree different kinds of architectures that our algorithm can be applied to,and we represent the control operation of shift-registers and switches at eachclock-timing with numerical simulations. We estimate the performance incomparison of the total running time and the numbers of multipliers andshift-registers in three architectures with those of the conventional ones forcodes on algebraic curves.

Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes