On the permutation capacity of digraphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We extend several results of the third author and C. Malvenuto on graph-different permutations to the case of directed graphs and introduce new open problems. Permutation capacity is a natural extension of Sperner capacity from finite directed graphs to infinite digraphs. Our subject is combinatorial in nature, but can be equally regarded as zero-error information theory.
11 pages, no figures

Keywords

Combinatorics, Information Theory, 05D05; 05C69: 05C69; 94A24

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/168722

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0809.1522
 http://arxiv.org/abs/0809.1522

Collections

arXiv