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

The secrecy capacity problems over the general arbitrarily varying wiretapchannel (AVWC), with respect to the maximal decoding error probability andstrong secrecy criterion, are considered, where the channel state sequence maybe known or unknown at the receiver. In the mean time, it is always assumedthat the channel state sequence is known at the eavesdropper and unknown at thetransmitter. Capacity results of both stochastic code (with random encoder anddeterministic decoder) and random code (with random encoder and decoder) arediscussed. This model includes the previous models of classic AVWC as specialcases. Single-letter lower bounds on the secrecy capacities are given, whichare proved to be the secrecy capacities when the main channel is less noisythan the wiretap channel. The coding scheme is based on Csiszar's almostindependent coloring scheme and Ahlswede's elimination technique. Moreover, anew kind of typical sequence with respect to states is defined for this codingscheme. It is concluded that the secrecy capacity of stochastic code isidentical to that of random code when the receiver knows the state sequence.Meanwhile, random code may achieve larger secrecy capacity when the statesequence is unknown by the receiver.

Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver