Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
From MaRDI portal
Publication:6144448
DOI10.1016/j.ffa.2023.102341arXiv2306.10744OpenAlexW4389373289MaRDI QIDQ6144448
Min Guo, Haode Yan, Chun-Ming Tang, Can Xiang
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
Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)
Cites Work
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
- Recent results on designs with classical parameters
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A note on cyclic codes from APN functions
- A class of optimal ternary cyclic codes and their duals
- The dimension of projective geometry codes
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Some results about the cross-correlation function between two maximal linear sequences
- A sequence construction of cyclic codes over finite fields
- Recent results and problems on constructions of linear codes from cryptographic functions
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Infinite families of 3-designs from a type of five-weight code
- Cyclic codes from cyclotomic sequences of order four
- 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-formula>-Sequence and Its Decimated Sequences
- Fundamentals of Error-Correcting Codes
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Ternary m-sequences with three-valued cross-correlation function: new decimations of Welch and Niho type
- Some new three-valued crosscorrelation functions for binary m-sequences
- Shortened Linear Codes Over Finite Fields
- Designs from Linear Codes
- On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- Cyclic Codes From the Two-Prime Sequences
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
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\)
