✦ LIBER ✦

Covering machines

✍ Scribed by A.R. Calderbank

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 362 KB
Volume: 106-107
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90536-o

No coin nor oath required. For personal study only.

✦ Synopsis

Calderbank,

A.R., Covering machines, Discrete Mathematics 106/107 (1992) 105-110.

We construct 2-state covering machines from binary linear codes with a sufficiently rich subcode structure.

The goal is to trade multiple covering properties for increased redundancy. We explain why the expected covering properties of covering machines should be superior to those of codes obtained by iterating the ADS construction. If Ni(C) d N for at least one coordinate i, then C is said to have norm N. We define N(C) = min {N,(C)}, *=siszn (2) and we shall sometimes refer to N(C) as the norm of C. An [n, k]R code C for which N(C) G 2R + 1 is said to be normal, and coordinates i for which Ivi(C) = N(C) are called acceptable.

📜 SIMILAR VOLUMES

On-line machine covering

✍ Yossi Azar; Leah Epstein 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 130 KB

We consider the problem of scheduling a sequence of jobs on m parallel identical machines so as to maximize the minimum load over the machines. This situation corresponds to a case that a system which consists of the m machines is alive (i.e. productive) only when all the machines are alive, and the

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

Covering Ollie

✍ Barker, Freya;Alpha, Operation 📂 Fiction 📅 2019 🏛 Aces Press, LLC 🌐 English ⚖ 187 KB 👁 3 views

Covering posets

✍ Gerhard Behrendt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 811 KB

A pair (a, b) of elements of a partially ordered set (X, G) is called a covering pair if a C b and whenever x E X is such that n sx s b then x E {a, b}. The set C(X) of covering pairs can be partially ordered by (ea, b) S (a', b') if and only if (a, b) = (a', b') or b Sa'. The pose! ) is called the

Rolling cover means for covering a guide

Rolling cover means for covering a guideway for a sliding carriage of a machine tool : Frit Loehrer, Bswitzerlana assigned to Maag Gear-Wheel & Machine Company Limited

📂 Article 📅 1986 🏛 Elsevier Science ⚖ 87 KB

Simulating Turing machines on Maurer mac

Simulating Turing machines on Maurer machines

✍ J.A. Bergstra; C.A. Middelburg 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 293 KB

In a previous paper, we used Maurer machines to model and analyse micro-architectures. In the current paper, we investigate the connections between Turing machines and Maurer machines with the purpose to gain an insight into computability issues relating to Maurer machines. We introduce ways to simu