Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Zimand P"'
Autor:
Zimand, Marius
We show that one-way functions exist if and only there exists an efficient distribution relative to which almost-optimal compression is hard on average. The result is obtained by combining a theorem of Ilango, Ren, and Santhanam and one by Bauwens an
Externí odkaz:
http://arxiv.org/abs/2412.03392
Publikováno v:
Humanities & Social Sciences Communications, Vol 11, Iss 1, Pp 1-8 (2024)
Abstract Coronavirus and other prevailing viruses continue to remain a health threat and challenge the efforts of institutions to promote vaccination acceptance. The current study’s aim is to propose a conceptual framework explaining the role of in
Externí odkaz:
https://doaj.org/article/9999836491a048cea2a69fa24d2b4a12
The classical coding theorem in Kolmogorov complexity states that if an $n$-bit string $x$ is sampled with probability $\delta$ by an algorithm with prefix-free domain then K$(x) \leq \log(1/\delta) + O(1)$. In a recent work, Lu and Oliveira [LO21] e
Externí odkaz:
http://arxiv.org/abs/2204.08312
Autor:
Bauwens, Bruno, Zimand, Marius
We study connections between expansion in bipartite graphs and efficient online matching modeled via several games. In the basic game, an opponent switches {\em on} and {\em off} nodes on the left side and, at any moment, at most $K$ nodes may be on.
Externí odkaz:
http://arxiv.org/abs/2204.01936
The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.
Comment: The paper has appeared in the Open Problems co
Comment: The paper has appeared in the Open Problems co
Externí odkaz:
http://arxiv.org/abs/2203.15109
Autor:
Zimand, Marius
Bauwens and Zimand [BZ 2019] have shown that lossless expanders have an interesting online matching property. The result appears in an implicit form in [BZ 2019]. We present an explicit version of this property which is directly amenable to typical a
Externí odkaz:
http://arxiv.org/abs/2102.08243
Autor:
Bauwens, Bruno, Zimand, Marius
We put forth new models for universal channel coding. Unlike standard codes which are designed for a specific type of channel, our most general universal code makes communication resilient on every channel, provided the noise level is below the toler
Externí odkaz:
http://arxiv.org/abs/2007.02330
Autor:
Bauwens, Bruno, Zimand, Marius
In a lossless compression system with target lengths, a compressor ${\cal C}$ maps an integer $m$ and a binary string $x$ to an $m$-bit code $p$, and if $m$ is sufficiently large, a decompressor ${\cal D}$ reconstructs $x$ from $p$. We call a pair $(
Externí odkaz:
http://arxiv.org/abs/1911.04268
Autor:
Zimand, Marius
A fundamental question that has been studied in cryptography and in information theory is whether two parties can communicate confidentially using exclusively an open channel. We consider the model in which the two parties hold inputs that are correl
Externí odkaz:
http://arxiv.org/abs/1910.03757
Autor:
Romashchenko, Andrei, Zimand, Marius
Romashchenko and Zimand~\cite{rom-zim:c:mutualinfo} have shown that if we partition the set of pairs $(x,y)$ of $n$-bit strings into combinatorial rectangles, then $I(x:y) \geq I(x:y \mid t(x,y)) - O(\log n)$, where $I$ denotes mutual information in
Externí odkaz:
http://arxiv.org/abs/1905.00164