Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$S(2,4,3m-12) and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$3m-12
暂无分享,去创建一个
[1] E. F. Assmus. On 2-ranks of Steiner triple systems , 1995 .
[2] E. F. Assmus. POLYNOMIAL CODES AND FINITE GEOMETRIES , 2003 .
[3] Jennifer D. Key,et al. Designs and their codes , 1992, Cambridge tracts in mathematics.
[4] Cunsheng Ding,et al. How to Build Robust Shared Control Systems , 1998, Des. Codes Cryptogr..
[5] Marshall Hall,et al. Codes and Designs , 1981, J. Comb. Theory, Ser. A.
[6] C. Ding. Codes From Difference Sets , 2014 .
[7] Haim Hanani,et al. Balanced incomplete block designs and related designs , 1975, Discret. Math..
[8] Akihiro Munemasa,et al. A new quasi-symmetric 2-(56, 16, 6) design obtained from codes , 2004, Discret. Math..
[9] C. Ding. Designs from Linear Codes , 2018 .
[10] Cunsheng Ding,et al. Another generalisation of the binary Reed-Muller codes and its applications , 2018, Finite Fields Their Appl..
[11] N. Hamada,et al. On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes , 1973 .
[12] H. Mattson,et al. Coding and Combinatorics , 1974 .
[13] Cunsheng Ding,et al. Infinite families of 3-designs from a type of five-weight code , 2018, Des. Codes Cryptogr..
[14] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[15] J. Koolen,et al. Tight 2-designs and perfect 1-codes in Doob graphs , 2000 .
[16] Vladimir D. Tonchev,et al. On Bonisoli’s theorem and the block codes of Steiner triple systems , 2018, Des. Codes Cryptogr..
[17] Vladimir D. Tonchev,et al. On Classifying Steiner Triple Systems by Their 3-Rank , 2017, MACIS.
[18] Cunsheng Ding,et al. Infinite families of 2-designs and 3-designs from linear codes , 2016, Discret. Math..
[19] Cunsheng Ding,et al. Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$ , 2016, IEEE Transactions on Information Theory.
[20] Akihiro Munemasa,et al. On a 5-design related to an extremal doubly even self-dual code of length 72 , 2004, J. Comb. Theory, Ser. A.
[21] Vladimir D. Tonchev,et al. A Characterization of Designs Related to an Extremal Doubly-Even Self-Dual Code of Length 48 , 2005 .
[22] Jennifer D. Key,et al. Designs and their codes: Bibliography , 1992 .
[23] Cunsheng Ding,et al. An Infinite Family of Steiner Systems S(2,4,2m) from Cyclic Codes , 2017, ArXiv.
[24] Vladimir D. Tonchev,et al. Counting Steiner triple systems with classical parameters and prescribed rank , 2017, J. Comb. Theory, Ser. A.
[25] Rudolf Lide,et al. Finite fields , 1983 .
[26] Vladimir D. Tonchev,et al. Linear Perfect Codes and a Characterization of the Classical Designs , 1999, Des. Codes Cryptogr..
[27] Cunsheng Ding,et al. Secret sharing schemes from three classes of linear codes , 2006, IEEE Transactions on Information Theory.
[28] W. Cary Huffman,et al. Fundamentals of Error-Correcting Codes , 1975 .