Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 3^(n -1)/2 + 1

DOI10.1016/J.FFA.2023.102341MaRDI QIDQ6144448zbMATH OpenOpenAlexFDO

Authors Can Xiang, Chun-Ming Tang, Haode Yan, Min Guo

Publication date 29 January 2024

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

\(t\)-designscyclic codeslinear codessequencesSteiner systems

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes and caps in Galois spaces (51E22) Linear codes (general theory) (94B05)

Abstract: Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the methods of finite geometries and combinatorics. However, none of pseudo-geometric designs with the parameters $Sleft(2,q+1,(q^n-1)/(q-1)ight)$ is constructed by the approach of coding theory. In this paper, we use cyclic codes to construct pseudo-geometric designs. We firstly present a family of ternary cyclic codes from the $m$-sequences with Welch-type decimation $d=2cdot{3}^{(n-1)/2}+1$, and obtain some infinite family of 2-designs and a family of Steiner systems $Sleft(2,4,(3^n-1)/2ight)$ using these cyclic codes and their duals. Moreover, the parameters of these cyclic codes and their shortened codes are also determined. Some of those ternary codes are optimal or almost optimal. Finally, we show that one of these obtained Steiner systems is inequivalent to the point-line design of the projective space $mathrmPG(n-1,3)$ and thus is a pseudo-geometric design.

Recommendations

• Pseudo quasi-3 designs and their applications to coding theory
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
• Ternary codes of steiner triple systems
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
• A link between combinatorial designs and three-weight linear codes

Cites work

• A class of optimal ternary cyclic codes and their duals
• A construction of binary linear codes from Boolean functions
• A note on cyclic codes from APN functions
• A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences
• A sequence construction of cyclic codes over finite fields
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• An Infinite Family of Linear Codes Supporting 4-Designs
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
• Codes, Differentially \delta -Uniform Functions, and t -Designs
• Cyclic codes from cyclotomic sequences of order four
• Cyclic Codes From the Two-Prime Sequences
• Designs from linear codes
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 1284428 (Why is no real title available?)
• Infinite families of 3-designs from a type of five-weight code
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
• On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
• Recent results and problems on constructions of linear codes from cryptographic functions
• Recent results on designs with classical parameters
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Shortened Linear Codes Over Finite Fields
• Some new three-valued crosscorrelation functions for binary m-sequences
• Some results about the cross-correlation function between two maximal linear sequences
• Some Results on Cross-Correlation Distribution Between a <inline-formula> <tex-math notation="TeX">\(p\) </tex-math></inline-formula>-Ary <inline-formula> <tex-math notation="TeX">\(m\) </tex-math></inline-form
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
• Ternary m-sequences with three-valued cross-correlation function: new decimations of Welch and Niho type
• The dimension of projective geometry codes
• The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes

This page was built for publication: Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)

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