Problems of Information Transmission

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Secrecy results for compound wiretap channels
Problems of Information Transmission - Tập 49 Số 1 - Trang 73-98 - 2013
Bjelaković, I., Boche, H., Sommerfeld, J.
We derive a lower bound on the secrecy capacity of a compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. [1], thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterio... hiện toàn bộ
Some high-rate linear codes over GF(5) and GF(7)
Problems of Information Transmission - Tập 43 - Trang 124-131 - 2007
R. Daskalov
Let an [n, k, d] q code be a linear code of length n, dimension k, and with minimum Hamming distance d over GF(q). The ratio R = k/n is called the rate of a code. In this paper, [62, 53, 6]5, [62, 48, 8]5, [71, 56, 8]5, [124, 113, 6]5, [43, 36, 6]7, [33, 23, 7]7, and [27, 18, 7]7 high-rate codes and new codes with parameters [42, 14, 19]5, [42, 15, 18]5, [48, 13, 24]5, [52, 12, 28]5, [71, 15, 38]5... hiện toàn bộ
On the error-detecting performance of some classes of block codes
Problems of Information Transmission - Tập 40 - Trang 356-364 - 2004
R. Dodunekova, S. M. Dodunekov, E. Nikolova
We establish the properness of some classes of binary block codes with symmetric distance distribution, including Kerdock codes and codes that satisfy the Grey-Rankin bound, as well as the properness of Preparata codes, thus augmenting the list of very few known proper nonlinear codes.
Contemporary debates on the nature of mathematics
Problems of Information Transmission - Tập 42 - Trang 379-389 - 2006
A. N. Kolmogorov
Kolmogorov’s article “Contemporary Debates on the Nature of Mathematics” was published in 1929 in Nauchnoe slovo journal (no. 6, pp. 41–54) and has not been republished since then. At the end of the 19th and at the beginning of the 20th century, abstractions of a very high order appeared and were rooted in mathematics, so that their correlation with reality became a crucial question. A number of g... hiện toàn bộ
Fast Jackson Networks with Dynamic Routing
Problems of Information Transmission - - 2002
Yu. M. Suhov, N. D. Vvedenskaya
A new class of models of queueing networks with load-balanced dynamic routing is considered. We propose a sufficient condition for positive recurrence of the arising Markov process and a limiting mean-field approximation where the process becomes deterministic and is described by a system of nonlinear ordinary differential equations.
Extended Large Deviation Principle for Trajectories of Processes with Independent and Stationary Increments on the Half-line
Problems of Information Transmission - Tập 56 - Trang 56-72 - 2020
F. C. Klebaner, A. V. Logachov, A. A. Mogulskii
We establish an extended large deviation principle for processes with independent and stationary increments on the half-line under the Cramer moment condition in the space of functions of bounded variation without discontinuities of the second kind equipped with the Borovkov metric.
Some new results on Hadamard modulo prime matrices
Problems of Information Transmission - Tập 52 - Trang 134-141 - 2016
Y. L. Borissov
First, some nonexistence and classification results on Hadamard modulo prime matrices whose size is relatively small with respect to their modulus, are presented. Second, we show the existence of an infinite class of matrices of that kind derived by finite projective planes.
Các Đoạn Đoạn Số Liệu Cho Các Quy Trình Tiếp Xúc Với Tỷ Lệ Sinh Đẻ Và Tử Phụ Thuộc Vào Trạng Thái Dịch bởi AI
Problems of Information Transmission - Tập 59 - Trang 128-145 - 2023
E. A. Zhizhina, S. A. Pirogov
Chúng tôi xem xét các quy trình tiếp xúc trên các không gian metric cục bộ có khả năng tách biệt với tỷ lệ sinh và tử không đồng nhất theo không gian. Chúng tôi xây dựng các điều kiện về tỷ lệ mà đảm bảo sự tồn tại của các phép đo bất biến của các quy trình tiếp xúc. Một trong những điều kiện quan trọng là điều kiện chế độ tới hạn. Để chứng minh sự tồn tại của các phép đo bất biến, chúng tôi sử dụ... hiện toàn bộ
#quy trình tiếp xúc #phép đo bất biến #tỷ lệ sinh tử phụ thuộc #không gian compact #đa loài
Coverings, centered codes, and combinatorial steganography
Problems of Information Transmission - Tập 45 - Trang 289-294 - 2009
F. Galand, G. A. Kabatiansky
It is shown that steganography with a given distortion criteria, which we call combinatorial steganography, is equivalent to coverings of Hamming spaces or to so-called centered error-correcting codes, depending on whether an opponent is passive or active, respectively. A construction of centered error-correcting codes based on Reed-Solomon and algebraic geometry codes is proposed.
Generalization of Formulas for Queue Length Moments under Nonordinary Poissonian Arrivals for Batch Queues in Telecommunication Systems
Problems of Information Transmission - - 2024
B. Ya. Lichtzinder, A. Yu. Privalov
We propose an approach for generalization of formulas previously obtained by the authors for the first and second queue length moments in a queueing system with a nonordinary Poissonian arrival flow, single server, and constant service time to the case of a variable service time. The service time is assumed to be a random variable with a finite set of values. This model is adequate for a vast clas... hiện toàn bộ
Tổng số: 453   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10