Structure theorem of square complex orthogonal design

Abstract

Square COD (complex orthogonal design) with size [n, n, k] is an n × n matrix Oz, where each entry is a complex linear combination of zi and their conjugations zi*, i=1,…, k, such that OzH Oz = (|z1|2 + … + |zk|2)In. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…