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

scientific article

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

zbMath1296.94174MaRDI QIDQ3546840

Kolja Elssel, Karl-Heinz Zimmermann

Publication date: 21 December 2008


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

zbMATH Keywords

lower boundnonlinear codeserror-correction codescoset codeNordstrøm-Robinson code


Mathematics Subject Classification ID

Other types of codes (94B60)


Related Items (6)

On optimal binary codes with unbalanced coordinates ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Two new four-error-correcting binary codes ⋮ Efficient representation of binary nonlinear codes: constructions and minimum distance computation







This page was built for publication:

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