A new proof of a generalization of Gerzon's bound

DOI10.1007/S10998-020-00372-9MaRDI QIDQ2043727zbMATH OpenOpenAlexFDO

Authors Gábor Hegedüs

Publication date 3 August 2021

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2004.02240

zbMATH Keywords

distance problemGerzon's boundlinear algebra bound method

Mathematics Subject Classification ID

Real and complex fields (12D99) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• A generalization of Gerzon's bound on spherical \(s\)-distance sets
• Spectral approach to linear programming bounds on codes
• scientific article; zbMATH DE number 3885791
• A simple proof of the improved Johnson bound for binary codes
• Improved Delsarte bounds for spherical codes in small dimensions

Cites work

• Bounds on sets with few distances
• Equiangular lines
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Large equiangular sets of lines in euclidean space
• Spherical codes and designs
• Spherical two-distance sets
• Upper bounds for \(s\)-distance sets and equiangular lines

Cited in

(4)

• New bounds in Balog-Szemerédi-Gowers theorem
• A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
• A new proof and generalizations of Gearhart’s theorem
• A new proof of a generalization of Gerzon's bound

This page was built for publication: A new proof of a generalization of Gerzon's bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043727)