| On the Energy-Constrained Diamond Norm and Its Application in Quantum Information Theory |
8 |
| On Completely Regular Codes |
5 |
| The Augustin Capacity and Center |
3 |
| Exponentially Ramsey Sets |
3 |
| Gaussian Two-Armed Bandit and Optimization of Batch Data Processing |
3 |
| Generalization of IPP Codes and IPP Set Systems |
2 |
| Traceability Codes and Their Generalizations |
2 |
| Non-split Toric Codes |
2 |
| Analytical Properties of Shannon's Capacity of Arbitrarily Varying Channels under List Decoding: Super-Additivity and Discontinuity Behavior |
2 |
| A Local Large Deviation Principle for Inhomogeneous Birth-Death Processes |
2 |
| On Discrimination between Classes of Distribution Tails |
1 |
| Improved Frankl-Rodl Theorem and Some of Its Geometric Consequences |
1 |
| Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound |
1 |
| On a Frankl-Wilson Theorem |
1 |
| Optimal Upper Bounds for the Divergence of Finite-Dimensional Distributions under a Given Variational Distance |
1 |
| Note on Smaller Explicit Superconcentrators by N. Alon and M. Capalbo |
1 |
| General Independence Sets in Random Strongly Sparse Hypergraphs |
1 |
| Infinite Spectra of First-Order Properties for Random Hypergraphs |
0 |
| Propagation of Chaos and Poisson Hypothesis |
0 |
| New Good's Type Kronecker Power Expansions |
0 |
| On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes |
0 |
| On the Complexity of Polynomial Recurrence Sequences |
0 |
| On Some Optimization Problems for the Renyi Divergence |
0 |
| Geometry of Translations on a Boolean Cube |
0 |
| The Geometry of Big Queues |
0 |
| On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem |
0 |
| Reliable Communication under the Influence of a State-Constrained Jammer: An Information-Theoretic Perspective on Receive Diversity |
0 |
| Chromatic Numbers of Distance Graphs with Several Forbidden Distances and without Cliques of a Given Size |
0 |
| Mollard Code as a Robust Nonlinear Code |
0 |
| Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels |
0 |
| On Metric Dimension of Nonbinary Hamming Spaces |
0 |
| On Alphabetic Coding for Superwords |
0 |
| Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes |
0 |
| Upper Bounds for the Holevo Information Quantity and Their Use |
0 |
| Some q-ary Cyclic Codes from Explicit Monomials over F-qm |
0 |
| Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems |
0 |
| Maximum Remaining Service Time in Infinite-Server Queues |
0 |
| Clique Numbers of Random Subgraphs of Some Distance Graphs |
0 |
| On the Smallest Size of an Almost Complete Subset of a Conic in PG( q) and Extendability of Reed-Solomon Codes |
0 |
| Compositional Restricted Multiple Access Channel |
0 |
| Probability of Inversion of a Large Spin in the Form of an Asymptotic Expansion in a Series of Bessel Functions |
0 |
| On Extreme Values of the Renyi Entropy under Coupling of Probability Distributions |
0 |
| Noise Level Estimation in High-Dimensional Linear Models |
0 |
| On the Complexity of Fibonacci Coding |
0 |
| Polar Codes with Higher-Order Memory |
0 |
| Refinements of Levenshtein Bounds in q-ary Hamming Spaces |
0 |
| On the Cardinality Spectrum and the Number of Latin Bitrades of Order 3 |
0 |
| On Lower Bounds on the Spectrum of a Binary Code |
0 |
| Search for a Moving Element with the Minimum Total Cardinality of Tests |
0 |
