论文信息 - C O ] 2 3 M ar 2 01 0 q-Analogs for Steiner Systems and Covering Designs

C O ] 2 3 M ar 2 01 0 q-Analogs for Steiner Systems and Covering Designs

The q-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the q-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal q-analogs covering designs are presented. Some lower and upper bounds on the sizes of q-analogs covering designs are proved.

Alexander Vardy | Tuvi Etzion | T. Etzion | A. Vardy

[1] Akihiro Munemasa,et al. On a class of small 2-designs over gf(q) , 1995 .

[2] Tuvi Etzion. Perfect Byte-Correcting Codes , 1998, IEEE Trans. Inf. Theory.

[3] Frank R. Kschischang,et al. Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[4] Toyoharu Itoh. A New Family of 2-Designs over GF (q) Admitting SLm(q1) , 1998 .

[5] Sascha Kurz,et al. Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance , 2008, MMICS.

[6] Tor Bu. Partitions of a vector space , 1980, Discret. Math..

[7] Alexander Vardy,et al. Error-Correcting Codes in Projective Space , 2011, IEEE Trans. Inf. Theory.

[8] Moshe Schwartz,et al. Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.

[9] Rudolf Ahlswede,et al. On Perfect Codes and Related Concepts , 2001, Des. Codes Cryptogr..

[10] Simon Thomas,et al. Designs over finite fields , 1987 .

[11] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[12] Michael Braun,et al. Systematic Construction of q-Analogs of t−(v,k,λ)-Designs , 2005, Des. Codes Cryptogr..

[13] Se June Hong,et al. A General Class of Maximal Codes ror Computer Applications , 1972, IEEE Transactions on Computers.

[14] Simon Thomas,et al. Designs and partial geometries over finite fields , 1996 .