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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Computation of the undetected error probability for error detecting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper, Varshamov-Tenengol'ts (VT) codes are considered. First, an exact formula for the probability of undetected errors is given. It can be explicitly computed for small code lengths (up to approximately 25). Next, some lower bounds that can be explicitly computed up to almost twice this length are studied. A comparison to the Hamming codes is given. It is further shown that heuristic arguments give a very good approximation that can easily be computed even for large lengths. Finally, Monte Carlo methods are used to estimate performance for long code lengths.

Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes