논문
A classification of the structures of some Sperner families and superimposed codes
- 저자Dong Yeol Oh
- 학술지Discrete Mathematics 306/15
- 등재유형
- 게재일자(2006)
In this paper we will give a new proof by using group action to prove the uniqueness of maximal Sperner families Fmaxn of [n]. We will also prove the uniqueness of Sperner families F of [n] with |F|=n⌊n2⌋-1 by using a combinatorial approach. Furthermore, by using the uniqueness of Sperner family, we will classify all the structures of (1,2) superimposed codes of size 9×10 and 9×11.
In this paper we will give a new proof by using group action to prove the uniqueness of maximal Sperner families Fmaxn of [n]. We will also prove the uniqueness of Sperner families F of [n] with |F|=n⌊n2⌋-1 by using a combinatorial approach. Furthermore, by using the uniqueness of Sperner family, we will classify all the structures of (1,2) superimposed codes of size 9×10 and 9×11.
