Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions
Jinquan Luo, San Ling, Chaoping Xing

TL;DR
This paper analyzes exponential sums related to Dembowski-Ostrom functions over finite fields, determines the weight distribution of certain cyclic codes, and studies the correlation among m-sequences, advancing coding theory and sequence design.
Contribution
It provides explicit value distributions of exponential sums from Dembowski-Ostrom functions and applies these results to cyclic code weight distributions and m-sequence correlations.
Findings
Explicit value distribution formulas for exponential sums.
Determination of weight distributions for specific cyclic codes.
Analysis of correlation distribution among m-sequences.
Abstract
Let with be an odd prime. Let and . In this paper we determine the value distribution of following exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha x^{p^{3k}+1}+\beta x^{p^k+1})}\quad(\alpha\in \bF_{p^m},\beta\in \bF_{q})\] and \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha x^{p^{3k}+1}+\beta x^{p^k+1}+\ga x)}\quad(\alpha\in \bF_{p^m},\beta,\ga\in \bF_{q})\] where and are the canonical trace mappings and is a primitive -th root of unity. As applications: (1). We determine the weight distribution of the cyclic codes and over with parity-check polynomials and respectively where is a divisor of , and , and are the minimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
