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 symbol-pair codes over finite fields have been raised for symbol-pairread channels and motivated by application of high-density data storagetechnologies [1, 2]. Their generalization is the code for b-symbol readchannels (b > 2). Many MDS codes for b-symbol read channels have beenconstructed which meet the Singleton-like bound ([3, 4, 10] for b = 2 and [11]for b > 2). In this paper we show the Plotkin-like bound and present aconstruction on irreducible cyclic codes and constacyclic codes meeting thePlotkin-like bound.

Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound