Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shayne Waldron

dblp:99/5141 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2017
0000-0001-5612-2371ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Coding theory · 64% Information theory · 36%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
coding bounds
0.322017
A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t -Designs · IEEE Trans. Inf. Theory 2017
Generalized Welch bound equality sequences are tight fram · IEEE Trans. Inf. Theory 2003
Information theory › signal processing › signal representation
frame theory
0.322017
A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t -Designs · IEEE Trans. Inf. Theory 2017
Generalized Welch bound equality sequences are tight fram · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › coding bounds
welch bound
0.322017
A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t -Designs · IEEE Trans. Inf. Theory 2017
Generalized Welch bound equality sequences are tight fram · IEEE Trans. Inf. Theory 2003
Information theory › signal processing › signal representation › frame theory
tight frame
0.012003
Generalized Welch bound equality sequences are tight fram · IEEE Trans. Inf. Theory 2003
YearPublicationVenuePosition
2017 A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t -Designs
abstract
The Welch bounds for a finite set of unit vectors are a family of inequalities indexed by t = 1, 2, ..., which describe how “evenly spread” the vectors are. They have important applications in signal analysis, where sequences giving equality in the first Welch bound are known as Welch bound equality sequences or as unit norm tight frames. Here, we consider sequences of vectors giving equality in the higher order Welch bounds. These are seen to correspond to tight frames for the complex symmetric t-tensors (which we prove always exist). We show that for t > 1, the Welch bounds can be sharpened for real vectors, and again, vectors giving equality always exist. We give a unified treatment of various conditions for equality in both the real and complex cases. In particular, we give an explicit description of the corresponding cubature rules (t-designs). Our results set up a framework for the construction and classification several configurations of vectors of recent interest. These include mutually unbiased bases, complex equiangular lines, spherical half-designs, projective t-designs, and minimisers of the higher order frame potential. One interesting consequence is a construction of sets of complex equiangular lines, which were previously unknown.
Shayne Waldron
IEEE Trans. Inf. Theory1
2016 A Characterization of Projective Unitary Equivalence of Finite Frames and Applications
abstract
Many applications of finite tight frames (e.g., the use of SICs and mutually unbiased bases (MUBs) in quantum information theory and harmonic frames for the analysis of signals subject to erasures) depend only on the vectors up to projective unitary equivalence. It is well known that two finite sequences of vectors in inner product spaces are unitarily equivalent if and only if their respective inner products (Gramian matrices) are equal. Here we present a corresponding result for the projective unitary equivalence of two sequences of vectors (lines) in inner product spaces, i.e., that a finite number of (Bargmann) projective (unitary) invariants are equal. This result is equivalent to finding a rank-one matrix completion of a certain matrix. We give an algorithm to recover the sequence of vectors (up to projective unitary equivalence) from a small subset of these projective invariants and apply it to SICs, MUBs, and harmonic frames. We also extend our results to the projective similarity of vectors.
Tuan-Yow Chien, Shayne Waldron
SIAM J. Discret. Math.2
2003 Generalized Welch bound equality sequences are tight fram
abstract
This article shows what are called the Welch (1974) bound equality (WBE) sequences by the signal processing community are precisely the isometric/equal norm-normalized/uniform tight frames which are currently being investigated for a number of applications, and in the real case are the spherical 2-designs of combinatorics. Recent applications include wavelet expansions, Grassmannian frames, frames robust to erasures, and quantum measurements. This is done by giving an elementary proof of a generalization of Welch's inequality to vectors which need not have equal energy, and then showing that equality occurs in this exactly when the vectors form a tight frame.
Shayne Waldron
IEEE Trans. Inf. Theory1