| Menu | |
|
: Home |
|
| Search | |
|
|
Definitions and Terminology
A
B C
D E
F G
H I
J K
L M
N O
P Q
R S
T U
V W
X Y
Z
min-entropy
bit string X has min-entropy k if k is the largest value such that Pr [X = x] ≤2-k. That is, X contains k bits of min-entropy or randomness. NOTE Informally, this is the "best" kind of entropy.
source: ISO18031, 2005
| Copyright 2006-2008. All Rights Reserved. | Something missing on this page? Let us know |