Papers
Topics
Authors
Recent
2000 character limit reached

Structure theorem of square complex orthogonal design

Published 22 Sep 2012 in cs.IT and math.IT | (1209.4965v5)

Abstract: Square COD (complex orthogonal design) with size $[n, n, k]$ is an $n \times n$ matrix $\mathcal{O}_z$, where each entry is a complex linear combination of $z_i$ and their conjugations $z_i*$, $i=1,\ldots, k$, such that $\mathcal{O}_zH \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/n$ by making a crucial observation between square COD and group representation, we prove the structure theorem of square COD.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.