Two procedures for decoding linear systematic codes, majority decoding and a posteriori
probability decoding, are formulated. The essential feature of both methods is a linear …

A new secret-key block cipher is proposed as a candidate for a new encryption standard. In
the proposed cipher, the plaintext and the ciphertext are 64 bit blocks, while the secret key is …

This paper considers the security of iterated block ciphers against the differential cryptanalysis
introduced by Biham and Shamir. Differential cryptanalysis is a chosen-plaintext attack on …

The covariance of complex random variables and processes, when defined consistently with
the corresponding notion for real random variables, is shown to be determined by the usual …

This research examines the overall and relative effects of the elements of Hirschi's Social
Bonding Theory on four separate measures of deviance using data drawn from a sample of …

It is shown that a Boolean combining function f(x) of n variables is mth-order correlation-immune
if and only if its Walsh transform F( omega ) vanishes for all omega with Hamming …

It is shown that the average number of successive guesses, E[G], required with an optimum
strategy until one correctly guesses the value of a discrete random X, is underbounded by …

A linear code with a complementary dual (or an LCD code) is defined to be a linear code C
whose dual code C ⊥ satisfies C∩C ⊥ = { 0 } . The algebraic characterization of LCD codes …

The use of a linear code to" split" secrets into equal-size shares is considered. The determination
of which sets of shares can be used to obtain the secret leads to the apparently new …

Communications engineers have a long acquaintance with the" multiple-access" problem, ie,
the problern of providing the means whereby many senders of information can share a …