OOIR: Observatory of International Research

Papers

(The TQCC 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 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
Design of Polar Codes with Large Kernels	4
On Constructions of Regular Hadamard Matrices and Bent Functions	4
On Minimax Detection of Gaussian Stochastic Sequences and Gaussian Stationary Signals	3
On Intersections of Reed–Muller Like Codes	3
Counting the Number of Perfect Matchings, and Generalized Decision Trees	3
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
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
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
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