R. Ahlswede and G. Dueck, Identification via channels, IEEE Trans. Inform. Theory {\bf 35} (1989), no.~1, 15--29; MR 90j:94022a
G. Dueck and L. Wolters, The Slepian\mhy Wolf theorem for individual sequences, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 14} (1985), no.~6, 437--450; MR 88b:94007
G. Dueck and V. M\"oller, Expurgated error bounds for concatenated codes, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 15} (1986), no.~2, 129--147; MR 87k:94022
G. Dueck and L. Wolters, Ergodic theory and encoding of individual sequences, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 14} (1985), no.~5, 329--345; MR 87j:94005
G. Dueck, The zero error feedback capacity region of a certain class of multiple-access channels, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 14} (1985), no.~2, 89--103; MR 86j:94040
R. Ahlswede and G. Dueck, Bad codes are good ciphers, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 11} (1982), no.~5, 337--351; MR 85c:94023
R. Ahlswede and G. Dueck, Good codes can be produced by a few permutations, IEEE Trans. Inform. Theory {\bf 28} (1982), no.~3, 430--443; MR 83k:94017
G. Dueck, The strong converse of the coding theorem for the multiple-access channel, J. Combin. Inform. System Sci. {\bf 6} (1981), no.~3, 187--196; MR 83g:94020
G. Dueck, A note on the multiple access channel with correlated sources, IEEE Trans. Inform. Theory {\bf 27} (1981), no.~2, 232--235; MR 82j:94015
G. Dueck, Partial feedback for two-way and broadcast channels, Inform. and Control {\bf 46} (1980), no.~1, 1--15; MR 82a:94060
G. Dueck, The capacity region of the two-way channel can exceed the inner bound, Inform. and Control {\bf 40} (1979), no.~3, 258--266; MR 81i:94009
P. R. King, G. V. Cormack and G. Dueck, Maps as concrete data structures, in {\it Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing (Univ. Manitoba, Winnipeg, Man., 1978)}, 329--342, Congress. Numer., XXII, Utilitas Math., Winnipeg, Man., 1979; MR 80h:68014
G. Dueck and J. K\"orner, Reliability function of a discrete memoryless channel at rates above capacity, IEEE Trans. Inform. Theory {\bf 25} (1979), no.~1, 82--85; MR 80e:94011
G. Dueck, Maximal error capacity regions are smaller than average error capacity regions for multi-user channels, Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform. {\bf 7} (1978), no.~1, 11--19; MR 80a:94026
R. Ahlswede and G. Dueck, Every bad code has a good subcode: a local converse to the coding theorem, Z. Wahrsch. Verw. Gebiete {\bf 34} (1976), no.~2, 179--182; MR {\bf 57} \#19086
G. Dueck and T. Scheuer, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, J. Comput. Phys. {\bf 90} (1990), no.~1, 161--175; CNO CMP 1 070 475
Hauptseite
main site