Combinatorics of singly-repairable families.

Luks, Eugene M.; Roy, Amitabha

Displaying similar documents to “Combinatorics of singly-repairable families.”

Minimal zero sequences of finite cyclic groups.

Ponomarenko, Vadim (2004)

Integers

Similarity:

Codes that attain minimum distance in every possible direction

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.

Gray codes for $A$ -free strings.

Squire, Matthew B. (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions.

Fonseca, Tiago, Zinn-Justin, Paul (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A generalisation of entity and referential integrity in relational databases

Mark Levene, George Loizou (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Entity and referential integrity are the most fundamental constraints that any relational database should satisfy. We re-examine these fundamental constraints in the context of incomplete relations, which may have null values of the types “value exists but is unknown” and “value does not exist”. We argue that in practice the restrictions that these constraints impose on the occurrences of null values in relations are too strict. We justify a generalisation of the said constraints wherein...