OOIR: Observatory of International Research

Papers

(The median citation count of Problems of Information Transmission is 0. 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 2021-04-01 to 2025-04-01.)

Article	Citations
Large Deviation Principle for Terminating Multidimensional Compound Renewal Processes with Application to Polymer Pinning Models	6
Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method	5
A Transformation Preserving the Dimension and Minimum Weight of Cyclic Codes	5
On Constructions of Regular Hadamard Matrices and Bent Functions	4
Design of Polar Codes with Large Kernels	4
Counting the Number of Perfect Matchings, and Generalized Decision Trees	3
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals	3
On Intersections of Reed–Muller Like Codes	3
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes	2
Geometric Interpretation of the Entropy of Sofic Systems	2
On Nonlinear 1-Quasi-perfect Codes and Their Structural Properties	2
Correcting a Single Error in Feedback Channels	2
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs	2
Closed-Form Approximations for the URLLC Capacity Using $G/G/s$ Queues	2
Predictors for High Frequency Signals Based on Rational Polynomial Approximation of Periodic Exponentials	2
An Update on Optimal $(v,4,1)$ Binary Cyclically Permutable Constant Weight Codes and Cyclic $2$-$(v,4,1)$ Designs with Small $v$	2
Coupling of Several Random Variables	2
Convolutional Codes with Optimum Bidirectional Distance Profile	1
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels	1
Some Classes of Balanced Functions over Finite Fields with a Small Value of the Linear Characteristic	1
Prediction of Locally Stationary Data Using Expert Advice	1
Constructions of Nonbinary Codes Meeting the Johnson Bound	1
Coding in a Z-Channel in Case of Many Errors	1
Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method	1
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding	1

Near-Ideal Predictors and Causal Filters for Discrete-Time Signals	1
Entropy in Thermodynamics and in Information Theory	1
Constructions and Invariants of Optimal Codes in the Lee Metric	1
Efficient In-Place Hough Transform Algorithm for Arbitrary Image Sizes	1
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs	1
On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code	1
Modeling of Preemptive Channel Access in Wi-Fi Networks	1
On Additive Quasi-abelian Codes over Finite Fields and Their Duality Properties	1
New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$	1
Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective	1
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes	1
Geometric Interpretation of Entropy for Dyck Systems	1
On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range	1
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group	1
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance	1
Multi-twisted Additive Codes with Complementary Duals over Finite Fields	1
Elementary Solution to the Fair Division Problem	1
Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems	1
Partitions into Perfect Codes in the Hamming and Lee Metrics	0
Information Diagrams and Their Capabilities for Classifying Weak Signals	0
Half-Life and the Uncertainty Principle	0
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform	0
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel	0
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate	0
Existence of Sequences Satisfying Bilinear Type Recurrence Relations	0
Complexity-Preserving Transposition of Summing Algorithms: A Data Flow Graph Approach	0
On One Extremal Problem for Mutual Information	0
Reduction of Recursive Filters to Representations by Sparse Matrices	0
Remarks on Reverse Pinsker Inequalities	0
Series of Formulas for Bhattacharyya Parameters in the Theory of Polar Codes	0
New Turán Type Bounds for Johnson Graphs	0
On Perfect and Reed–Muller Codes over Finite Fields	0
Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges	0
Spectral Representation of Two-Sided Signals from $\ell_\infty$ and Applications to Signal Processing	0
On Codes with Distances $$d$$ and $$n$$	0
On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications	0
On List Decoding of Certain $$\mathbb{F}_q$$-Linear Codes	0
On the Maximum $$f$$-Divergence of Probability Distributions Given the Value of Their Coupling	0
Feedback Insertion-Deletion Codes	0
Recoverable Formal Language	0
Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements	0
Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution	0
Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding	0
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel	0
On Measuring the Topological Charge of Anyons	0
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals	0
Computation of the Fundamental Limits of Data Compression for Certain Nonstationary ARMA Vector Sources	0
Correcting a Single Error in an Asymmetric Feedback Channel	0
Poissonian Two-Armed Bandit: A New Approach	0
On One Construction Method for Hadamard Matrices	0

Impact of Modulation Constellation Type on the Finite Signal-to-Noise Ratio Diversity Gain in the Presence of a Multipath Fading Channel	0
Batch Poissonian Arrival Models of Multiservice Network Traffic	0
Geometric Interpretation of Entropy: New Results	0
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound	0
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes	0
Bounds on Borsuk Numbers in Distance Graphs of a Special Type	0
Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory	0
On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices	0
On an Evaluation Method for Zeta Constants Based on a Number Theoretic Approach	0
Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates	0
Design and Decoding of Polar Codes with Large Kernels: A Survey	0
On Universality of Regular Realizability Problems	0
Performance Evaluation of Wi-Fi 7 Networks with Restricted Target Wake Time	0
Time Synchronization in Satellite Quantum Key Distribution	0
Separable Collusion-Secure Multimedia Codes	0
Covering Codes for the Fixed Length Levenshtein Metric	0
Overparameterized Maximum Likelihood Tests for Detection of Sparse Vectors	0