default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 50
Volume 50, Number 1, January 2014
- Alexander S. Holevo:
Gaussian classical-quantum channels: Gain from entanglement-assistance. 1-14 - Moritz Wiese, Holger Boche:
On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders. 15-26 - Arkadii G. D'yachkov, Ilya V. Vorobyev
, N. A. Polyansky, Vladislav Yu. Shchukin:
Bounds on the rate of disjunctive codes. 27-56 - S. N. Popova:
Zero-one law for random distance graphs with vertices in {-1, 0, 1} n . 57-78 - M. E. Kovalenko, Timofey A. Urbanovich:
On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements. 79-89 - O. V. Kamlovskii:
Distribution of r-tuples in one class of uniformly distributed sequences over residue rings. 90-105 - A. N. Starovoitov:
Conditions for a product-form stationary distribution of one queueing system with batch transfers and a disaster flow. 106-116
Volume 50, Number 2, April 2014
- Mark M. Wilde, Andreas J. Winter:
Strong converse for the classical capacity of the pure-loss bosonic channel. 117-132 - Alexey A. Frolov, Victor V. Zyablov:
On the capacity of a multiple-access vector adder channel. 133-143 - Jiang Xue, Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah:
Error exponents for Nakagami-m fading channels. 144-170 - O. V. Kamlovskii:
Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings. 171-185 - Ekatherina A. Karatsuba:
On one method for fast approximation of zeta constants by rational fractions. 186-202
Volume 50, Number 3, July 2014
- Vyacheslav V. Prelov:
On one extreme value problem for entropy and error probability. 203-216 - Marat V. Burnashev, Hirosuke Yamamoto:
On using noisy feedback in a Gaussian channel. 217-231 - Maksim E. Shirokov, T. V. Shulman:
On superactivation of one-shot quantum zero-error capacity and the related property of quantum measurements. 232-246 - Arkadii G. D'yachkov, A. N. Kuzina, N. A. Polyansky, Anthony J. Macula, Vyacheslav V. Rykov:
DNA codes for nonadditive stem similarity. 247-269 - Victor A. Zinoviev, Dmitrii V. Zinoviev:
Non-full-rank Steiner quadruple systems S(v, 4, 3). 270-279 - Vladimir M. Blinovsky:
Proof of two conjectures on correlation inequalities for one class of monotone functions. 280-284 - Yuri M. Shtarkov:
Universal coding algorithm for a family of context Markov sources. 285-291 - Michael A. Raskin:
Remark on "Toom's partial order is transitive" published in Probl. Peredachi Inf., 2012, no. 2. 292-301
Volume 50, Number 4, October 2014
- Peter Vladimirovich Trifonov:
Successive cancellation decoding of Reed-Solomon codes. 303-312 - Leonid A. Bassalygo, Victor A. Zinoviev:
Optimal almost equisymbol codes based on difference matrices. 313-319 - Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Aleksei Andreevich Kreshchuk, Stefano Marcugini, Fernanda Pambianco:
Upper bounds on the smallest size of a complete arc in PG(2, q) under a certain probabilistic conjecture. 320-339 - Vladimir M. Blinovsky:
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. 340-349 - Michael L. Blank:
Interlacing and smoothing: Combinatorial aspects. 350-363 - Dmitrii V. Zinoviev:
On the number of 1-factorizations of a complete graph. 364-370 - V. R. Fatalov:
Gaussian Ornstein-Uhlenbeck and Bogoliubov processes: Asymptotics of small deviations for L p -functionals, 0 < p < ∞. 371-389 - Boris D. Kudryashov, Anton V. Porov:
Universal coding for memoryless sources with countably infinite alphabets. 390-399
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
