A new proof of a generalization of Gerzon's bound

DOI10.1007/S10998-020-00372-9OpenAlexW3106635717MaRDI QIDQ2043727FDOQ2043727

Authors: Gábor Hegedüs 

Publication date: 3 August 2021

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

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

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

zbMATH Keywords

distance problemGerzon's boundlinear algebra bound method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Spherical codes and designs
• Large equiangular sets of lines in euclidean space
• Equiangular lines
• Spherical two-distance sets
• Bounds on sets with few distances
• Upper bounds for \(s\)-distance sets and equiangular lines

Cited In (4)

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

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)