𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortening Array Codes and the Perfect -Factorization Conjecture

✍ Scribed by Bohossian, V.; Bruck, J.

Book ID
114641186
Publisher
IEEE
Year
2009
Tongue
English
Weight
257 KB
Volume
55
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A partial result about the factorization
A partial result about the factorization conjecture for finite variable-length codes
✍ Clelia De Felice πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 966 KB

We construct a family of finite maximal codes over the alphabet {u. h} which verify the factorization conjecture on codes proposed by Schiitzenberger. This family contains any finite maximal code with at most three occurrences of the letter b by word.

On the strong perfect graph conjecture
On the strong perfect graph conjecture
✍ Stephan Olariu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 384 KB

A graph G is perfect if for every induced subgraph H of G the chromatic number x(H) equals the largest number w ( H ) of pairwise adjacent vertices in H. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement C contains an odd cho

Perfect codes and the Mathieu groups
Perfect codes and the Mathieu groups
✍ E. F. Assmus; H. F. Mattson πŸ“‚ Article πŸ“… 1966 πŸ› Springer 🌐 English βš– 857 KB
Even pairs and the strong perfect graph
Even pairs and the strong perfect graph conjecture
✍ Stefan Hougardy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 130 KB

We will characterize all graphs that have the property that the graph and its complement are minimal even pair free. This characterization allows a new formulation of the Strong Perfect Graph Conjecture. The reader is assumed to be familiar with perfect graphs (see e.g. [2]). A hole is a cycle of l