Шығарылым |
Атауы |
Файл |
Том 54, № 3 (2018) |
A Local Large Deviation Principle for Inhomogeneous Birth–Death Processes |
|
Vvedenskaya N., Logachov A., Suhov Y., Yambartsev A.
|
Том 53, № 3 (2017) |
A note on random coding bounds for classical-quantum channels |
|
Dalai M.
|
Том 53, № 3 (2017) |
A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices |
|
Ivanov F.
|
Том 52, № 4 (2016) |
A triangular class of skew maximum-period polynomials |
|
Zaitsev S.
|
Том 53, № 3 (2017) |
Adaptive search for one defective in the additive group testing model |
|
Lebedev V.
|
Том 52, № 2 (2016) |
Almost cover-free codes |
|
Polyansky N.
|
Том 52, № 1 (2016) |
Analysis of queues with hyperexponential arrival distributions |
|
Tarasov V.
|
Том 53, № 3 (2017) |
Analytical approach to multiband filter synthesis and comparison to other approaches |
|
Bogatyrev A., Goreinov S., Lyamaev S.
|
Том 54, № 3 (2018) |
Analytical Properties of Shannon’s Capacity of Arbitrarily Varying Channels under List Decoding: Super-Additivity and Discontinuity Behavior |
|
Boche H., Schaefer R., Poor H.
|
Том 53, № 1 (2017) |
Bounds on the rate of separating codes |
|
Vorob’ev I.
|
Том 54, № 1 (2018) |
Chromatic Numbers of Distance Graphs with Several Forbidden Distances and without Cliques of a Given Size |
|
Berdnikov A.
|
Том 52, № 3 (2016) |
Classical capacities of quantum channels with environment assistance |
|
Karumanchi S., Mancini S., Winter A., Yang D.
|
Том 54, № 2 (2018) |
Clique Numbers of Random Subgraphs of Some Distance Graphs |
|
Gusev A.
|
Том 52, № 2 (2016) |
Coding with noiseless feedback |
|
Lebedev V.
|
Том 54, № 2 (2018) |
Compositional Restricted Multiple Access Channel |
|
Egorova E., Potapova V.
|
Том 52, № 3 (2016) |
Degradable channels, less noisy channels, and quantum statistical morphisms: An equivalence relation |
|
Buscemi F.
|
Том 52, № 4 (2016) |
Derivation of fast algorithms via binary filtering of signals |
|
Bespalov M., Golubev A., Pochenchuk A.
|
Том 55, № 3 (2019) |
Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes |
|
Landjev I., Rousseva A.
|
Том 52, № 2 (2016) |
Doubly randomized protocols for a random multiple access channel with “success–nonsuccess” feedback |
|
Foss S., Hajek B., Turlikov A.
|
Том 53, № 2 (2017) |
Entropy of a stationary process and entropy of a shift transformation in its sample space |
|
Gurevich B.
|
Том 52, № 2 (2016) |
Erratum to: “Bounds on the rate of disjunctive codes” |
|
D’yachkov A., Vorob’ev I., Polyansky N., Shchukin V.
|
Том 53, № 3 (2017) |
Erratum to: “MDS codes in Doob graphs” |
|
Bespalov E., Krotov D.
|
Том 52, № 1 (2016) |
Erratum to: “On one method for constructing a family of approximations of zeta constants by rational fractions” |
|
Karatsuba E.
|
Том 53, № 3 (2017) |
Erratum to: “Remark on balanced incomplete block designs, near-resolvable block designs, and q-ary constant-weight codes” |
|
Bassalygo L., Zinoviev V.
|
Том 55, № 3 (2019) |
Erratum to: On Completely Regular Codes |
|
Borges J., Rifà J., Zinoviev V.
|
Нәтижелер 115 - 1/25 |
1 2 3 4 5 > >> |