Pith. sign in

REVIEW 3 major objections 5 minor 44 references

Abelian and Dihedral equiangular tight frames of redundancy $2$

T0 review · 3 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Regular dihedral equiangular tight frames are exactly 2-negacirculant skew Hadamard matrices, and they are always genuinely projective.

desk verdict Clean structural results: strict abelian ETFs are ruled out, and regular dihedral ETFs reduce to negacirculant skew Hadamards; the n≤22 classification is not reproducible. read the letter →

arxiv 2509.01753 v2 pith:HPN3GWZ2 submitted 2025-09-01 math.CO

Radel Ben Av , Xuemei Chen , Assaf Goldberger , Kasso A. Okoudjou This is my paper · ORCID
classification math.CO MSC 42C1552C30
keywords equiangulartightframesgroupdihedralprojectiveunitaryrepresentationsskewHadamardmatricesPaleyETFsWelchbound
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks which groups can produce equiangular tight frames—optimal sets of N lines in C^n that meet the Welch bound—and shows that symmetry forces genuine projectivity. For abelian groups, it proves that a strictly abelian ETF(N,n) can exist only when n(N-n)/(N-1) is an integer; in particular, cyclic frames cannot realize the redundancy-2 or maximal cases. For the dihedral group, it characterizes all dihedral tight frames and proves that regular dihedral ETF(2n,n) are precisely the frames coming from skew Hadamard matrices whose four n-by-n blocks are negacirculant, so they are always genuinely projective. Paley ETFs and their doubles are shown to be dihedral frames of exactly this type, and an exhaustive classification for n up to 22 shows almost all small examples are of Paley type. The paper leaves the existence of non-regular dihedral ETFs open, while proving only finitely many can exist for each n.

What carries the argument

The workhorse is the Gram matrix of a dihedral configuration, which after switching equivalence has the block form [A,B;B^T,A^T] with A,B circulant for strict representations and negacirculant for projective ones. The paper computes the Artin-Wedderburn decomposition of the two matrix algebras, converts tightness into self-adjoint rank-n idempotents in that decomposition, and then reads off equiangularity as the condition that the off-diagonal blocks come from a skew Hadamard matrix. The central identity is Theorem 4.21/4.24: a configuration is a regular dihedral ETF(2n,n) exactly when, up to switching equivalence, its Gram matrix is I_{2n} + (1/sqrt(2n-1)) [i(P-I), Q; Q^T, i(-P+I)] with P,Q

What would settle it

A single regular dihedral ETF(2n,n) that is strict, or with odd n greater than 1, would falsify Theorem 4.24; equivalently, a 2-circulant skew Hadamard matrix H=[P,Q;-Q^T,P^T] with circulant P,Q would contradict Lemma 4.22. Since Theorem 4.21 reduces the regular case to 2-negacirculant skew Hadamard matrices, an independent computer search for such matrices at n=18 already finds none; exhibiting a regular dihedral ETF(36,18), or checking any candidate against the normal form (4.12), would settle the claim.

Watch

Extended reading notes

Core claim

The paper's central discovery is a structural dichotomy. For abelian groups, if n(N-n)/(N-1) is not an integer—which covers ETF(2n,n) and ETF(n^2,n)—no strictly abelian group frame can be equiangular tight, so any such ETF must come from a genuinely projective representation. In the dihedral case, the paper characterizes all dihedral tight frames by their Gram matrices' block structure, and proves that a regular dihedral ETF(2n,n) is equivalent to a skew Hadamard matrix H=[P,Q;-Q^T,P^T] whose four n-by-n blocks are negacirculant. In particular, regular dihedral ETFs are always genuinely projective, can occur only for even n, and the search is exactly the search for 2-negacirculant skew Hadam

Load-bearing premise

The classification of dihedral ETFs assumes regularity—that the first n orbit vectors form a basis of C^n—and the paper knows no non-regular dihedral ETF, so a non-regular example would lie outside the theorem's reach.

Editorial extensions

If this is right

  • For abelian group frames, ETF(2n,n) and ETF(n^2,n) require genuinely projective representations; cyclic-group frames for such parameters do not exist.
  • There are no strict regular dihedral ETFs, and no regular dihedral ETFs for odd n greater than 1; regular dihedral ETFs correspond exactly to 2-negacirculant skew Hadamard matrices.
  • Paley ETFs and their doubles are genuine projective dihedral frames for primes q congruent to 3 modulo 4.
  • An exhaustive search finds no regular dihedral ETF(36,18); all regular dihedral ETFs for n up to 22 except n=16 are of Paley type, and non-Paley examples exist for n=16, 24, and 26.
  • For each fixed n, only finitely many dihedral ETF(2n,n) exist up to switching equivalence, but no non-regular example is known.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the classification is right, the bottleneck for building regular dihedral ETFs becomes the existence of 2-negacirculant skew Hadamard matrices; the Paley family supplies infinitely many, but whether all such matrices are accounted for is a separate combinatorial question.
  • The non-regular case is completely open: a non-regular dihedral ETF, if it exists, would lie outside the Hadamard-matrix correspondence, and the finiteness proof suggests a finite search space but no constructive route into it.
  • The algebraic-integer obstruction for abelian groups may extend to other nonabelian groups, suggesting that projectivity is a generic requirement for symmetry-constrained ETFs at redundancy 2.
  • The double Paley ETF is dihedral because a larger dihedral copy lives inside the projective line's symmetry group; this hints at a criterion for when Hadamard doubling preserves dihedral structure.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies group frames indexed by a group, allowing projective representations. For abelian groups, Theorem 3.2 shows that no strictly abelian ETF(N,n) exists when n(N-n)/(N-1) is not an integer, and Corollary 3.3 extends this to cyclic group frames. The main body characterizes dihedral configurations: Theorem 4.3 describes the Gram matrix form, Theorems 4.8 and 4.9 parameterize all dihedral tight frames via Artin-Wedderburn decompositions of the algebras SD_n and PD_n, and Proposition 4.15 characterizes regularity. The central structural results are Theorem 4.21, which reduces regular dihedral ETFs to skew Hadamard matrices with 2-circulant or 2-negacirculant block structure, and Theorem 4.24, which shows that every regular dihedral ETF(2n,n) is genuine projective and corresponds to a 2-negacirculant skew Hadamard matrix. The paper also proves finiteness of dihedral ETFs for fixed n, shows Paley and double Paley ETFs are genuine projective dihedral, and reports a classification for n ≤ 22, including the nonexistence of regular dihedral ETF(36,18).

Significance. If the computational classification is verified, the paper gives a clean, parameter-free reduction of regular dihedral ETFs of redundancy 2 to a finite combinatorial object: 2-negacirculant skew Hadamard matrices. The algebraic derivations, especially the Artin-Wedderburn decomposition of the relevant matrix algebras and the equivalence in Theorem 4.21, are elegant and appear sound. The connection to Paley and double Paley ETFs is a substantive new observation. However, the headline classification claims in Theorems 6.1 and 6.2 rest on an undisclosed exhaustive search and an informal switching-inequivalence procedure; these parts are not currently reproducible or machine-checkable. The gap is localized to Section 6 but it is load-bearing for the classification contribution.

major comments (3)
  1. [§6.2, Theorems 6.1 and 6.2] The asserted exhaustive search up to n=22 over pairs (P,Q) of negacirculant ±1 matrices with P+P^T=2I and PP^T+QQ^T=2nI is not reproducible. No algorithm, pseudocode, pruning strategy, search-space size, or code is supplied. The reduction to this pair condition is justified, but the claim that the search was exhaustive is a computational certificate that the manuscript does not provide. Without an independent way to verify the enumeration, Theorems 6.1 and 6.2 are not checkable. Please provide a full description of the search, preferably with code or a certificate (e.g., a SAT/CP proof, or a verifiable archive).
  2. [§6.3, Theorem 6.2 and Table 1] The proof of pairwise switching inequivalence and the classification claims depends on claims that are not substantiated. In particular, the statement that 'the set of all pairs of indices (i,j) with i≠j has at most two orbits under the automorphism group of the Paley type matrix' is used to limit the search, but no proof of this orbit-count claim is given, and the Sage code that implements the verification is not included. The graph-isomorphism reduction is reasonable, but the final inequivalence and classification results need either a complete proof of the orbit structure or a fully reproducible computational script.
  3. [Abstract and §1.2] The abstract and introduction state that the paper gives 'a characterization of all dihedral tight frames and dihedral ETF(2n,n)'. In fact, Theorem 4.21 applies only to regular dihedral ETFs (Definition 4.12); the paper explicitly states that no example of a non-regular dihedral ETF is known and that this case remains open. The non-regular case is not characterized. Please qualify the abstract and introduction so that the claims match the theorem statements.
minor comments (5)
  1. [§1.2 vs §6.2] The introduction says the numerical/exact classification covers 'n ≤ 20, n≠16', while Theorem 6.2 and Table 1 state n ≤ 22. Please make the range consistent.
  2. [§6.1] The text says 'We do know that at size n=16, 20 there are dihedral ETFs, for instance those coming from the double Paley construction.' For n=16, the double Paley construction would require q=15, which is not a prime power; the Paley construction at q=31 is the relevant one. Please correct this attribution.
  3. [§6.2 after Theorem 6.2] 'The proof will be given below' is followed by a computational procedure, not a mathematical proof. Please state explicitly which parts are computer-assisted and which are rigorous.
  4. [Equation (4.3)] The definition of \hat M is typographically unclear; it should state explicitly that the exponents are the odd integers 1,3,...,2n-1.
  5. [Throughout] There are several typos: 'cosider' in Definition 2.3, 'the the' in Definition 2.13, 'SDnv we can generate' after Lemma 4.1, and 'sub quotient group' in Definition 2.5. Also, references [21] and [22] appear to be the same arXiv paper and should be merged or distinguished.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the structural theorems are derived from explicit algebraic decompositions and independent Hadamard facts; self-citation is incidental and the computational search is a verifiability issue, not circularity.

full rationale

The main derivation chain is self-contained. Theorem 4.3 derives the block-form of dihedral Gram matrices directly from the dihedral relations and the definition of the configurations; Theorem 4.8/4.9 obtains all tight dihedral frames from an explicit Artin-Wedderburn idempotent computation, not from the conclusion. Theorem 4.21, the central equivalence between regular dihedral ETFs and structured skew Hadamard matrices, is proved by algebra: Corollary 4.18 identifies regularity with imaginary off-diagonal A, Proposition 4.16 computes Re(A), and Lemma 2.2 supplies the independent conference-matrix-to-ETF correspondence. The converse direction likewise uses Lemma 4.19, which is proved from the Hadamard equations. Lemma 4.22 ruling out 2-circulant skew Hadamard matrices is an independent modular arithmetic argument, so Theorem 4.24 follows by combining independent pieces rather than by definitional identity. The Paley ETF results use the classical external Paley Hadamard construction and the automorphism-group criterion of Lemma 2.9, whose proof is given. The only self-citation, [3], is used for background on partitioned matrix algebras and is not load-bearing. The computational classification in Section 6.2 relies on an exhaustive search whose algorithm and code are not supplied; this is a reproducibility/verification limitation, not a circularity, since the claimed search condition (negacirculant P,Q with PP^T+QQ^T=2nI) is justified by Theorem 4.21 and no fitted parameter is subsequently relabeled as a prediction. Overall, no step reduces to its own input, and no conclusion is forced solely by author self-citation.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters or invented entities. The paper's parameters are structural degrees of freedom (choices of unit vectors in the tight-frame idempotent classification, choice of negacirculant first rows in the search), not fitted values. All background assumptions are standard results in representation theory, frame theory, and Hadamard matrix theory, with the dihedral action freeness proven in the paper.

assumptions (5)
  • domain assumption Vectors in an ETF have equal norms
    Used in Section 1.1 to justify assuming unit-norm vectors, citing Bodmann and Paulsen [4].
  • standard math The Welch bound and the fact that ETFs achieve it
    Used throughout to fix the off-diagonal modulus of ETF Gram matrices.
  • standard math Finite-dimensional C*-algebras are semisimple and decompose via Artin-Wedderburn
    Used in Section 4.2 to classify tight dihedral frames (Theorems 4.8 and 4.9).
  • standard math Hadamard matrices of order m exist only for m = 1, 2 or m divisible by 4
    Used in Lemma 4.22 and Corollary 4.25 to rule out odd n and strict 2-circulant cases.
  • domain assumption The action of the dihedral subgroup Delta_n on the projective line P^1_q is free
    Proven as Lemma 5.5; required to apply Lemma 2.9 in the proof that Paley ETFs are dihedral.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Abelian and Dihedral equiangular tight frames of redundancy $2$." pith.science (2026). https://pith.science/paper/HPN3GWZ2

@misc{pith2026250901753,
  author       = {Pith},
  title        = {Pith review of: Abelian and Dihedral equiangular tight frames of redundancy $2$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HPN3GWZ2}},
  note         = {Machine review of arXiv:2509.01753}
}
abstract

This paper studies group frames ($G$-frames) where the unitary group representation can be projective. When the group is abelian, for most combinations $N, n$, we show that $ETF(N,n)$ can only exist for genuinely projective group representations. In particular, cyclic-group frames for such parameters do not exist. We also give a characterization of all dihedral tight frames and dihedral $ETF(2n,n)$, using which, we conclude that regular dihedral $ETF(2n,n)$ must be genuinely projective. Following that, we give a characterization of regular dihedral $ETF(2n,n)$ in terms of certain structured skew Hadamard matrices. We then show that Paley $ETF(2n,n)$ and its doubling are both of this type. Finally, we classify all regular dihedral $ETF(2n,n)$ for $n\le 22$ up to switching equivalence.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

44 extracted references · 43 canonical work pages

  1. [1]

    D. M. Appleby, Symmetric informationally complete-positive operator valued measures and the extended Clifford group, Journal of Mathematical Physics 46 (2005), no. 5

    work page 2005

  2. [2]

    Marcus Appleby, Ingemar Bengtsson, Steven Flammia, and Dardo Goyeneche, Tight frames, Hadamard matrices and Zauner’s conjecture , J. Phys. A 52 (2019), no. 29, 295301, 26. MR 3983953

    work page 2019

  3. [3]

    5, 113908

    Radel Ben-Av, Giora Dula, Assaf Goldberger, Ilias Kotsireas, and Yossi Strassler, New weighing matrices via partitioned group actions , Discrete Mathematics 347 (2024), no. 5, 113908

    work page 2024

  4. [4]

    B. G. Bodmann and V. I. Paulsen, Frames, graphs, and erasures , Linear Algebra Appl. 404 (2005), 118–146

    work page 2005

  5. [5]

    Xuemei Chen, Victor Gonzalez, Eric Goodman, Shujie Kang, and Kasso A Okoudjou, Universal optimal configurations for the p-frame potentials , Advances in Computational Mathematics 46 (2020), no. 1, 1–22

    work page 2020

  6. [6]

    Xuemei Chen, Douglas P Hardin, and Edward B Saff, On the search for tight frames of low coherence , Journal of Fourier Analysis and Applications 27 (2021), no. 1, 1–27

    work page 2021

  7. [7]

    8, 4410–4423

    Xuemei Chen, Gitta Kutyniok, Kasso A Okoudjou, Friedrich Philipp, and Rongrong Wang, Measures of scalability, IEEE transactions on information theory 61 (2015), no. 8, 4410–4423

    work page 2015

  8. [8]

    Davidson, C*-algebras by example , Fields Institute for Research in Mathematical Sciences Toronto: Fields Institute monographs, American Mathematical Society, 1996

    Kenneth R. Davidson, C*-algebras by example , Fields Institute for Research in Mathematical Sciences Toronto: Fields Institute monographs, American Mathematical Society, 1996

    work page 1996

Show all 44 references
  1. [9]

    Stafford, On the automorphisms of Paley’s type ii Hadamard matrix , Discrete Mathematics 308 (2008), no

    Warwick de Launey and Richard M. Stafford, On the automorphisms of Paley’s type ii Hadamard matrix , Discrete Mathematics 308 (2008), no. 13, 2910–2924, Combinatorial Designs: A tribute to Jennifer Seberry on her 60th Birthday

    2008

  2. [10]

    Philippe Delsarte, JM Goethals, and JJ Seidel, Bounds for systems of lines, and jacobi polynomials , Geometry and Combinatorics, Elsevier, 1991, pp. 193–207

    1991

  3. [11]

    11, 4245–4250

    Cunsheng Ding and Tao Feng, A generic construction of complex codebooks meeting the Welch bound , IEEE Transactions on Information Theory 53 (2007), no. 11, 4245–4250

    2007

  4. [12]

    Cunsheng Ding and Tao Feng, A generic construction of complex codebooks meeting the Welch bound , IEEE Transactions on Information Theory 53 (2007), 4245–4250. 30 R. BEN-A V, X. CHEN, A. GOLDBERGER, AND K. A. OKOUDJOU

    2007

  5. [13]

    Kean Fallon and Joseph W Iverson, On the optimal arrangement of 2d lines in Cd, arXiv preprint arXiv:2312.09975 (2023)

    2023 arXiv

  6. [14]

    Mixon, and Jesse D

    Matthew Fickus, John Jasper, Dustin G. Mixon, and Jesse D. Peterson, Hadamard equiangular tight frames, Appl. Comput. Harmon. Anal. 50 (2021), 281–302. MR 4162318

    2021

  7. [15]

    Mixon, and John Jasper, Equiangular tight frames from hyperovals , IEEE Trans

    Matthew Fickus, Dustin G. Mixon, and John Jasper, Equiangular tight frames from hyperovals , IEEE Trans. Inform. Theory 62 (2016), no. 9, 5225–5236. MR 3549477

    2016

  8. [16]

    Schmitt, Harmonic equiangular tight frames comprised of regular simplices, Linear Algebra Appl

    Matthew Fickus and Courtney A. Schmitt, Harmonic equiangular tight frames comprised of regular simplices, Linear Algebra Appl. 586 (2020), 130–169. MR 4024972

    2020

  9. [17]

    1, 85–96

    Deguang Han, Classification of finite group-frames and super-frames , Canadian Mathematical Bulletin 50 (2007), no. 1, 85–96

    2007

  10. [18]

    4, 685–695

    Deguang Han and David Larson, Frame duality properties for projective unitary representations, Bulletin of the London Mathematical Society 40 (2008), no. 4, 685–695

    2008

  11. [19]

    8, Cambridge University Press, 2020, p

    Joseph W Iverson, John Jasper, and Dustin G Mixon, Optimal line packings from finite group actions , Forum of Mathematics, Sigma, vol. 8, Cambridge University Press, 2020, p. e6

    2020

  12. [20]

    3, 731–763

    , Optimal line packings from nonabelian groups , Discrete & Computational Geometry 63 (2020), no. 3, 731–763

    2020

  13. [21]

    , More on the optimal arrangement of 2d lines in Cd, arXiv preprint arXiv:2410.17379 (2024)

    2024 arXiv

  14. [22]

    Iverson, John Jasper, and Dustin G

    Joseph W. Iverson, John Jasper, and Dustin G. Mixon, More on the optimal arrangement of 2d lines in Cd, 2024

    2024

  15. [23]

    Kantor, Automorphism groups of Hadamard matrices , Journal of Combinatorial Theory, Series A 6 (1969), 279–281

    William M. Kantor, Automorphism groups of Hadamard matrices , Journal of Combinatorial Theory, Series A 6 (1969), 279–281

    1969

  16. [24]

    Gregory Karpilovsky, Projective representations of finite groups, Monographs and textbooks in pure and applied mathematics; 94, Marcel Dekker, New York, 1985 (English)

    1985

  17. [25]

    2; new ser., 2, Clarendon Press ; Oxford University Press, Oxford [Oxfordshire], New York, 1987 (English)

    , The Schur multiplier , London Mathematical Society monographs; new ser., no. 2; new ser., 2, Clarendon Press ; Oxford University Press, Oxford [Oxfordshire], New York, 1987 (English)

    1987

  18. [26]

    Jianfeng Lu and Stefan Steinerberger, Neural collapse under cross-entropy loss, Appl. Comput. Harmon. Anal. 59 (2022), 224–241. MR 4412185

    2022

  19. [27]

    11138, SPIE, 2019, pp

    Mark Magsino and Dustin G Mixon, Biangular gabor frames and zauner’s conjecture , Wavelets and Sparsity XVIII, vol. 11138, SPIE, 2019, pp. 434–439

    2019

  20. [28]

    Brendan D McKay, Practical graph isomorphism, Congressus Numerantium 30 (1981), 45–87

    1981

  21. [29]

    Mixon, Hans Parshall, and Jianzong Pi, Neural collapse with unconstrained features , Sampl

    Dustin G. Mixon, Hans Parshall, and Jianzong Pi, Neural collapse with unconstrained features , Sampl. Theory Signal Process. Data Anal. 20 (2022), no. 2, Paper No. 11, 13. MR 4455183

    2022

  22. [30]

    R. E. A. C. Paley, On orthogonal matrices , Journal of Mathematics and Physics 12 (1933), no. 1–4, 311–320

    1933

  23. [31]

    Vardan Papyan, X. Y. Han, and David L. Donoho,Prevalence of neural collapse during the terminal phase of deep learning training , Proc. Natl. Acad. Sci. USA 117 (2020), no. 40, 24652–24663. MR 4250189

    2020

  24. [32]

    Alexey Rastegin, Estimating the Shannon entropy and (un)certainty relations for design-structured POVMs, SIAM J. Appl. Math. 82 (2022), no. 3, 1001–1019. MR 4438049

    2022

  25. [33]

    Rastegin, Uncertainty relations for quantum measurements from generalized equiangular tight frames, Ann

    Alexey E. Rastegin, Uncertainty relations for quantum measurements from generalized equiangular tight frames, Ann. Physics 470 (2024), Paper No. 169785, 13. MR 4796067

    2024

  26. [34]

    Renes, Robin Blume-Kohout, A

    Joseph M. Renes, Robin Blume-Kohout, A. J. Scott, and Carlton M. Caves, Symmetric informationally complete quantum measurements, J. Math. Phys. 45 (2004), no. 6, 2171–2180. MR 2059685

    2004

  27. [35]

    Xian Shi, The entanglement criteria based on equiangular tight frames , J. Phys. A 57 (2024), no. 7, Paper No. 075302, 16. MR 4705312

    2024

  28. [36]

    W. A. Stein et al., Sage Mathematics Software (Version 10.5.1) , The Sage Development Team, 2025, http://www.sagemath.org

    2025

  29. [37]

    Heath, Jr., Grassmannian frames with applications to coding and communication, Appl

    Thomas Strohmer and Robert W. Heath, Jr., Grassmannian frames with applications to coding and communication, Appl. Comput. Harmon. Anal. 14 (2003), no. 3, 257–275. MR 1984549

    2003

  30. [38]

    1, 83–112

    Richard Vale and Shayne Waldron, Tight frames and their symmetries , Constructive approximation 21 (2004), no. 1, 83–112. ABELIAN AND DIHEDRAL EQUIANGULAR TIGHT FRAMES OF REDUNDANCY 2 31

    2004

  31. [39]

    5, 1097–1120

    , The construction of g-invariant finite tight frames , Journal of Fourier Analysis and Applications 22 (2016), no. 5, 1097–1120

    2016

  32. [40]

    Shayne F. D. Waldron, An introduction to finite tight frames, Applied and Numerical Harmonic Analysis, Birkh¨ auser/Springer, New York, 2018. MR 3752185

    2018

  33. [41]

    2, 203–204

    Jennifer Wallis, A skew-Hadamard matrix of order 92 , Bulletin of the Australian Mathematical Society 5 (1971), no. 2, 203–204

    1971

  34. [42]

    Weibel, An introduction to homological algebra , Cambridge University Press, April 1994

    Charles A. Weibel, An introduction to homological algebra , Cambridge University Press, April 1994

    1994

  35. [43]

    Giannakis, Achieving the Welch bound with difference sets , IEEE Transactions on Information Theory 51 (2005), 1900–1907

    Pengfei Xia, Shengli Zhou, and Georgios B. Giannakis, Achieving the Welch bound with difference sets , IEEE Transactions on Information Theory 51 (2005), 1900–1907

    2005

  36. [44]

    Zauner, Quantum designs—foundations of non-commutative theory of designs , Ph.D

    G. Zauner, Quantum designs—foundations of non-commutative theory of designs , Ph.D. thesis, Ph. D. thesis, University of Vienna Vienna, 1999. Department of Computer Science, Holon Institute of Technology Email address : benavr@hit.ac.il Department of Mathematics and Statistics...

    1999

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.