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

Slight improvements of the Singleton bound

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

DOI10.1016/j.disc.2004.06.001zbMath1058.94024OpenAlexW2045426922MaRDI QIDQ1887651

Jörn Quistorff

Publication date: 22 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.001


zbMATH Keywords

Singleton boundMDS code\(q\)-ary code\(A_q(n,d)\)


Mathematics Subject Classification ID

Bounds on codes (94B65)


Related Items (1)

Fundamentals of coding type problems



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
  • A note on upper bounds for minimum distance codes
  • Maximum distance<tex>q</tex>-nary codes
  • Orthogonal Arrays of Index Unity
  • Error-correcting codes over an alphabet of four elements
  • Bounds on codes over an alphabet of five elements


This page was built for publication: Slight improvements of the Singleton bound

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