A binary code C⊆ F 2 n with minimum distance at least d and codewords of Hamming
weight w is called an (n, d, w) constant weight code. The maximum size of an (n, d, w) …

Grassmannian codes are known to be useful in error correction for random network coding.
Recently, they were used to prove that vector network codes outperform scalar linear …

For a function f from F_2^n to F_2^n, the planarity of f is usually measured by its differential
uniformity and differential spectrum. In this paper, we propose the concept of vanishing flats …

A supersaturated design is essentially a factorial design with the equal occurrence of levels
property and no fully aliased factors in which the number of main effects is greater than the …

Grassmannian G _q (n, k) G q (n, k) is the set of all k-dimensional subspaces of the vector
space F _q^ n F qn. Kötter and Kschischang showed that codes in Grassmannian space can …

In this paper, we consider the problem of determining the exact value of A 2 (n,{d 1, d 2})
defined as the maximal cardinality of a binary code of length n with two possible distances d …

Optical orthogonal signature pattern codes (OOSPCs) have played an important role in a
novel type of optical code-division multiple-access network for 2-D image transmission. In …

Constant weight binary codes are used in a number of applications. Constructions based on
mathematical structure are known for many codes. However, heuristic constructions …

Optical orthogonal signature pattern codes (OOSPCs) play an important role in a novel type
of optical code-division multiple-access network for 2-dimensional image transmission …

Ability to cooperate on common tasks in a distributed setting is key to solving a broad range
of computation problems ranging from distributed search such as SETI to distributed …