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

Linear programming bounds for codes of small size

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

DOI10.1006/eujc.1996.0129zbMath0983.94055OpenAlexW1998657826MaRDI QIDQ1367593

Ilia Krasikov, Simon N. Litsyn

Publication date: 21 April 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/26051fbba4b66f23f9ad481728b78ed3991954df


zbMATH Keywords

linear programmingconstant weight codesTietäväinen bound


Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65)


Related Items (2)

Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces ⋮ Bounds for codes by semidefinite programming




This page was built for publication: Linear programming bounds for codes of small size

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