Infinite families of 3‐designs from APN functions

Tang, Chunming

doi:10.1002/jcd.21685

Cited by 15 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and Stab B is the stabilizer of B for this action. For some recent works on t-designs from group actions, we refer the reader to [25,31].…”

Section: Definition 1 Given a Set X And A Group G A Left Action Of G...mentioning

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

Self Cite

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

“…and Stab B is the stabilizer of B for this action. For some recent works on t-designs from group actions, we refer the reader to [25,31].…”

Section: Definition 1 Given a Set X And A Group G A Left Action Of G...mentioning

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

Self Cite

View full text Add to dashboard Cite

show abstract

“…We give a direct proof of it below. The reader is informed that 3-(q, q/2, q(q − 4)/8) designs with the same parameters as those of Corollary 23 were obtained from special APN functions in [21]. According to Magma experiments, the 3-designs in [21] and those in Corollary 23 are not isomorphic.…”

Section: It Then Follows Thatmentioning

confidence: 99%

“…The reader is informed that 3-(q, q/2, q(q − 4)/8) designs with the same parameters as those of Corollary 23 were obtained from special APN functions in [21]. According to Magma experiments, the 3-designs in [21] and those in Corollary 23 are not isomorphic. Hence, there are different ways of constructing 3-(q, q/2, q(q −4)/8) designs, where q is a power of 2.…”

Section: It Then Follows Thatmentioning

confidence: 99%

Infinite families of $ 3 $-designs from o-polynomials

Ding¹,

Tang²

2021

AMC

Self Cite

View full text Add to dashboard Cite

<p style='text-indent:20px;'>A classical approach to constructing combinatorial designs is the group action of a <inline-formula><tex-math id="M2">\begin{document}$ t $\end{document}</tex-math></inline-formula>-transitive or <inline-formula><tex-math id="M3">\begin{document}$ t $\end{document}</tex-math></inline-formula>-homogeneous permutation group on a base block, which yields a <inline-formula><tex-math id="M4">\begin{document}$ t $\end{document}</tex-math></inline-formula>-design in general. It is open how to use a <inline-formula><tex-math id="M5">\begin{document}$ t $\end{document}</tex-math></inline-formula>-transitive or <inline-formula><tex-math id="M6">\begin{document}$ t $\end{document}</tex-math></inline-formula>-homogeneous permutation group to construct a <inline-formula><tex-math id="M7">\begin{document}$ (t+1) $\end{document}</tex-math></inline-formula>-design in general. It is known that the general affine group <inline-formula><tex-math id="M8">\begin{document}$ {\mathrm{GA}}_1( {\mathrm{GF}}(q)) $\end{document}</tex-math></inline-formula> is doubly transitive on <inline-formula><tex-math id="M9">\begin{document}$ {\mathrm{GF}}(q) $\end{document}</tex-math></inline-formula>. The classical theorem says that the group action by <inline-formula><tex-math id="M10">\begin{document}$ {\mathrm{GA}}_1( {\mathrm{GF}}(q)) $\end{document}</tex-math></inline-formula> yields <inline-formula><tex-math id="M11">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>-designs in general. The main objective of this paper is to construct <inline-formula><tex-math id="M12">\begin{document}$ 3 $\end{document}</tex-math></inline-formula>-designs with <inline-formula><tex-math id="M13">\begin{document}$ {\mathrm{GA}}_1( {\mathrm{GF}}(q)) $\end{document}</tex-math></inline-formula> and o-polynomials. O-polynomials (equivalently, hyperovals) were used to construct only <inline-formula><tex-math id="M14">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>-designs in the literature. This paper presents for the first time infinite families of <inline-formula><tex-math id="M15">\begin{document}$ 3 $\end{document}</tex-math></inline-formula>-designs from o-polynomials (equivalently, hyperovals).</p>

show abstract

“…Recall that a group G acting on a set X is t-transitive (resp., t-homogeneous) if for any two ordered t-tuples (ν, k, λ) design admitting G as an automorphism group for some λ. For some recent works on t-designs from group actions, we refer the reader to [19,24].…”

Section: Group Actions and T-designsmentioning

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

Self Cite

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

Infinite families of 3‐designs from APN functions

Cited by 15 publications

References 19 publications

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

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

Infinite families of $ 3 $-designs from o-polynomials

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

Contact Info

Product

Resources

About