| Title | Codes that attain minimum distance in every possible direction |
| Publication Type | Journal Article |
| Authors | Katona, G. O. H., A. Sali, and K. D. Schewe |
| Journal title | Central European Journal of Mathematics |
| Year | 2008 |
| Pages | 1 - 11 |
| Volume | 6 |
| Issue | 1 |
| Abstract | The following problem motivated by investigation of databases is studied. Let C be a q-ary code of length n with the properties that C has minimum distance at least n – k + 1, and for any set of k – 1 coordinates there exist two codewords that agree exactly there. Let f(q, k) be the maximum n for which such a code exists. f(q, k) is bounded by linear functions of k and q, and the exact values for special k and q are determined. |
| Language | eng |
| Notes | exported from refbase (http://www.bibliography.ceu.hu/show.php?record=6263), last updated on Mon, 02 Nov 2009 12:26:06 +0100 |
| Publisher link | http://www.springerlink.com/content/x5472073j10j4026/fulltext.pdf |