Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Codes that attain minimum distance in every possible direction

Gyula KatonaAttila SaliKlaus-Dieter Schewe — 2008

Open Mathematics

The following problem motivated by investigation of databases is studied. Let 𝒞 be a q-ary code of length n with the properties that 𝒞 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 qare determined.

Page 1

Download Results (CSV)