### Multi-covering radius for rank metric codes.

Vasantha, W.B., Selvaraj, R.S. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Vasantha, W.B., Selvaraj, R.S. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Haas, Wolfgang, Quistorff, Jörn (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)

Open Mathematics

Similarity:

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.

Kéri, Gerzson, Östergård, Patric R.J. (2006)

Journal of Integer Sequences [electronic only]

Similarity:

King, Oliver D. (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Haas, Wolfgang, Halupczok, Immanuel, Schlage-Puchta, Jan-Christoph (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Haas, Wolfgang (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Quistorff, Jörn (2000)

Beiträge zur Algebra und Geometrie

Similarity:

Haas, Wolfgang (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Joyner, David (2006)

Integers

Similarity:

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Zhengan Huang, Shengli Liu, Baodong Qin, Kefei Chen (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Fehr et al. (2010) proposed the first sender-equivocable encryption scheme secure against chosen-ciphertext attacks (NCCCA) and proved that NC-CCA security implies security against selective opening chosen-ciphertext attacks (SO-CCA). The NC-CCA security proof of the scheme relies on security against substitution attacks of a new primitive, the “crossauthentication code”. However, the security of the cross-authentication code cannot be guaranteed when all the keys used in the code are...

Ellis, Robert B., Yan, Catherine H. (2004)

International Journal of Mathematics and Mathematical Sciences

Similarity: