In commonplace text-based password schemes, users typically choose passwords that are easy to recall, exhibit patterns, and are thus vulnerable to brute-force dictionary attacks. ...
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Abstract--Cooperative transmission protocols over fading channels are based on a number of relaying nodes to form virtual multiantenna transmissions. Diversity provided by these te...