Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2717190
Jump to:navigation, search

zbMath0989.94035MaRDI QIDQ2717190

David B. Jaffe, Alexander Barg

Publication date: 10 July 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingbinary linear codesbounds for codes


Mathematics Subject Classification ID

Linear programming (90C05) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)


Related Items (5)

On the high density behavior of Hamming codes with fixed minimum distance ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ One more proof of the first linear programming bound for binary codes and two conjectures ⋮ On the optimum of Delsarte's linear program ⋮ Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2717190&oldid=15572621"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 13:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki