본문 바로가기 메뉴바로가기

Papers

A classification of the structures of some Sperner families and superimposed codes

https://doi.org/10.1016/j.disc.2006.03.049


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.