?
Information disclosure in the framework of kolmogorov complexity
Theoretical Computer Science. 2023. Vol. 940. P. 108–122.
We consider the network consisting of three nodes 1, 2, 3 connected by two open channels
1 → 2 and 1 → 3. The information present in the node 1 consists of four strings x , y , z , w.
The nodes 2, 3 know x , w and need to know y , z, respectively. We want to arrange
transmission of information over the channels so that both nodes 2 and 3 learn what they
need and the disclosure of information is as small as possible. By information disclosure
we mean the amount of information in the strings transmitted through channels about
x , y , z , w (or about x , w). We are also interested in whether it is possible to minimize
the disclosure of information and simultaneously minimize the length of words transferred
through the channels.
Pilé I., Shchur L., Deng Y., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Hualin M., Jie Z., Jerome Y. et al., Journal of Internet Technology 2026 Vol. 27 No. 3 P. 367–382
In open, interference-prone scenarios, the scarcity of precisely annotated signal samples limits the application of deep learning–based modulation identification, which generally relies on extensive labeled data for stability. Relation Networks, as an emerging class of deep learning models, exhibit rapid convergence in few-shot learning tasks. Motivated by the fast convergence property of relation-based learning and ...
Added: July 3, 2026
Osipov D., Информационно-управляющие системы 2026 № 3 С. 49–62
Introduction: In many communication systems under construction and those to be created power control and channel estimation techniques developed for the previous generation communication systems fail to provide desired precision. One way to solve this problem is to use order-statistics-based reception techniques that do not need channel estimation or power control. To ensure the desired ...
Added: July 3, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Netherlands: ScienceDirect, 2025.
No ...
Added: June 28, 2026
Antsygina A., Theory and Decision 2025
We study optimal information disclosure in static contests where contestants are initially uninformed about their values of winning but can learn them, publicly or privately, from a designer. The designer, who maximizes total effort, chooses a disclosure policy and commits to it before observing the realized value profile. A key feature of our model is ...
Added: February 2, 2026
Antsygina A., Journal of Economic Behavior and Organization 2026 Vol. 241 Article 107392
This paper studies optimal information disclosure in two competing contests where contestants face a constraint on their total effort contribution, or budget. The contestants are ex ante uninformed about the value of the prize to be allocated in one of the contests. Before the game starts, the designer of a contest with the unknown prize ...
Added: February 2, 2026
Semenov A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 527 № S С. 7–12
The paper proposes a system of definitions for the basic concepts of computability theory that underlie the mathematics of the digital world: algorithm, computability, calculus, object complexity, close to modern undertnding. Hierarchies of the finite and the problem of consistency are considered. ...
Added: December 6, 2025
Besstremyannaya G., Dasher R., Journal of Corporate Finance Research 2025 Vol. 19 No. 2 P. 5–14
India offers an excellent illustration of a pattern of economic transition when an emerging economy adapts the concept of corporate governance to its economic and cultural environment. A vital component of good corporate governance is corporate governance disclosure, which has received growing attention among researchers of the Indian and BRICS economies.
The present paper provides a meta-review ...
Added: August 20, 2025
Semenov A., Shen A., Vereshchagin N., Theory of Probability and its Applications, USA 2024 Vol. 68 No. 4 P. 582–606
The definition of descriptional complexity of finite objects suggested by Kolmogorov and other authors in the mid-1960s is now well known. In addition, Kolmogorov pointed out some approaches to a more fine-grained classification of finite objects, such as the resource-bounded complexity (1965), structure function (1974), and the notion of $(\alpha,\beta)$-stochasticity (1981). Later it turned out ...
Added: January 16, 2025
Kryukov G. M., Sandomirskaia M., Automation and Remote Control 2024 Vol. 85 P. 696–710
In this paper, the disclosure of information about the scoring model is investigated. Some of the company’s customers find out their internal rating in the company. Such customers can change their behavior to increase their internal rating. The customers who are aware of the leakage are represented as players who can choose a strategy: whether ...
Added: November 19, 2024
Крюков Г. М., Sandomirskaia M., Автоматика и телемеханика 2024 № 8 С. 54–75
В данной статье моделируется раскрытие информации о скоринговой модели. Некоторые клиенты компании узнают свой внутренний рейтинг в компании. Такие клиенты могут изменить свое поведение, чтобы повысить свой внутренний рейтинг. Клиенты, знающие об утечке информации, являются игроками, которые могут выбирать стратегию: повышать ли свой внутренний рейтинг и если да, то насколько. Главная задача – найти в ...
Added: August 28, 2024
Vereshchagin N., / Series arXiv "math". 2024.
The fine approach to measure information dependence is based on the total conditional complexity CT(y|x), which is defined as the minimal length of a total program that outputs y on the input x. It is known that the total conditional complexity can be much larger than than the plain conditional complexity. Such strings x, y ...
Added: August 19, 2024
Idrisova V. A., Tokareva N. N., Gorodilova A. A. et al., Prikladnaya Diskretnaya Matematika 2023 No. 62 P. 29–54
Every year the International Olympiad in Cryptography Non-Stop University CRYPTO (NSUCRYPTO) offers mathematical problems for university and school students and, moreover, for professionals in the area of cryptography and computer science. The main goal of NSUCRYPTO is to draw attention of students and young researchers to modern cryptography and raise awareness about open problems in ...
Added: March 19, 2024
Gorodilova A. A., Tokareva N. N., Agievich S. V. et al., Siberian Electronic Mathematical Reports 2022 Vol. 19 No. 1 P. A.9–A.37
Non-Stop University CRYPTO is the International Olympiad in Cryptography that was held for the eight time in 2021. Hundreds of university and school students, professionals from 33 countries worked on mathematical problems in cryptography during a week. The aim of the Olympiad is to attract attention to curious and even open scientific problems of modern ...
Added: March 19, 2024
Malashina A., Doklady Mathematics 2024 Vol. 108 No. 2 P. S282–S292
To provide secure information exchange in communication channels, the correctness of the operation of the relevant information protection systems must be preliminary studied. The mathematical algorithms used in such systems are correct and can theoretically provide the correct statistical properties of the output stream compared to the input. However, at the stage of implementation (programming) ...
Added: November 11, 2023
А. Г. Малашина, Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2023 Т. 514 № 2 С. 138–149
В целях обеспечения защищенного информационного обмена в каналах связи необходимо предварительное исследование корректности работы соответствующих систем защиты информации. Несмотря на то что используемые в таких системах математические алгоритмы корректны и теоретически обеспечивают правильные статистические свойства выходного потока по сравнению с входным, на этапе реализации (программирования) данных алгоритмов защиты или на этапах сборки конечного оборудования (использования ...
Added: November 1, 2023
Bauwens B. F., Zimand M., Journal of the ACM 2023 Vol. 70 No. 2 Article 9
In a lossless compression system with target lengths, a compressor 𝒞 maps an integer m and a binary string x to an m-bit code p, and if m is sufficiently large, a decompressor 𝒟 reconstructs x from p. We call a pair (m,x) achievable for (𝒞,𝒟) if this reconstruction is successful. We introduce the notion ...
Added: March 22, 2023
Bauwens B. F., Gács P., Romashchenko A. et al., Computability 2022 Vol. 11 No. 3-4 P. 165–185
Finding all linear inequalities for entropies remains an important open question in information theory. For a long time the only known inequalities for entropies of tuples of random variables were Shannon (submodularity) inequalities. Only in 1998 Zhang and Yeung 1998 found the first inequality that cannot be represented as a convex combination of Shannon inequalities, and ...
Added: December 23, 2022