Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProblems of Information Transmission, Volume 58
Volume 58, Number 1, April 2022
- Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound. 1-12 - A. Yu. Barinov:
Reduction of Recursive Filters to Representations by Sparse Matrices. 13-31 - S. Sharma, A. Sharma:
Multi-twisted Additive Codes with Complementary Duals over Finite Fields. 32-57 - Ivan Yu. Mogilnykh:
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group. 58-71 - A. S. Semenov, Dmitry A. Shabanov:
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs. 72-101
Volume 58, Number 2, April 2022
- V. A. Zorich:
Entropy in Thermodynamics and in Information Theory. 103-110 - Mladen Kovacevic
:
On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications. 111-121 - A. A. Kurmukova, Fedor I. Ivanov, Victor V. Zyablov:
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel. 122-136 - G. D. Dvorkin:
Geometric Interpretation of Entropy for Dyck Systems. 137-143 - A. V. Logachov, A. A. Mogulskii, E. I. Prokopenko:
Large Deviation Principle for Terminating Multidimensional Compound Renewal Processes with Application to Polymer Pinning Models. 144-159 - Alexander V. Kolnogorov:
Poissonian Two-Armed Bandit: A New Approach. 160-183 - Victor V. Zyablov, Fedor I. Ivanov, E. A. Krouk, Vladimir R. Sidorenko:
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding. 184-201
Volume 58, Number 3, July 2022
- Marat V. Burnashev:
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate. 203-216 - Vyacheslav V. Prelov:
On One Extremal Problem for Mutual Information. 217-230 - Ivan Yu. Mogilnykh, Faina I. Solov'eva:
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes. 231-241 - V. I. Vorob'ev, Vladimir S. Lebedev:
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes. 242-253 - Faina I. Solov'eva:
Partitions into Perfect Codes in the Hamming and Lee Metrics. 254-264 - Marat V. Burnashev:
On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices. 265-278 - Michael L. Blank:
Recoverable Formal Language. 279-283 - Ekatherina A. Karatsuba:
Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method. 284-296
Volume 58, Number 4, October 2022
- X. Y. Gui, Y. C. Huang:
Remarks on Reverse Pinsker Inequalities. 297-299 - Vyacheslav V. Prelov:
Coupling of Several Random Variables. 300-305 - Mercè Villanueva, Victor A. Zinoviev, Dmitrii V. Zinoviev:
On One Construction Method for Hadamard Matrices. 306-328 - Ilya V. Vorobyev, Christian Deppe, Alexey V. Lebedev, Vladimir S. Lebedev:
Correcting a Single Error in Feedback Channels. 329-340 - A. Janabekova, G. A. Kabatiansky, Ibrahim Kamel, Tamer F. Rabie:
Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory. 341-351 - Peter G. Boyvalenkov, Konstantin Delchev, Victor A. Zinoviev, Dmitrii V. Zinoviev:
On Codes with Distances d and n. 352-371 - Nikolai Dokuchaev:
Predictors for High Frequency Signals Based on Rational Polynomial Approximation of Periodic Exponentials. 372-381 - Ya. K. Shubin:
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs. 382-388 - O. V. Kamlovskii, K. N. Pankov:
Some Classes of Balanced Functions over Finite Fields with a Small Value of the Linear Characteristic. 389-402
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-04-26 18:31 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:
