Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

A fundamental objective of cryptography is to enable two persons to communicate over an
insecure channel (a public channel such as the internet) in such a way that any other person …

All known results on covering radius are presented, as well as some new results. There are
a number of upper and lower bounds, including asymptotic results, a few exact …

The Covering Radius of the ( 215, 16) Reed-Muller Code Is at Least 16276 Page 1 354 IEEE
TRANSACTIONS ON INFORMATION THEORY, VOL. IT-29, NO. 3, MAY 1983 The Covering …

The notion of quasi-orthogonal sequence (QOS) as a means of increasing the number of
channels in synchronous code-division multiple-access (CDMA) systems that employ Walsh …

The covering radius R of a code is the maximal distance of any vector from the code. This
work gives a number of new results concerning tn, k, the minimal covering radius of any …

We introduce a new approach for the study of weight distributions of cosets of the Reed-
Muller code of order 1. Our approach is based on the method introduced by Kasami (1968) …

An application of error-correcting codes to" write-once" memories (WOM's) as defined by
Rivest and Shamir is studied. Large classes of" WOM codes" that are easily decodable are …

The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.) Page 1
IEERTRANSACTIONS ONINFORMATIONTHB~RY,VOL. rr-26,NO.3,~~~ 1980 2/3 were found by …

We give a new lower bound to the covering radius of the first order Reed–Muller code RM
(1, n), where n∈{9, 11, 13}. Equivalently, we present the n-variable Boolean functions for …