default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 54
Volume 54, Number 1, January 2018
- Dawei Ding, Mark M. Wilde:
Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels. 1-19 - Maksim E. Shirokov
:
On the Energy-Constrained Diamond Norm and Its Application in Quantum Information Theory. 20-33 - Darya I. Kovalevskaya:
Mollard Code as a Robust Nonlinear Code. 34-47 - Gregory A. Kabatiansky, Vladimir S. Lebedev:
On Metric Dimension of Nonbinary Hamming Spaces. 48-55 - A. S. Semenov, Dmitry A. Shabanov:
General Independence Sets in Random Strongly Sparse Hypergraphs. 56-69 - A. V. Berdnikov:
Chromatic Numbers of Distance Graphs with Several Forbidden Distances and without Cliques of a Given Size. 70-83 - Alexander V. Kolnogorov:
Gaussian Two-Armed Bandit and Optimization of Batch Data Processing. 84-100
Volume 54, Number 2, April 2018
- Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes. 101-115 - E. E. Egorova, V. S. Potapova:
Compositional Restricted Multiple Access Channel. 116-123 - I. V. Rodionov:
On Discrimination between Classes of Distribution Tails. 124-138 - A. A. Sagdeev:
Improved Frankl-Rödl Theorem and Some of Its Geometric Consequences. 139-164 - A. S. Gusev:
Clique Numbers of Random Subgraphs of Some Distance Graphs. 165-175 - Alexey V. Lebedev:
Maximum Remaining Service Time in Infinite-Server Queues. 176-190 - B. Ya. Ryabko:
Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems. 191-198
Volume 54, Number 3, July 2018
- Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
Analytical Properties of Shannon's Capacity of Arbitrarily Varying Channels under List Decoding: Super-Additivity and Discontinuity Behavior. 199-228 - Vyacheslav V. Prelov:
On Some Optimization Problems for the Rényi Divergence. 229-244 - Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes. 245-252 - M. S. Bespalov:
New Good's Type Kronecker Power Expansions. 253-257 - S. S. Marchenkov:
On the Complexity of Polynomial Recurrence Sequences. 258-262 - Nikita D. Vvedenskaya, A. V. Logachov, Yuri M. Suhov, Anatoly Yambartsev:
A Local Large Deviation Principle for Inhomogeneous Birth-Death Processes. 263-280 - S. N. Popova:
Infinite Spectra of First-Order Properties for Random Hypergraphs. 281-289 - Alexander A. Vladimirov, Sergey Pirogov, Alexandre N. Rybko, Senya B. Shlosman:
Propagation of Chaos and Poisson Hypothesis. 290-299
Volume 54, Number 4, October 2018
- Huseyin Afser, Hakan Deliç:
Polar Codes with Higher-Order Memory. 301-328 - Peter G. Boyvalenkov, Danyo Danev, Maya Stoyanova:
Refinements of Levenshtein Bounds in q-ary Hamming Spaces. 329-342 - I. S. Sergeev:
On the Complexity of Fibonacci Coding. 343-350 - G. K. Golubev, Ekaterina A. Krymova:
Noise Level Estimation in High-Dimensional Linear Models. 351-371 - A. A. Sagdeev:
Exponentially Ramsey Sets. 372-396
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-03-10 20:51 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:
