The number of the non‐full‐rank Steiner triple systems

Shi, Minjia; Xu, Luoshan; Krotov, Denis S.

doi:10.1002/jcd.21663

Cited by 7 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The prank of incidence structures, i.e., the dimension of the corresponding codes, can be used to classify incidence structures of certain types. For example, the 2-rank and 3-rank of Steiner triple and quadruple systems were intensively studied and employed for counting and classifying Steiner triple and quadruple systems [14], [15], [24], [28], [29], [34], [35], [36], [37].…”

Section: Linear Codes and Combinatorial T-designsmentioning

confidence: 99%

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences

Liu¹,

Ding²,

Mesnager³

et al. 2021

Preprint

View full text Add to dashboard Cite

The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. They are widely used in data storage and communication systems. A subclass of attractive BCH codes is the narrow-sense BCH codes over the Galois field GF(q) with length q +1, which are closely related to the action of the projective general linear group of degree two on the projective line. Despite its interest, not much is known about this class of BCH codes. This paper aims to study some of the codes within this class and specifically narrow-sense antiprimitive BCH codes (these codes are also linear complementary duals (LCD) codes that have interesting practical recent applications in cryptography, among other benefits). We shall use tools and combine arguments from algebraic coding theory, combinatorial designs, and group theory (group actions, representation theory of finite groups, etc.) to investigate narrow-sense antiprimitive BCH Codes and extend results from the recent literature. Notably, the dimension, the minimum distance of some q-ary BCH codes with length q + 1, and their duals are determined in this paper. The dual codes of the narrowsense antiprimitive BCH codes derived in this paper include almost MDS codes. Furthermore, the classification of PGL(2, p m )-invariant codes over GF(p h ) is completed. As an application of this result, the p-ranks of all incidence structures invariant under the projective general linear group PGL(2, p m ) are determined. Furthermore, infinite families of narrow-sense BCH codes admitting a 3-transitive automorphism group are obtained. Via these BCH codes, a coding-theory approach to constructing the Witt spherical geometry designs is presented. The BCH codes proposed in ⋆ C.

show abstract

Section: Linear Codes and Combinatorial T-designsmentioning

confidence: 99%

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences

Liu¹,

Ding²,

Mesnager³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The p-rank of incidence structures, i.e., the dimension of the corresponding codes, can be used to classify incidence structures of certain type. For example, the 2-rank and 3-rank of Steiner triple and quadruple systems were intensively studied and employed for counting and classifying Steiner triple and quadruple systems [14], [16], [18] [25], [26], [27], [28].…”

Section: Linear Codes Invariant Under Pgl 2 (Gf(2 M ))mentioning

confidence: 99%

The Projective General Linear Group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ and Linear Codes of Length $2^m+1$

Ding

Tang²,

Tonchev

2020

Preprint

View full text Add to dashboard Cite

The projective general linear group PGL 2 (GF(2 m )) acts as a 3-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over GF(2 h ) that are invariant under PGL 2 (GF(2 m )) are trivial codes: the repetition code, the whole space GF(2 h ) 2 m +1 , and their dual codes. As an application of this result, the 2-ranks of the (0,1)-incidence matrices of all 3-(q + 1, k, λ) designs that are invariant under PGL 2 (GF(2 m )) are determined. The second objective is to present two infinite families of cyclic codes over GF(2 m ) such that the set of the supports of all codewords of any fixed nonzero weight is invariant under PGL 2 (GF(2 m )), therefore, the codewords of any nonzero weight support a 3-design. A code from the first family has parameters [q +1, q −3, 4] q , where q = 2 m , and m ≥ 4 is even. The exact number of the codewords of minimum weight is determined, and the codewords of minimum weight support a 3-(q + 1, 4, 2) design. A code from the second family has parameters [q + 1, 4, q − 4] q , q = 2 m , m ≥ 4 even, and the minimum weight codewords support a 3-(q+1, q−4, (q−4)(q−5)(q−6)/60) design, whose complementary 3-(q + 1, 5, 1) design is isomorphic to the Witt spherical geometry with these parameters. A lower bound on the dimension of a linear code over GF(q) that can support a 3-(q +1, q −4, (q −4)(q −5)(q −6)/60) design is proved, and it is shown that the designs supported by the codewords of minimum weight in the codes from the second family of codes meet this bound.

show abstract

“…Very recently, Tang and Ding [22] settled this long‐standing problem by presenting an infinite family of BCH codes holding an infinite family of 4‐