Technical Program

Paper Detail

Paper IDA.2.3
Paper Title Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach
Authors Shohei Satake, Kumamoto University, Japan; Yujie Gu, Tel Aviv University, Israel
Session A.2: Algebraic Coding Theory II
Presentation Lecture
Track Algebraic and Combinatorial Coding Theory
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract Complex codebooks with small inner-product correlation have many applications such as in code-division multiple access communications and compressed sensing. It is desirable but difficult to construct optimal codebooks achieving the well-known Welch bound. In this paper, complex codebooks are investigated from a graph theoretic perspective. A connection between codebooks and Cayley sum graphs is established. Based on this, many infinite families of complex codebooks are explicitly constructed, which are asymptotically optimal with respect to the Welch bound. These constructions not only include some known constructions as special cases but also provide flexible new parameters.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!