Using Hadamard matrices and mutually orthogonal Latin squares, we construct two new quasi-symmetric designs, with parameters 2 (66, 30, 29) and 2 - (78, 36, 30). These are the fir...
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
Charles J. Colbourn, Sosina Martirosyan, Tran van ...
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...
It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implic...
Mike J. Grannell, Terry S. Griggs, Anne Penfold St...
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
We construct various classes of low-density parity-check codes using point-line incidence structures in the classical projective plane PG(2, q). Each incidence structure is based ...
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...