On orthogonal matrices

By M. Behbahani. 2004

294 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/37948eb20775b4cf7dbeef33a0f83bb6f7e19262

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

GRASSMANNIAN FRAMES WITH APPLICATIONS TO CODING AND COMMUNICATION (2003, background): “Moreover, this matrix can be constructed explicitly, see [18,34].”
Geometry of Quantum States: Index (2007, background): “Paley conjectured [714] that in these cases they always exist, but his conjecture remains open.”
On generalised Paley graphs and their automorphism groups (2006, background): “The generalized Paley graphs are, as their name suggests, a generalization of the Paley graphs, first defined by Paley in 1933 (see [15]).”
Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning (2018, methodology): “rames preserve the optimality condition when all nodes are waited for (k= m), make ETFs good candidates for encoding, in light of the required property (6). We specically evaluate the Paley ETF from Paley (1933) and Goethals and Seidel (1967); Hadamard ETF from Szoll}osi (2013) (not to be confused w”
Combinatorial designs: constructions and analysis (2003, methodology): “Quadratic residue difference sets are also known as Paley difference sets and were first constructed in Paley [83].”
What is known about unit cubes (2005, background): “It was conjectured by Paley [84] that the condition is also sufficient.”
A family of skew Hadamard difference sets (2006, background): “The only known examples of skew Hadamard difference sets are the classical Paley–Hadamard difference sets formed by the nonzero quadratic residues of a finite field and described by Paley in 1933 [19].”
Spectra of Graphs (2011, background): “9.1 Strongly regular graphs . . . . . . . . . . . . . . . . . . . . . . . 113 9.1.1 Simple examples . . . . . . . . . . . . . . . . . . . . . . . 113 9.1.2 The Paley graphs . . . . . . . . . . . . . . . . . . . . . . . 114 9.1.3 Adjacency matrix . . . . . . . . . . . . . . . . . . . . .”