The first type, called "zero-fixing source", is a special case of a bit-fixing source in which all fixed bits are fixed to zero. That is a $(n,k)$-zero-fixing ...

Jun 20, 2015 · In this paper we prove that when the entropy k is small enough compared to n, this exponential entropy-loss is unavoidable.

An (n, k)-bit-fixing source is a distribution on n bit strings, that is fixed on n - k of the coordinates, and jointly uniform on the remaining k bits.

Abstract. An (n, k)-bit-fixing source is a distribution on n bit strings, that is fixed on n − k of the coordinates, and jointly uniform on the.

These are bit-fixing sources where the fixed bits are set to 0. We complement our negative result, by giving an explicit construction of an (n, ...

An (n, k)-bit-fixing source is a distribution on n bit strings, that is fixed on n − k of the coordinates, and jointly uniform on the remaining k bits.

Abstract. An (n,k)-bit-fixing source is a distribution on n bit strings, that is fixed on n-k of the coordinates, and uniform on the remaining k bits.

Zero-Fixing Extractors for Sub-Logarithmic Entropy · Topics · 7 Citations · 38 References · Related Papers ...

Fingerprint. Dive into the research topics of 'Zero-fixing extractors for sub-logarithmic entropy'. Together they form a unique fingerprint.

Dec 17, 2019 · In this paper we present two different constructions of extractors for zero-fixing sources that are able to extract a positive fraction of ...