Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Cardinality of height function’s range in case of maximally many rectangular islands - computed by cuts

100%

Horváth E., Šešelja B., Tepavčević A.

Open Mathematics

2013

tom 11

nr 2

296-307

We deal with rectangular m×n boards of square cells, using the cut technics of the height function. We investigate combinatorial properties of this function, and in particular we give lower and upper bounds for the number of essentially different cuts. This number turns out to be the cardinality of the height function’s range, in case the height function has maximally many rectangular islands.

Codes that attain minimum distance in every possible direction

64%

Katona G., Sali A., Schewe K.-D.

Open Mathematics

2008

tom 6

nr 1

1-11

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.

Ograniczanie wyników

2 Open Mathematics

1 Horváth E.

1 Katona G.

1 Sali A.

1 Schewe K.-D.

1 Tepavčević A.

1 Šešelja B.

1 2013

1 2008

Wyniki wyszukiwania

Cardinality of height function’s range in case of maximally many rectangular islands - computed by cuts

Codes that attain minimum distance in every possible direction