Skip to main content
Erschienen in: Designs, Codes and Cryptography 12/2019

11.06.2019

Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)

verfasst von: Chunming Tang, Cunsheng Ding, Maosheng Xiong

Erschienen in: Designs, Codes and Cryptography | Ausgabe 12/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Coding theory and t-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight distribution. We determine the weight distributions of some shortened codes and punctured codes of these three-weight subcodes. These shortened and punctured codes contain some codes that have the same parameters as the best ternary linear codes known in the database maintained by Markus Grassl at http://​www.​codetables.​de/​. These three-weight subcodes with a special weight distribution do not satisfy the conditions of the Assmus–Mattson theorem and do not admit 2-transitive or 2-homogeneous automorphism groups in general. By employing the theory of projective geometries and projective generalized Reed–Muller codes, we prove that they still hold 2-designs. We also determine the parameters of these 2-designs. This paper mainly confirms some recent conjectures of Ding and Li regarding Steiner systems and 2-designs from a special type of ternary projective codes.
Literatur
1.
Zurück zum Zitat Anderson R., Ding C., Helleseth T., Klove T.: How to build robust shared control systems. Des. Codes Cryptogr. 15, 111–124 (1998).MathSciNetCrossRef Anderson R., Ding C., Helleseth T., Klove T.: How to build robust shared control systems. Des. Codes Cryptogr. 15, 111–124 (1998).MathSciNetCrossRef
2.
Zurück zum Zitat Assmus Jr. E.F.: On \(2\)-ranks of Steiner triple systems. Electron. J. Comb. 2(1), 9 (1995).MathSciNetMATH Assmus Jr. E.F.: On \(2\)-ranks of Steiner triple systems. Electron. J. Comb. 2(1), 9 (1995).MathSciNetMATH
3.
Zurück zum Zitat Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).CrossRef Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992).CrossRef
4.
Zurück zum Zitat Assmus Jr. E.F., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1269–1343. Elsevier, Amsterdam (1998). Assmus Jr. E.F., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1269–1343. Elsevier, Amsterdam (1998).
6.
Zurück zum Zitat Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015). Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015).
7.
Zurück zum Zitat Ding C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86, 703–719 (2018).MathSciNetCrossRef Ding C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86, 703–719 (2018).MathSciNetCrossRef
8.
9.
Zurück zum Zitat Ding C.: Designs from Linear Codes. World Scientific, Singapore (2018).CrossRef Ding C.: Designs from Linear Codes. World Scientific, Singapore (2018).CrossRef
10.
Zurück zum Zitat Ding C., Li C.: Infinite families of 2-designs and 3-designs from linear codes. Discret. Math. 340, 2415–2431 (2017).MathSciNetCrossRef Ding C., Li C.: Infinite families of 2-designs and 3-designs from linear codes. Discret. Math. 340, 2415–2431 (2017).MathSciNetCrossRef
11.
Zurück zum Zitat Ding C., Li C., Xia Y.: Another generalization of the binary Reed–Muller codes and its applications. Finite Fields Appl. 53, 144–174 (2018).MathSciNetCrossRef Ding C., Li C., Xia Y.: Another generalization of the binary Reed–Muller codes and its applications. Finite Fields Appl. 53, 144–174 (2018).MathSciNetCrossRef
13.
Zurück zum Zitat Hamada N.: On the \(p\)-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 153–226 (1973).MathSciNetCrossRef Hamada N.: On the \(p\)-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 153–226 (1973).MathSciNetCrossRef
14.
15.
Zurück zum Zitat Harada M., Kitazume M., Munemasa A.: On a \(5\)-design related to an extremal doubly-even self-dual code of length \(72\). J. Comb. Theory Ser. A 107, 143–146 (2004).MathSciNetCrossRef Harada M., Kitazume M., Munemasa A.: On a \(5\)-design related to an extremal doubly-even self-dual code of length \(72\). J. Comb. Theory Ser. A 107, 143–146 (2004).MathSciNetCrossRef
16.
Zurück zum Zitat Harada M., Munemasa A., Tonchev V.D.: A characterization of designs related to an extremal doubly-even self-dual code of length \(48\). Ann. Comb. 9, 189–198 (2005).MathSciNetCrossRef Harada M., Munemasa A., Tonchev V.D.: A characterization of designs related to an extremal doubly-even self-dual code of length \(48\). Ann. Comb. 9, 189–198 (2005).MathSciNetCrossRef
17.
Zurück zum Zitat Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRef Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).CrossRef
18.
Zurück zum Zitat Jungnickel D., Tonchev V.D.: On Bonisoli’s theorem and the block codes of Steiner triple systems. Des. Codes Cryptogr. 86, 449–462 (2018).MathSciNetCrossRef Jungnickel D., Tonchev V.D.: On Bonisoli’s theorem and the block codes of Steiner triple systems. Des. Codes Cryptogr. 86, 449–462 (2018).MathSciNetCrossRef
19.
Zurück zum Zitat Jungnickel D., Tonchev V.D.: Counting Steiner triple systems with classical parameters and prescribed rank. J. Comb. Theory Ser. A 162, 10–33 (2019).MathSciNetCrossRef Jungnickel D., Tonchev V.D.: Counting Steiner triple systems with classical parameters and prescribed rank. J. Comb. Theory Ser. A 162, 10–33 (2019).MathSciNetCrossRef
20.
Zurück zum Zitat Jungnickel D., Magliveras S.S., Tonchev V.D., Wassermann A.: On classifying Steiner triple systems by their \(3\)-rank. In: Bl”omer J. et al. (eds.), MACIS 2017, LNCS 10693, pp. 295–305 (2017). Springer, Berlin Jungnickel D., Magliveras S.S., Tonchev V.D., Wassermann A.: On classifying Steiner triple systems by their \(3\)-rank. In: Bl”omer J. et al. (eds.), MACIS 2017, LNCS 10693, pp. 295–305 (2017). Springer, Berlin
21.
Zurück zum Zitat Koolen J.H., Munemasa A.: Tight 2-designs and perfect \(1\)-codes in Doob graphs. J. Stat. Plann. Inference 86, 505–513 (2000).MathSciNetCrossRef Koolen J.H., Munemasa A.: Tight 2-designs and perfect \(1\)-codes in Doob graphs. J. Stat. Plann. Inference 86, 505–513 (2000).MathSciNetCrossRef
22.
Zurück zum Zitat Li S., Ding C., Xiong M., Ge G.: Narrow-sense BCH codes over \({\rm GF}(q)\) with length \( n=\frac{q^{m}-1}{q-1}\). IEEE Trans. Inf. Theory 63, 7219–7236 (2017).CrossRef Li S., Ding C., Xiong M., Ge G.: Narrow-sense BCH codes over \({\rm GF}(q)\) with length \( n=\frac{q^{m}-1}{q-1}\). IEEE Trans. Inf. Theory 63, 7219–7236 (2017).CrossRef
23.
Zurück zum Zitat Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).MATH Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).MATH
24.
Zurück zum Zitat MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).MATH MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).MATH
25.
Zurück zum Zitat Munemasa A., Tonchev V.D.: A new quasi-symmetric \(2\)-\((56,16,6)\) design obtained from codes. Discret. Math. 29, 231–234 (2004).MathSciNetCrossRef Munemasa A., Tonchev V.D.: A new quasi-symmetric \(2\)-\((56,16,6)\) design obtained from codes. Discret. Math. 29, 231–234 (2004).MathSciNetCrossRef
26.
Zurück zum Zitat Tonchev V.D.: Codes and designs. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1229–1268. Elsevier, Amsterdam (1998). Tonchev V.D.: Codes and designs. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1229–1268. Elsevier, Amsterdam (1998).
27.
Zurück zum Zitat Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121–128 (1999).MathSciNetCrossRef Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121–128 (1999).MathSciNetCrossRef
28.
Zurück zum Zitat Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 677–701. CRC Press, New York (2007). Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 677–701. CRC Press, New York (2007).
29.
Zurück zum Zitat Yuan J., Ding C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52, 206–212 (2006).MathSciNetCrossRef Yuan J., Ding C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52, 206–212 (2006).MathSciNetCrossRef
Metadaten
Titel
Steiner systems and 2-designs from ternary linear codes of length
verfasst von
Chunming Tang
Cunsheng Ding
Maosheng Xiong
Publikationsdatum
11.06.2019
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 12/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-019-00651-8

Weitere Artikel der Ausgabe 12/2019

Designs, Codes and Cryptography 12/2019 Zur Ausgabe