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 2021-12-01 to 2025-12-01.)
ArticleCitations
Constructions and Invariants of Optimal Codes in the Lee Metric6
Coupling of Several Random Variables6
An Update on Optimal $(v,4,1)$ Binary Cyclically Permutable Constant Weight Codes and Cyclic $2$-$(v,4,1)$ Designs with Small $v$6
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding5
Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method5
Poissonian Two-Armed Bandit: A New Approach4
Covering Codes for the Fixed Length Levenshtein Metric4
Technique for Transforming Discrete Optimization Problems into QUBO Form3
Analytical Representation of Complexity Diagrams3
Recoverable Formal Language3
Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method2
Probabilistic Methods for Deriving New Lower Bounds on the Rates of Locally Thin Families and Weak Superimposed Codes2
Impact of Modulation Constellation Type on the Finite Signal-to-Noise Ratio Diversity Gain in the Presence of a Multipath Fading Channel2
Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates2
Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements2
A Transformation Preserving the Dimension and Minimum Weight of Cyclic Codes2
Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory2
Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in $\{-1,0,1\}^n$2
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs2
Reducing Energy Consumption in LoRaWAN Networks with Duty Cycle Limitation2
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes2
On One Construction Method for Hadamard Matrices2
0.01678204536438