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

In this work, a new upper bound for average error probability of a two-userdiscrete memoryless (DM) multiple-access channel (MAC) is derived. This boundcan be universally obtained for all discrete memoryless MACs with given inputand output alphabets. This is the first bound of this type that explicitly usesthe method of expurgation. It is shown that the exponent of this bound isgreater than or equal to those of previously known bounds.

A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels