1. Five-weight codes from three-valued correlation of M-sequences
- Author
-
Minjia Shi, Patrick Solé, Tor Helleseth, Liqin Qian, Anhui University [Hefei], Nanjing University of Aeronautics and Astronautics [Nanjing] (NUAA), The Selmer Center in Secure Communication, Department of Informatics [Bergen] (UiB), University of Bergen (UiB)-University of Bergen (UiB), Institut de Mathématiques de Marseille (I2M), and Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Sequence ,Ring (mathematics) ,Algebra and Number Theory ,Trace (linear algebra) ,Computer Networks and Communications ,Algebraic structure ,Applied Mathematics ,Structure (category theory) ,020206 networking & telecommunications ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Microbiology ,Combinatorics ,Character (mathematics) ,[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] ,010201 computation theory & mathematics ,Weight distribution ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,Abelian group ,Mathematics - Abstract
In this paper, for each of six families of three-valued \begin{document}$ m $\end{document} -sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring \begin{document}$ R = \mathbb{F}_2+u\mathbb{F}_2 $\end{document} , where \begin{document}$ u^2 = 0. $\end{document} The trace codes have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using character sums. Their support structure is determined. An application to secret sharing schemes is given. The parameters of the binary image are \begin{document}$ [2^{m+1}(2^m-1),4m,2^{m}(2^m-2^r)] $\end{document} for some explicit \begin{document}$ r. $\end{document}
- Published
- 2023