$(k, \varepsilon )$

An Entropy Lower Bound for Non-Malleable Extractors

IEEE Transactions on Information Theory, pp. 2904-2911, 2020.

Cited by: 2|Bibtex|Views10|Links
EI WOS
Keywords:
Error correction codesEntropyBinary codesData miningRandom variablesMore(1+)

Abstract:

A <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(k, \varepsilon )$ </tex-math></inline-formula> -non-malleable extractor is a function <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-ma...More

Code:

Data:

Your rating :
0

 

Tags
Comments