Combinatorics of singly-repairable families

MaRDI QIDQ2583659zbMATH OpenFDO

Authors Amitabha Roy, Eugene M. Luks

Publication date 17 January 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125586, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r59.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Error correcting codesFault-tolerant solution of scheduling problems

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorics in computer science (68R05) Bounds on codes (94B65)

Review text

The set \({\mathcal F}\) of binary \(n\)-vectors is called a single-repairable family, if no two vectors are closer then Hamming distance two and for every vector \(f\in {\mathcal F}\) and any coordinate \(i\in \{1,\dots ,n\}\) there is another vector \(g\in {\mathcal F}\) such that \(d(f,g)=2\) and their \(i\)th coordinates are different. The paper constructs such families and proves tight lower and upper bounds for maximum families. The problem is arising in the context of fault-tolerant solutions of scheduling problems.

Recommendations

• On codes identifying sets of vertices in Hamming spaces
• Uniform switching system by families of switching sets
• scientific article; zbMATH DE number 4135867
• Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes
• Intersecting codes and independent families

This page was built for publication: Combinatorics of singly-repairable families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583659)