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

Suppose we have two players $A$ and $C$, where player $A$ has a string$s[0..u-1]$ and player $C$ has a string $t[0..u-1]$ and none of the two playersknows the other's string. Assume that $s$ and $t$ are both over an integeralphabet $[\sigma]$, where the first string contains $n$ non-zero entries. Wewould wish to answer to the following basic question. Assuming that $s$ and $t$differ in at most $k$ positions, how many bits does player $A$ need to send toplayer $C$ so that he can recover $s$ with certainty? Further, how much timedoes player $A$ need to spend to compute the sent bits and how much time doesplayer $C$ need to recover the string $s$?  This problem has a certain number of applications, for example in databases,where each of the two parties possesses a set of $n$ key-value pairs, wherekeys are from the universe $[u]$ and values are from $[\sigma]$ and usually$n\ll u$. In this paper, we show a time and message-size optimal Las Vegasreduction from this problem to the problem of systematic error correction of$k$ errors for strings of length $\Theta(n)$ over an alphabet of size$2^{\Theta(\log\sigma+\log (u/n))}$. The additional running time incurred bythe reduction is linear randomized for player $A$ and linear deterministic forplayer $B$, but the correction works with certainty. When using the popularReed-Solomon codes, the reduction gives a protocol that transmits $O(k(\logu+\log\sigma))$ bits and runs in time $O(n\cdot\mathrm{polylog}(n)(\logu+\log\sigma))$ for all values of $k$. The time is randomized for player $A$(encoding time) and deterministic for player $C$ (decoding time). The space isoptimal whenever $k\leq (u\sigma)^{1-\Omega(1)}$.

Optimal Las Vegas reduction from one-way set reconciliation to error correction