Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
de Caen, D. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Washiela Fish, Khumbo Kumwenda, Eric Mwambene (2011)
Open Mathematics
Similarity:
For any prime p, we consider p-ary linear codes obtained from the span over p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.
Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)
Open Mathematics
Similarity:
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.
Alon, Noga (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vanhove, Frédéric (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Caragiu, Mihai (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Delorme, C. (1999)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.
Soicher, Leonard H. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity: