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 the study of the capacity problem for multiple access channels (MACs), alower bound on the error probability obtained by Han plays a crucial role inthe converse parts of several kinds of channel coding theorems in theinformation-spectrum framework. Recently, Yagi and Oohama showed a tighterbound than the Han bound by means of Polyanskiy's converse. In this paper, wegive a new bound which generalizes and strengthens the Yagi-Oohama bound, anddemonstrate that the bound plays a fundamental role in deriving extensions ofseveral known bounds. In particular, the Yagi-Oohama bound is generalized totwo different directions; i.e, to general input distributions and to generalencoders. In addition we extend these bounds to the quantum MACs and apply themto the converse problems for several information-spectrum settings.

ieice transactions on fundamentals of electronics, communications and computer sciences/ieice transactions on fundamentals of electronics, communications and computer science

A Fundamental Inequality for Lower-bounding the Error Probability for Classical and Quantum Multiple Access Channels and Its Applications