Multi-covering radius for rank metric codes.
Vasantha, W.B., Selvaraj, R.S. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Lower bounds for the football pool problem for 7 and 8 matches.”
Multi-covering radius for rank metric codes.
On codes with given minimum distance and covering radius.
Quistorff, Jörn (2000)
Beiträge zur Algebra und Geometrie
Similarity:
On mixed codes with covering radius 1 and minimum distance 2.
Haas, Wolfgang, Quistorff, Jörn (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of inequivalent optimal covering codes.
Kéri, Gerzson, Östergård, Patric R.J. (2006)
Journal of Integer Sequences [electronic only]
Similarity:
Dimension of indiscernibility equivalences
Jiří Sgall, Jiří Witzany (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Some new lower bounds for ternary covering codes.
Habsieger, Laurent (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Covering codes for Hats-on-a-line.
Aravamuthan, Sarang, Lodha, Sachin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bounds for DNA codes with constant GC-content.
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some remarks on the Plotkin bound.
Quistorff, Jörn (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the failing cases of the Johnson bound for error-correcting codes.
Haas, Wolfgang (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: