We extend the notion of a minor from matroids to simplicial complexes. We show that the class of matroids, as well as the class of independence complexes, is characterized by a single forbidden minor. Inspired by a recent result of Aharoni and Berger, we investigate possible ways to extend the matroid intersection theorem to simplicial complexes.

This paper presents a new method for designing totally self-checking (TSC) Berger code checkers for any number k of information bits, even for k"2r~1, taking into account realistic faults as stuck-at, transistor stuck-open, transistor stuck-on and resistive bridging faults. Doubleas well as single-output TSC checkers are given. The proposed single-output TSC Berger code checkers are the "rst in...

q–ary codes capable of correcting all unidirectional errors of certain level 1 ≤ l ≤ q − 2 are considered. We also discuss some related extremal combinatorial problems.

We give efficient constructions for error correcting unordered {ECU) codes, i.e., codes such that any pair of codewords are at a certain minimal distance apart and at the same time they are unordered. These codes are used for detecting a predetermined number of (symmetric) errors and for detecting all unidirectional errors. We also give an application in parallel asynchronous communications.