R\'enyi divergence guarantees for hashing with linear codes
M Pathegama, A Barg - arXiv preprint arXiv:2405.04406, 2024 - arxiv.org
We consider the problem of distilling uniform random bits from an unknown source with a
given $ p $-entropy using linear hashing. As our main result, we estimate the expected $ p …
given $ p $-entropy using linear hashing. As our main result, we estimate the expected $ p …
R\'enyi Resolvability, Noise Stability, and Anti-contractivity
L Yu - arXiv preprint arXiv:2402.07660, 2024 - arxiv.org
As indicated by the title, this paper investigates three closely related topics--R\'enyi
resolvability, noise stability, and anti-contractivity. The R\'enyi resolvability problem refers to …
resolvability, noise stability, and anti-contractivity. The R\'enyi resolvability problem refers to …
Limitations of the decoding-to-LPN reduction via code smoothing
M Pathegama, A Barg - arXiv preprint arXiv:2408.03742, 2024 - arxiv.org
The Learning Parity with Noise (LPN) problem underlies several classic cryptographic
primitives. Researchers have endeavored to demonstrate the algorithmic difficulty of this …
primitives. Researchers have endeavored to demonstrate the algorithmic difficulty of this …
Smoothing Linear Codes by R\'enyi Divergence and Applications to Security Reduction
H Yan, C Ling - arXiv preprint arXiv:2405.10124, 2024 - arxiv.org
The concept of the smoothing parameter plays a crucial role in both lattice-based and code-
based cryptography, primarily due to its effectiveness in achieving nearly uniform …
based cryptography, primarily due to its effectiveness in achieving nearly uniform …
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
U Erez, O Ordentlich, S Shamai - arXiv preprint arXiv:2401.14710, 2024 - arxiv.org
It has been known for a long time that the mutual information between the input sequence
and output of a binary symmetric channel (BSC) is upper bounded by the mutual information …
and output of a binary symmetric channel (BSC) is upper bounded by the mutual information …
[PDF][PDF] Binary Wyner-Ziv and CEO Problem Coding Under the Hamming Distortion Criterion
M Nangir - International Journal of Industrial Electronics Control …, 2024 - researchgate.net
Objective: In this paper, we present a practical encoding and decoding scheme for the
binary Wyner-Ziv problem based on graph-based codes. Our proposed scheme uses low …
binary Wyner-Ziv problem based on graph-based codes. Our proposed scheme uses low …