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
Discussion
View source
View history
Purge
English
Log in

A new binary code of length 16 and minimum distance 3

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

DOI10.1016/J.IPL.2015.07.001zbMath1337.94108OpenAlexW828752629MaRDI QIDQ495687

Moshe Milshtein

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.07.001


zbMATH Keywords

combinatorial problemslower boundHamming distancebinary codeblock code


Mathematics Subject Classification ID

Combinatorial codes (94B25)


Related Items (2)

Constructing error-correcting binary codes using transitive permutation groups ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES




Cites Work

  • Unnamed Item
  • Unnamed Item




This page was built for publication: A new binary code of length 16 and minimum distance 3

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