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

This paper studies channel coding for the discrete memoryless multiple-accesschannel with a given (possibly suboptimal) decoding rule. A multi-lettersuccessive decoding rule depending on an arbitrary non-negative decoding metricis considered, and achievable rate regions and error exponents are derived bothfor the standard MAC (independent codebooks), and for the cognitive MAC (oneuser knows both messages) with superposition coding. In the cognitive case, therate region and error exponent are shown to be tight with respect to theensemble average. The rate regions are compared with those of thecommonly-considered decoder that chooses the message pair maximizing thedecoding metric, and numerical examples are given for which successive decodingyields a strictly higher sum rate for a given pair of input distributions.

Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel