Zero-error capacities and very different sequences

G. Cohen, J. Körner and G. Simonyi
Additional contact information
G. Cohen: ENST
J. Körner: ENST
G. Simonyi: ENST

A chapter in Sequences, 1990, pp 144-155 from Springer

Abstract: Abstract Perfect hash functions, superimposed codes as well as some other fashionable questions in computer science and random-access communication are special cases of early-day information theoretic models in the zero-error case. A new class of problems in asymptotic combinatorics can be formulated as the determination of the zero-error capacity of a class of discrete memoryless channels. (This model is also known as the compound channel). We solve an interesting class of these problems using our recent results in polyhedral combinatorics.

Keywords: Perfect Graph; Large Cardinality; Complete Subgraph; Compound Channel; Input Alphabet (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_11

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().