## Abstract A (__w,r__) __coverβfree family__ is a family of subsets of a finite set such that no intersection of __w__ members of the family is covered by a union of __r__ others. A __binary__ (__w,r__) __superimposed code__ is the incidence matrix of such a family. Such a family also arises in cr
Some new results on superimposed codes
β Scribed by Hyun Kwang Kim; Vladimir Lebedev; Dong Yeol Oh
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 118 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A (w,r) coverβfree family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from superβsimple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 Γ 12, the (2,2) superimposed code of size 14 Γ 8, and the (2,3) superimposed code of size 30 Γ 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. Β© 2004 Wiley Periodicals, Inc.
π SIMILAR VOLUMES
because of their close relation to planar vector fields. In this paper three new Ε½ . results on Abel equations are presented: 1 An asymptotic expansion of the Ε½ . Ε½ . Ε½ . solutions of Abel equations in terms of the coefficient functions a ΠΈ and b ΠΈ . 2 A Ε½ . simple recurrence relation for Bautin qua
The purpose of this paper is to construct fairly long geometric Goppa codes over F O with rather good parameters by fibre products of some Kummer coverings. This paper also extends the results of Stepanov [1] and Stepanov and O zbudak [2].
A digraph G = (V, E) is primitive if, for some positive integer k, there is a u β v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u β V , denoted exp(u), is the least integer k such that there is a u β