Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 56
Volume 56, Number 1, January 2020
- Vyacheslav V. Prelov:
On the Maximum Values of f-Divergence and Rényi Divergence under a Given Variational Distance. 1-12 - Riccardo Aragona
, Francesca Marzi, Filippo Mignosi, Matteo Spezialetti:
Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields. 13-22 - Y. Guan, Minjia Shi, Denis S. Krotov:
Steiner Triple Systems of Order 21 with a Transversal Subdesign TD(3, 6). 23-32 - Peter G. Boyvalenkov, Konstantin Delchev, Dmitrii V. Zinoviev, Victor A. Zinoviev:
On q-ary Codes with Two Distances d and d + 1. 33-44 - Nikolai L. Manev:
On Distance Distributions of Orthogonal Arrays. 45-55 - Fima C. Klebaner, A. V. Logachov, A. A. Mogulskii:
Extended Large Deviation Principle for Trajectories of Processes with Independent and Stationary Increments on the Half-line. 56-72 - Anastasia V. Gorbunova, Alexey V. Lebedev:
Bivariate Distributions of Maximum Remaining Service Times in Fork-Join Infinite-Server Queues. 73-90 - A. R. Vasin:
Piecewise Polynomial Sequences over the Galois Ring. 91-102
Volume 56, Number 2, April 2020
- Anuran Makur, L. Zheng:
Comparison of Contraction Coefficients for f-Divergences. 103-156 - Marat V. Burnashev:
New Upper Bounds in the Hypothesis Testing Problem with Information Constraints. 157-172 - Aleksei V. Kharin, K. N. Zavertkin, A. A. Ovinnikov:
Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis. 173-184 - G. K. Golubev:
On Adaptive Estimation of Linear Functionals from Observations against White Noise. 185-200
Volume 56, Number 3, July 2020
- Baris Nakiboglu:
The Sphere Packing Bound for Memoryless Channels. 201-244 - Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
Symmetric Block Designs and Optimal Equidistant Codes. 245-252 - Nupur Patanker, Sanjay Kumar Singh:
On Geometric Goppa Codes from Elementary Abelian p-Extensions of 픽ps(x). 253-269 - S. Wang, W. Zhang:
Research on Fractional Critical Covered Graphs. 270-277 - Alexander V. Kolnogorov:
Gaussian Two-Armed Bandit: Limiting Description. 278-301
Volume 56, Number 4, December 2020
- Mladen Kovacevic:
Signaling to Relativistic Observers: An Einstein-Shannon-Riemann Encounter. 303-308 - Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Bases of BCH Codes with Designed Distance 3 and Their Extensions. 309-316 - Aleksei V. Kharin, K. N. Zavertkin, A. A. Ovinnikov:
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis. 317-331 - Sizhong Zhou, Zhiren Sun, Q. Pan:
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs. 332-344 - P. A. Ogarok, Andrei M. Raigorodskii:
On Stability of the Independence Number of a Certain Distance Graph. 345-357 - I. V. Cherednik:
Peculiar Properties of the p-Linear Decomposition of p-Linear Functions in Terms of the Shift-Composition Operation. 358-372 - Lev A. Sholomov:
Polynomial Asymptotically Optimal Coding of Underdetermined Bernoulli Sources of the General Form. 373-387 - Elena Egorova, Marcel Fernandez, Gregory A. Kabatiansky, Ying Miao:
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise. 388-398 - Leonid A. Bassalygo:
Retraction Note: Note on "Smaller Explicit Superconcentrators" by N. Alon and M. Capalbo. 399
a service of 
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-05-03 20:49 CEST 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:
