Problems of Information Transmission

Papers
(The TQCC of Problems of Information Transmission is 2. 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-03-01 to 2024-03-01.)
ArticleCitations
Research on Fractional Critical Covered Graphs34
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in Graphs15
Existence and Construction of Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise11
Comparison of Contraction Coefficients for f-Divergences9
The Sphere Packing Bound for Memoryless Channels8
Bounds on Borsuk Numbers in Distance Graphs of a Special Type6
Gaussian Two-Armed Bandit: Limiting Description6
Separable Collusion-Secure Multimedia Codes5
On the Generalized Concatenated Construction for Codes in $${L_1}$$ and Lee Metrics5
Trade-off for Heterogeneous Distributed Storage Systems between Storage and Repair Cost4
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform4
On Perfect and Reed–Muller Codes over Finite Fields4
Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis3
On Stability of the Independence Number of a Certain Distance Graph3
New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$2
Entropy in Thermodynamics and in Information Theory2
Geometric Interpretation of Entropy: New Results2
Multi-twisted Additive Codes with Complementary Duals over Finite Fields2
Symmetric Block Designs and Optimal Equidistant Codes2
Affine Variety Codes over a Hyperelliptic Curve2
Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis2
On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range2
Correcting a Single Error in Feedback Channels2
Signaling to Relativistic Observers: An Einstein–Shannon–Riemann Encounter2
0.22589206695557