DocumentCode :
3281453
Title :
On digraph-different permutations
Author :
Cohen, Gérard ; Fachini, Emanuela ; Körner, János
Author_Institution :
Comput. & Network Dept, ENST/CNRS, Paris
fYear :
2008
fDate :
7-10 Dec. 2008
Firstpage :
1
Lastpage :
3
Abstract :
We extend several results on graph-different permutations of the third author and C. Malvenuto to the case of directed graphs and introduce several new open problems. This problem area is the natural extension of Sperner capacity of directed graphs to the case of infinite graphs. Sperner capacity is the key tool in determining the zero-error capacity of compound channels in case of uninformed encoder and decoder.
Keywords :
channel capacity; channel coding; decoding; directed graphs; memoryless systems; Sperner capacity; compound channel; decoding; digraph-different permutation; directed graph; encoding; memoryless stationary channel; Application software; Channel capacity; Combinatorial mathematics; Computer networks; Computer science; Decoding; Electronic mail; Error correction; Information theory; Remuneration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-2068-1
Electronic_ISBN :
978-1-4244-2069-8
Type :
conf
DOI :
10.1109/ISITA.2008.4895579
Filename :
4895579
Link To Document :
بازگشت