| Issue |
Title |
File |
| Vol 53, No 4 (2017) |
On Spectra of Linear Codes |
|
|
Leont’ev V.K.
|
| Vol 55, No 4 (2019) |
On the Cardinality Spectrum and the Number of Latin Bitrades of Order 3 |
|
|
Krotov D.S., Potapov V.N.
|
| Vol 54, No 4 (2018) |
On the Complexity of Fibonacci Coding |
|
|
Sergeev I.S.
|
| Vol 54, No 3 (2018) |
On the Complexity of Polynomial Recurrence Sequences |
|
|
Marchenkov S.S.
|
| Vol 54, No 1 (2018) |
On the Energy-Constrained Diamond Norm and Its Application in Quantum Information Theory |
|
|
Shirokov M.E.
|
| Vol 53, No 4 (2017) |
On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections |
|
|
Bobu A.V., Kupriyanov A.E., Raigorodskii A.M.
|
| Vol 53, No 3 (2017) |
On the real complexity of a complex DFT |
|
|
Sergeev I.S.
|
| Vol 54, No 2 (2018) |
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed–Solomon Codes |
|
|
Bartoli D., Davydov A.A., Marcugini S., Pambianco F.
|
| Vol 52, No 3 (2016) |
On the symmetry group of the Mollard code |
|
|
Mogilnykh I.Y., Solov’eva F.I.
|
| Vol 53, No 1 (2017) |
Optimal conflict-avoiding codes for 3, 4 and 5 active users |
|
|
Baicheva T., Topalova S.
|
| Vol 55, No 3 (2019) |
Optimal Upper Bounds for the Divergence of Finite-Dimensional Distributions under a Given Variational Distance |
|
|
Prelov V.V.
|
| Vol 54, No 4 (2018) |
Polar Codes with Higher-Order Memory |
|
|
Afşer H., Deliç H.
|
| Vol 55, No 1 (2019) |
Probability of Inversion of a Large Spin in the Form of an Asymptotic Expansion in a Series of Bessel Functions |
|
|
Karatsuba E.A., Morettib P.
|
| Vol 54, No 3 (2018) |
Propagation of Chaos and Poisson Hypothesis |
|
|
Vladimirov A.A., Pirogov S.A., Rybko A.N., Shlosman S.B.
|
| Vol 53, No 3 (2017) |
Propelinear codes related to some classes of optimal codes |
|
|
Mogilnykh I.Y., Solov’eva F.I.
|
| Vol 53, No 4 (2017) |
Quantifier Alternation in First-Order Formulas with Infinite Spectra |
|
|
Zhukovskii M.E.
|
| Vol 52, No 2 (2016) |
Queueing networks with mobile servers: The mean-field approach |
|
|
Baccelli F., Rybko A.N., Shlosman S.B.
|
| Vol 54, No 4 (2018) |
Refinements of Levenshtein Bounds in q-ary Hamming Spaces |
|
|
Boyvalenkov P., Danev D., Stoyanova M.
|
| Vol 55, No 2 (2019) |
Reliable Communication under the Influence of a State-Constrained Jammer: An Information-Theoretic Perspective on Receive Diversity |
|
|
Arendt C., Nötzel J., Boche H.
|
| Vol 52, No 1 (2016) |
Remark on “on the capacity of a multiple-access vector adder channel” by A.A. Frolov and V.V. Zyablov |
|
|
Bakin E.A., Evseev G.S.
|
| Vol 53, No 1 (2017) |
Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes |
|
|
Bassalygo L.A., Zinoviev V.A.
|
| Vol 55, No 3 (2019) |
RETRACTED ARTICLE: Note on “Smaller Explicit Superconcentrators” by N. Alon and M. Capalbo |
|
|
Bassalygo L.A.
|
| Vol 55, No 4 (2019) |
Search for a Moving Element with the Minimum Total Cardinality of Tests |
|
|
Lebedev A.V., Lebedev V.S.
|
| Vol 52, No 1 (2016) |
Simple one-shot bounds for various source coding problems using smooth Rényi quantities |
|
|
Warsi N.A.
|
| Vol 53, No 1 (2017) |
Some “goodness” properties of LDA lattices |
|
|
Vatedka S., Kashyap N.
|
| 76 - 100 of 115 Items |
<< < 1 2 3 4 5 > >> |
