Problems of Information Transmission

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-08-01 to 2025-08-01.)
ArticleCitations
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$5
Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method5
Constructions and Invariants of Optimal Codes in the Lee Metric5
Poissonian Two-Armed Bandit: A New Approach3
On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding3
Recoverable Formal Language2
Analytical Representation of Complexity Diagrams2
A Transformation Preserving the Dimension and Minimum Weight of Cyclic Codes2
Reducing Energy Consumption in LoRaWAN Networks with Duty Cycle Limitation2
New Lower Bounds on the Fraction of Correctable Errors under List Decoding in Combinatorial Binary Communication Channels2
Testing the Satisfiability of Algebraic Formulas over the Field of Two Elements2
Lower Bound on the Minimum Number of Edges in Subgraphs of Johnson Graphs2
New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$2
Nonoverlapping Convex Polytopes with Vertices in a Boolean Cube and Other Problems in Coding Theory2
Covering Codes for the Fixed Length Levenshtein Metric2
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
Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates2
Effective Error Floor Estimation Based on Importance Sampling with the Uniform Distribution1
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes1
On the Classification of Completely Regular Codes with Covering Radius Two and Antipodal Duals1
On the Maximum $$f$$-Divergence of Probability Distributions Given the Value of Their Coupling1
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes1
Some Classes of Balanced Functions over Finite Fields with a Small Value of the Linear Characteristic1
Existence of Sequences Satisfying Bilinear Type Recurrence Relations1
Efficient In-Place Hough Transform Algorithm for Arbitrary Image Sizes1
On One Construction Method for Hadamard Matrices1
On Universality of Regular Realizability Problems1
Design of Polar Codes with Large Kernels1
On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code1
Series of Formulas for Bhattacharyya Parameters in the Theory of Polar Codes1
Impact of Modulation Constellation Type on the Finite Signal-to-Noise Ratio Diversity Gain in the Presence of a Multipath Fading Channel1
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound1
Time Synchronization in Satellite Quantum Key Distribution1
Entropy in Thermodynamics and in Information Theory1
On One Extremal Problem for Mutual Information0
Correcting a Single Error in an Asymmetric Feedback Channel0
Prediction of Locally Stationary Data Using Expert Advice0
Geometric Interpretation of Entropy for Dyck Systems0
Geometric Interpretation of the Entropy of Sofic Systems0
Constructions of Nonbinary Codes Meeting the Johnson Bound0
Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel0
Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective0
On Intersections of Reed–Muller Like Codes0
Half-Life and the Uncertainty Principle0
Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems0
New Turán Type Bounds for Johnson Graphs0
Modeling of Preemptive Channel Access in Wi-Fi Networks0
On Constructions of Regular Hadamard Matrices and Bent Functions0
On Codes with Distances $$d$$ and $$n$$0
On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate0
Codes for Exact Support Recovery of Sparse Vectors from Inaccurate Linear Measurements and Their Decoding0
Complexity-Preserving Transposition of Summing Algorithms: A Data Flow Graph Approach0
Multi-twisted Additive Codes with Complementary Duals over Finite Fields0
On the Distribution of a Statistical Sum Related to the Binary Symmetric Channel0
Predictors for High Frequency Signals Based on Rational Polynomial Approximation of Periodic Exponentials0
Closed-Form Approximations for the URLLC Capacity Using $G/G/s$ Queues0
On Minimax Detection of Gaussian Stochastic Sequences with Imprecisely Known Means and Covariance Matrices0
On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications0
Computation of the Fundamental Limits of Data Compression for Certain Nonstationary ARMA Vector Sources0
On Measuring the Topological Charge of Anyons0
Study of a Quantum Key Distribution Protocol with Phase-Time Coding Using Simulation Modeling0
Performance Evaluation of Wi-Fi 7 Networks with Restricted Target Wake Time0
Overparameterized Maximum Likelihood Tests for Detection of Sparse Vectors0
Correcting a Single Error in Feedback Channels0
Remarks on Reverse Pinsker Inequalities0
Information Diagrams and Their Capabilities for Classifying Weak Signals0
Spectral Representation of Two-Sided Signals from $\ell_\infty$ and Applications to Signal Processing0
Optimization of the Decisive Rule for a Receiver with a $\Delta$-Layer of Indistinguishability of Binary Signals in a Channel with Intentional Interference0
On q-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group0
On Nonlinear 1-Quasi-perfect Codes and Their Structural Properties0
On Additive Quasi-abelian Codes over Finite Fields and Their Duality Properties0
On Weight Distributions for a Class of Codes with Parameters of Reed-Muller Codes0
Near-Ideal Predictors and Causal Filters for Discrete-Time Signals0
Design and Decoding of Polar Codes with Large Kernels: A Survey0
Batch Poissonian Arrival Models of Multiservice Network Traffic0
Convolutional Codes with Optimum Bidirectional Distance Profile0
Reduction of Recursive Filters to Representations by Sparse Matrices0
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs0
Elementary Solution to the Fair Division Problem0
Large Deviation Principle for Terminating Multidimensional Compound Renewal Processes with Application to Polymer Pinning Models0
Partitions into Perfect Codes in the Hamming and Lee Metrics0
0.034773111343384