نتایج جستجو برای: arbitrarily varying gradients

تعداد نتایج: 206206  

2008
Amin Aminzadeh Gohari Venkat Anantharam

In this paper we apply the “potential function method” introduced by the authors in [5] and [6] to prove an outer bound on the admissible source region of an arbitrarily varying general broadcast channel with arbitrarily correlated sources. We are not aware of any previous work discussing any interesting outer bounds on the admissible source region of the general broadcast channel either when t...

2008
Amin Aminzadeh Gohari Venkat Anantharam

In this paper we apply the “potential function method” introduced by the authors in [5] and [6] to prove an outer bound on the admissible source region of an arbitrarily varying general broadcast channel with arbitrarily correlated sources. We are not aware of any previous work discussing any interesting outer bounds on the admissible source region of the general broadcast channel either when t...

Journal: :IEEE Trans. Information Theory 1991
Rudolf Ahlswede Gábor Simonyi

· 'Abstract-"-Arbitrarily. varying ·(AV) . channels were introduced a,s a 111od~l ,for tra._s111ission. in .cases •. of. jamming. It is shown tllat th!!ir th~ry ap~lies naturally to 111e01ories and yields, in a unified way,'some . new and •qid ciiP,a~ity theol"(lms for write-· tiliidirectional (and 'more general) 'memories With side information: If the encOder has no si~e information, if iir st...

1998
Paul Mansfield Marcos Sampaio

For slowly varying fields the Yang-Mills Schrödinger functional can be expanded in terms of local functionals. We show how analyticity in a complex scale parameter enables the Schrödinger functional for arbitrarily varying fields to be reconstructed from this expansion. We also construct the form of the Schrödinger equation that determines the coefficients. Solving this in powers of the couplin...

Journal: :CoRR 2017
Holger Boche Minglai Cai Christian Deppe Janis Noetzel

We determine the secrecy capacities of arbitrarily varying quantum channels. Both secrecy capacity with average error probability and with maximal error probability are derived. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. We determine when the secrecy capacity is a continuous function of the system parameters and completely characteri...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید