English

Structure theorem of square complex orthogonal design

Information Theory 2013-03-19 v5 math.IT

Abstract

Square COD (complex orthogonal design) with size [n,n,k][n, n, k] is an n×nn \times n matrix Oz\mathcal{O}_z, where each entry is a complex linear combination of ziz_i and their conjugations ziz_i^*, i=1,,ki=1,\ldots, k, such that OzHOz=(z12++zk2)In\mathcal{O}_z^H \mathcal{O}_z = (|z_1|^2 + \ldots + |z_k|^2)I_n. Closely following the work of Hottinen and Tirkkonen, which proved an upper bound of k/nk/n by making a crucial observation between square COD and group representation, we prove the structure theorem of square COD.

Cite

@article{arxiv.1209.4965,
  title  = {Structure theorem of square complex orthogonal design},
  author = {Yuan Li},
  journal= {arXiv preprint arXiv:1209.4965},
  year   = {2013}
}
R2 v1 2026-06-21T22:09:21.971Z