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

Streaming codes are a class of packet-level erasure codes that ensure packetrecovery over a sliding window channel which allows either a burst erasure ofsize $b$ or $a$ random erasures within any window of size $(\tau+1)$ timeunits, under a strict decoding-delay constraint $\tau$. The field size overwhich streaming codes are constructed is an important factor determining thecomplexity of implementation. The best known explicit rate-optimal streamingcode requires a field size of $q^2$ where $q \ge \tau+b-a$ is a prime power. Inthis work, we present an explicit rate-optimal streaming code, for all possible$\{a,b,\tau\}$ parameters, over a field of size $q^2$ for prime power $q \ge\tau$. This is the smallest-known field size of a general explicit rate-optimalconstruction that covers all $\{a,b,\tau\}$ parameter sets. We achieve this bymodifying the non-explicit code construction due to Krishnan et al. to make itexplicit, without change in field size.

Explicit Rate-Optimal Streaming Codes with Smaller Field Size