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

The well-known approach of Bose, Ray-Chaudhuri and Hocquenghem and itsgeneralization by Hartmann and Tzeng are lower bounds on the minimum distanceof simple-root cyclic codes. We generalize these two bounds to the case ofrepeated-root cyclic codes and present a syndrome-based burst error decodingalgorithm with guaranteed decoding radius based on an associated folded cycliccode. Furthermore, we present a third technique for bounding the minimumHamming distance based on the embedding of a given repeated-root cyclic codeinto a repeated-root cyclic product code. A second quadratic-time probabilisticburst error decoding procedure based on the third bound is outlined. IndexTerms Bound on the minimum distance, burst error, efficient decoding, foldedcode, repeated-root cyclic code, repeated-root cyclic product code

Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance