The following problem motivated by investigation of databases is studied. Let $$ \mathcal{C} $$ be a q-ary code of length n with the properties that $$ \mathcal{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 qare determined.
Contents
-
February 26, 2008
-
Open AccessLinear gradings of polynomial algebrasFebruary 26, 2008
-
February 26, 2008
-
February 26, 2008
-
February 26, 2008
-
Open AccessLimit theorems in free probability theory IIFebruary 26, 2008
-
February 26, 2008
-
Open AccessHolomorphic triples of genus 0February 26, 2008
-
Open AccessVector bundles on Hirzebruch surfaces whose twists by a non-ample line bundle have natural cohomologyFebruary 26, 2008
-
February 26, 2008
-
Open AccessOn the exact values of coefficients of coifletsFebruary 26, 2008
-
February 26, 2008
-
February 26, 2008
-
Open AccessRelatively pseudocomplemented Hilbert algebrasFebruary 26, 2008