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

A Lagrange-dual (Gallager-style) lower bound is derived for the errorexponent function of the typical random code (TRC) pertaining to the i.i.d.random coding ensemble and mismatched stochastic likelihood decoding. While theoriginal expression, derived from the method of types (the Csiszar-styleexpression) involves minimization over probability distributions defined on thechannel input--output alphabets, the new Lagrange-dual formula involvesoptimization of five parameters, independently of the alphabet sizes. For bothstochastic and deterministic mismatched decoding (including maximum likelihooddecoding as a special case),we provide a rather comprehensive discussion on theinsight behind the various ingredients of this formula and describe how itsbehavior varies as the coding rate exhausts the relevant range. Among otherthings, it is demonstrated that this expression simultaneously generalizes boththe expurgated error exponent function (at zero rate) and the classical randomcoding exponent function at high rates, where it also meets the sphere--packingbound.

A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code