pith. sign in

arxiv: 1209.4965 · v5 · pith:MBBY6FFAnew · submitted 2012-09-22 · 💻 cs.IT · math.IT

Structure theorem of square complex orthogonal design

classification 💻 cs.IT math.IT
keywords squarecomplexmathcaldesignldotsorthogonalstructuretheorem
0
0 comments X
read the original 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}_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/n$ by making a crucial observation between square COD and group representation, we prove the structure theorem of square COD.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.