Cyclic Codes and Sequences: the Generalized Kasami Case
Jinquan Luo, Hongyu Wang, Yuansheng Tang

TL;DR
This paper analyzes exponential sums related to cyclic codes and sequences over binary fields, determining their value distributions, weight distributions of specific cyclic codes, and correlation properties of m-sequences, extending prior theoretical results.
Contribution
It provides explicit value distributions for exponential sums and applies these to derive weight distributions and correlation properties of binary cyclic codes and sequences, extending classical Kasami and related results.
Findings
Explicit value distribution of exponential sums involving trace functions.
Weight distribution of specific binary cyclic codes.
Correlation distribution among a family of m-sequences.
Abstract
Let with . Let and . In this paper we determine the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^m (\alpha x^{2^{m}+1})+\Tra_1^n(\beta x^{2^k+1})}\quad(\alpha\in \bF_{2^m},\beta\in \bF_{q})\] and \[\sum\limits_{x\in \bF_q}(-1)^{\Tra_1^m (\alpha x^{2^{m}+1})+\Tra_1^n(\beta x^{2^k+1}+\ga x)}\quad(\alpha\in \bF_{2^m},\beta,\ga\in \bF_{q})\] where and are the canonical trace mappings. As applications: (1). We determine the weight distribution of the binary cyclic codes and with parity-check polynomials and respectively where , and are the minimal polynomials of , and over respectively for a primitive element of…
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 · Finite Group Theory Research · graph theory and CDMA systems
