OOIR: Observatory of International Research

Papers

(The median citation count of Problems of Information Transmission is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-04-01 to 2024-04-01.)

Article	Citations
Research on Fractional Critical Covered Graphs	35
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs	15
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise	12
Comparison of Contraction Coefficients for f-Divergences	9
The Sphere Packing Bound for Memoryless Channels	8
Bounds on Borsuk Numbers in Distance Graphs of a Special Type	6
Gaussian Two-Armed Bandit: Limiting Description	6
Separable Collusion-Secure Multimedia Codes	5
On the Generalized Concatenated Construction for Codes in $${L_1}$$ and Lee Metrics	5
Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost	4
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform	4
On Perfect and Reed–Muller Codes over Finite Fields	4
Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis	3
On Stability of the Independence Number of a Certain Distance Graph	3
New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$	2
Affine Variety Codes over a Hyperelliptic Curve	2
Geometric Interpretation of Entropy: New Results	2
Multi-twisted Additive Codes with Complementary Duals over Finite Fields	2
Symmetric Block Designs and Optimal Equidistant Codes	2
Entropy in Thermodynamics and in Information Theory	2
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis	2
On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range	2
Correcting a Single Error in Feedback Channels	2
Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter	2
On the Maximum $$f$$-Divergence of Probability Distributions Given the Value of Their Coupling	1

On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications	1
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes	1
On Bases of BCH Codes with Designed Distance 3 and Their Extensions	1
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs	1
Poissonian Two-Armed Bandit: A New Approach	1
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding	1
On Intersections of Reed–Muller Like Codes	1
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound	1
On Codes with Distances $$d$$ and $$n$$	1
On One Construction Method for Hadamard Matrices	1
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group	1
Geometric Interpretation of Entropy for Dyck Systems	1
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes	1
The f-Divergence and Coupling of Probability Distributions	1
Predictors for High Frequency Signals Based on Rational Polynomial Approximation of Periodic Exponentials	1
Feedback Insertion-Deletion Codes	1
New Turán Type Bounds for Johnson Graphs	1
On an Evaluation Method for Zeta Constants Based on a Number Theoretic Approach	1
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance	1
Partitions into Perfect Codes in the Hamming and Lee Metrics	1
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels	1
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals	1
New Upper Bounds in the Hypothesis Testing Problem with Information Constraints	1