Randomness extraction and asymptotic Hamming distance

DOI10.2168/LMCS-9(3:27)2013zbMath1361.03041arXiv1008.0821MaRDI QIDQ2848372

Bjørn Kjos-Hanssen, Cameron E. Freer

Publication date: 26 September 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.0821

zbMATH Keywords

Hamming distancealgorithmic randomnessrandomness extraction

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items (2)

Extracting randomness within a subset is hard ⋮ KL-randomness and effective dimension under strong reducibility

This page was built for publication: Randomness extraction and asymptotic Hamming distance