Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Structure theorem of square complex orthogonal design (1209.4965v5)

Published 22 Sep 2012 in cs.IT and math.IT

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

We haven't generated a summary for this paper yet.