Steiner systems S(2, 4, 3ᵐ-12) and 2-designs from ternary linear codes of length 3ᵐ-12

DOI10.1007/S10623-019-00651-8zbMATH Open1423.94157arXiv1901.09228OpenAlexW2950788636MaRDI QIDQ2334438FDOQ2334438

Authors: Cunsheng Ding, Maosheng Xiong, Chun-Ming Tang 

Publication date: 7 November 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1901.09228

Recommendations

• Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
• Ternary codes of steiner triple systems
• scientific article; zbMATH DE number 617595
• Linear codes from support designs of ternary cyclic codes
• Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes

zbMATH Keywords

\(t\)-designlinear codeSteiner systemcyclic code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Cites Work

• Secret sharing schemes from three classes of linear codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Title not available (Why is that?)
• On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
• Balanced incomplete block designs and related designs
• How to build robust shared control systems
• Tight 2-designs and perfect 1-codes in Doob graphs
• On 2-ranks of Steiner triple systems
• Linear perfect codes and a characterization of the classical designs
• A characterization of designs related to an extremal doubly-even self-dual code of length 48
• On a 5-design related to an extremal doubly even self-dual code of length 72
• Title not available (Why is that?)
• Counting Steiner triple systems with classical parameters and prescribed rank
• On Bonisoli's theorem and the block codes of Steiner triple systems
• On classifying Steiner triple systems by their 3-rank
• Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$
• A new quasi-symmetric 2-(56,\,16,\,6) design obtained from codes
• Infinite families of 2-designs and 3-designs from linear codes
• Infinite families of 3-designs from a type of five-weight code
• Designs from linear codes
• Coding and Combinatorics
• Another generalisation of the binary Reed-Muller codes and its applications
• An Infinite Family of Steiner Systems from Cyclic Codes
• Bent Vectorial Functions, Codes and Designs

Cited In (21)

• An Infinite Family of Steiner Systems from Cyclic Codes
• Infinite families of 2‐designs from a class of cyclic codes
• Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
• New infinite families of near MDS codes holding \(t\)-designs
• Some 3-designs and shortened codes from binary cyclic codes with three zeros
• A class of affine-invariant codes and their support 2-designs
• Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
• Some \(t\)-designs from BCH codes
• Combinatorial \(t\)-designs from quadratic functions
• Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
• Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
• Infinite families of 2-designs from a class of affine-invariant codes
• Linear codes from support designs of ternary cyclic codes
• Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
• Constructions of cyclic codes and extended primitive cyclic codes with their applications
• Infinite families of 2‐designs derived from affine‐invariant codes
• An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
• Infinite families of 3-designs from special symmetric polynomials
• A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
• Some shortened codes from linear codes constructed by defining sets

Uses Software

• Code Tables

This page was built for publication: Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334438)