Linear Programming Bounds.

Peter Boyvalenkov, Danyo Danev

Type: Preprint

Publication Date: 2019-03-06

Citations: 0

Similar Works

Action	Title	Year	Authors
+	Linear Programming Bounds	2019	Peter Boyvalenkov Danyo Danev
+	Linear Programming Upper Bounds	2012	Fabian Lim Manabu Hagiwara
+	Linear Programming	2006	L. N. Vaserstein
+	The linear programming bound	2001	Thomas Ericson Victor Zinoviev
+	Linear Programming.	1964	J. F. Hart G. Hadley
+	Linear Programming.	1984	Michael D. Todd Vašek Chvátal
+	Linear Programming.	1969	P. N. Wahi Bela Kreko J. H. L. Ahrens Carolyn M. Safe
+	Linear Programming.	1971	P. N. Wahi Saul I. Gass
+	Linear Programming	2011	Bernhard Körte Jens Vygen
+	Linear Programming	2002	Bernhard Körte Jens Vygen
+	Linear Programming	2000	Bernhard Körte Jens Vygen
+	Linear Programming	2018	Bernhard Körte Jens Vygen
+	Linear Programming	2011	David P. Williamson David B. Shmoys
+	Linear Programming	2005
+	Linear Programming Algorithms	2005
+	Linear Programming Algorithms	2007
+	Linear Programming Algorithms	1997	Yinyu Ye
+	Linear Programming	2005	Alan Lyles
+ PDF Chat	Theory of Linear and Integer Programming.	1987	David K. Smith Alexander Schrijver
+	4. Theory of Linear Programming	1957	A. J. Goldman A. W. Tucker

Action	Title	Year	Authors

Action	Title	Year	Authors
+	Covering radius and dual distance	1991	Aimo Tietäväinen
+	A bound on Grassmannian codes	2006	Alexander Barg Dmitry Nogin
+ PDF Chat	Universal Lower Bounds for Potential Energy of Spherical Codes	2016	Peter Boyvalenkov Peter D Dragnev Douglas P. Hardin Edward B. Saff Maya Stoyanova
+	On maximal codes in polynomial metric spaces	1997	Peter Boyvalenkov Danyo Danev
+	Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces	1999	Peter Boyvalenkov Silvia Boumova Danyo Danev
+	Designs as maximum codes in polynomial metric spaces	1992	V.I. Levenshtein
+	Tight Spherical Disigns, II	1980	Eiichi Bannaĭ R. M. Damerell
+	Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications	1999	V.I. Levenshtein
+ PDF Chat	Tight spherical designs, I	1979	Eiichi Bannaĭ R. M. Damerell
+	The Covering Radius of Spherical Designs	1991	Patrick Solé