default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 52
Volume 52, Number 1, January 2016
- Evgeny Bakin
, Grigory Evseev:
Remark on "on the capacity of a multiple-access vector adder channel" by A.A. Frolov and V.V. Zyablov. 1-5 - Alexey A. Frolov:
Upper bound on the minimum distance of LDPC codes over GF(q) based on counting the number of syndromes. 6-13 - Veniamin N. Tarasov:
Analysis of queues with hyperexponential arrival distributions. 14-23 - V. D. Shmatkov:
Lattice flows in networks. 24-38 - Naqueeb Ahmad Warsi:
Simple one-shot bounds for various source coding problems using smooth Rényi quantities. 39-65 - Talha Cihad Gülcü, Alexander M. Barg:
Interactive function computation via polar coding. 66-91 - A. S. Lysyak, B. Ya. Ryabko:
Time series prediction based on data compression methods. 92-99 - Ekatherina A. Karatsuba:
Erratum to: "On one method for constructing a family of approximations of zeta constants by rational fractions". 100-101
Volume 52, Number 2, April 2016
- Vladimir S. Lebedev:
Coding with noiseless feedback. 103-113 - Victor A. Zinoviev, Dmitrii V. Zinoviev:
Generalized Preparata codes and 2-resolvable Steiner quadruple systems. 114-133 - Yuri L. Borissov:
Some new results on Hadamard modulo prime matrices. 134-141 - N. A. Polyansky:
Almost cover-free codes. 142-155 - S. G. Foss, Bruce E. Hajek, Andrey M. Turlikov:
Doubly randomized protocols for a random multiple access channel with "success-nonsuccess" feedback. 156-165 - A. S. Chizhov:
On interval modal logic with "after" relation. 166-177 - François Baccelli, Alexandre N. Rybko, Senya B. Shlosman:
Queueing networks with mobile servers: The mean-field approach. 178-199 - Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyansky, Vladislav Yu. Shchukin:
Erratum to: "Bounds on the rate of disjunctive codes". 200
Volume 52, Number 3, July 2016
- Francesco Buscemi:
Degradable channels, less noisy channels, and quantum statistical morphisms: An equivalence relation. 201-213 - Siddharth Karumanchi, Stefano Mancini, Andreas J. Winter, Dong Yang:
Classical capacities of quantum channels with environment assistance. 214-238 - Maksim E. Shirokov:
Estimates for discontinuity jumps of information characteristics of quantum systems and channels. 239-264 - Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On the symmetry group of the Mollard code. 265-275 - Ernst M. Gabidulin, Nina I. Pilipchuk:
Multicomponent codes with maximum code distance. 276-283 - Denis S. Krotov, Anastasia Yu. Vasil'eva:
On perfect codes that do not contain Preparata-like codes. 284-288 - Ivan Yu. Mogilnykh:
On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code. 289-298 - Michael L. Blank:
The problem of fair division for a hybrid resource. 299-307 - Vadim A. Malyshev:
The Newton and Coulomb laws as information transfer by virtual particles. 308-318
Volume 52, Number 4, October 2016
- Vyacheslav V. Prelov:
On some extremal problems for mutual information and entropy. 319-328 - Vladislav Yu. Shchukin:
List decoding for a multiple access hyperchannel. 329-343 - G. K. Golubev:
On risk concentration for convex combinations of linear estimators. 344-358 - M. S. Bespalov, A. S. Golubev, A. S. Pochenchuk:
Derivation of fast algorithms via binary filtering of signals. 359-372 - A. V. Bobu, A. E. Kupriyanov:
On chromatic numbers of close-to-Kneser distance graphs. 373-390 - S. N. Zaitsev:
A triangular class of skew maximum-period polynomials. 391-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 2025-11-29 00:09 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:
