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

A new lower bound on the minimal length of a binary linear code

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

DOI10.1006/EUJC.1996.0028zbMath0851.94028OpenAlexW2050599192MaRDI QIDQ1916055

M. C. Bhandari, M. S. Garg

Publication date: 4 December 1996

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

Full work available at URL: https://doi.org/10.1006/eujc.1996.0028


zbMATH Keywords

lower boundsbinary linear codeminimal length


Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)








This page was built for publication: A new lower bound on the minimal length of a binary linear code

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