Two New Classes of Codebooks Asymptotically Achieving the Welch Bound

Two New Classes of Codebooks Asymptotically Achieving the Welch Bound

Exponential sums over Galois rings have many applications in coding theory, cryptography and algebraic combinatorics. In this article, we employ additive characters and multiplicative characters over Galois rings to present two classes of codebooks, and prove that these codebooks asymptotically achi...

Full description

Bibliographic Details
Main Authors: Shimin Sun, Li Han, Yang Yan, Yao Yao
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Codebooks
asymptotic optimality
Welch bound
Galois rings
Online Access:https://ieeexplore.ieee.org/document/9303476/

Internet

https://ieeexplore.ieee.org/document/9303476/

Similar Items