Character sums over a non-chain ring and their applications
From MaRDI portal
Publication:6112242
DOI10.3934/amc.2020134zbMath1522.11129OpenAlexW3133752701MaRDI QIDQ6112242
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020134
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Gauss and Kloosterman sums; generalizations (11L05) Other character sums and Gauss sums (11T24) Estimates on character sums (11L40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- More constructions of near optimal codebooks associated with binary sequences
- New nearly optimal codebooks from relative difference sets
- Construction of cyclotomic codebooks nearly meeting the Welch bound
- Codebooks from almost difference sets
- Grassmannian frames with applications to coding and communication
- Few-weight codes from trace codes over a local ring
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- Nearly optimal codebooks based on generalized Jacobi sums
- Six constructions of asymptotically optimal codebooks via the character sums
- Two constructions of asymptotically optimal codebooks
- New classes of \(p\)-ary few weight codes
- Two families of nearly optimal codebooks
- The Gauss sums and Jacobi sums over Galois ring \(\mathrm{GR}(p^2,r)\)
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- New Families of Codebooks Achieving the Levenstein Bound
- Several New Infinite Families of Bent Functions and Their Duals
- Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping
- A Construction of Codebooks Associated With Binary Sequences
- An Introduction to Frames
- Complex Codebooks From Combinatorial Designs
- A Generic Construction of Complex Codebooks Meeting the Welch Bound
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
- Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum
- Symmetric informationally complete quantum measurements
- The Weight Distribution of Some Irreducible Cyclic Codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Two Classes of Codebooks Nearly Meeting the Welch Bound
- New Constructions of Codebooks Nearly Meeting the Welch Bound With Equality
- Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
This page was built for publication: Character sums over a non-chain ring and their applications
