scientific article; zbMATH DE number 1341365

DOI10.1002/(SICI)1520-6610(1999)7:5%3C316::AID-JCD2%3E3.0.CO;2-ZMaRDI QIDQ4262989zbMATH OpenFDO

Authors Peter Boyvalenkov, Danyo Danev, I. Landjev

Publication date 14 August 2000

Full work available at URL https://doi.org/10.1002/(SICI)1520-6610(1999)7:5%3C316::AID-JCD2%3E3.0.CO;2-Z

zbMATH Keywords

Lenvenshtein boundmaximal codesspherical codesstrongly regular graphstight spherical designs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)

Cites work

• Computing distance distributions of spherical designs
• Designs as maximum codes in polynomial metric spaces
• Graphs with Maximal Even Girth
• On rank 3 permutation groups
• Partially balanced incomplete block designs with two associate classes and two treatments per block
• Spherical codes and designs
• Strongly regular graphs having strongly regular subconstituents
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Tight spherical designs. I
• Tight Spherical Disigns, II
• Upper bounds on the minimum distance of spherical codes

Cited in

(18)

• A survey on spherical designs and algebraic combinatorics on spheres
• Complex spherical codes with three inner products
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
• Bounds for the sum of distances of spherical sets of small size
• Indexes of spherical codes
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Maximal circular codesversusmaximal codes
• scientific article; zbMATH DE number 1057745 (Why is no real title available?)
• Codes and designs
• scientific article; zbMATH DE number 800361 (Why is no real title available?)
• scientific article; zbMATH DE number 2237360 (Why is no real title available?)
• Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
• On 3-distance spherical 5-designs
• Energy bounds for weighted spherical codes and designs via linear programming
• Universal lower bounds for potential energy of spherical codes
• A method for proving nonexistence of spherical designs of odd strength and odd cardinality
• The Tietäväinen bound for spherical codes
• A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs

This page was built for publication:

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