Problems of Information Transmission

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-05-01 to 2025-05-01.)
ArticleCitations
Coupling of Several Random Variables6
Constructions and Invariants of Optimal Codes in the Lee Metric5
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding5
An Update on Optimal $(v,4,1)$ Binary Cyclically Permutable Constant Weight Codes and Cyclic $2$-$(v,4,1)$ Designs with Small $v$5
Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method4
Poissonian Two-Armed Bandit: A New Approach4
Recoverable Formal Language3
Covering Codes for the Fixed Length Levenshtein Metric3
Analysis of Properties of Dyadic Patterns for the Fast Hough Transform2
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs2
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels2
Reducing Energy Consumption in LoRaWAN Networks with Duty Cycle Limitation2
On List Decoding of Certain $$\mathbb{F}_q$$-Linear Codes2
Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method2
On Data Compression and Recovery for Sequences Using Constraints on the Spectrum Range2
Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory2
Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements2
Analytical Representation of Complexity Diagrams2
A Transformation Preserving the Dimension and Minimum Weight of Cyclic Codes2
On Perfect and Reed–Muller Codes over Finite Fields2
New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$2
Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates1
Efficient In-Place Hough Transform Algorithm for Arbitrary Image Sizes1
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes1
Large Deviation Principle for Terminating Multidimensional Compound Renewal Processes with Application to Polymer Pinning Models1
Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance1
Time Synchronization in Satellite Quantum Key Distribution1
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound1
Impact of Modulation Constellation Type on the Finite Signal-to-Noise Ratio Diversity Gain in the Presence of a Multipath Fading Channel1
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals1
Some Classes of Balanced Functions over Finite Fields with a Small Value of the Linear Characteristic1
Series of Formulas for Bhattacharyya Parameters in the Theory of Polar Codes1
On an Evaluation Method for Zeta Constants Based on a Number Theoretic Approach1
Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution1
On the Maximum $$f$$-Divergence of Probability Distributions Given the Value of Their Coupling1
On Universality of Regular Realizability Problems1
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes1
Design of Polar Codes with Large Kernels1
Entropy in Thermodynamics and in Information Theory1
Existence of Sequences Satisfying Bilinear Type Recurrence Relations1
On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code1
Geometric Interpretation of Entropy: New Results1
On One Construction Method for Hadamard Matrices1
0.050153017044067