Publications by Ulrich Tamm

2008

U. Tamm: Size of Downsets in the Pushing Order and a Problem of Berlekamp
Discrete Applied Mathematics 156, no. 9, 2008, p. 1560 - 1566, ISSN: 0166-218X

U. Tamm: On perfect integer codes
Proceedings 2005 International Symposium on Information Theory, Adelaide, Australien, IEEE, 09/2005, p. 117 - 120, DOI 10.1109/ITA.2007.4357607
U. Tamm: Olinde Rodrigues and Combinatorics
memorial volume "Mathematics and Social Utopias in France: Olinde Rodrigues and His Times: Mathematics and Social Utopia", History of Mathematics vol 28, AMS, 2005, p. 119 - 130, ISBN/ISSN: 978-0-8218-3860-0

U. Tamm: Nonperfect shift codes
Proceedings 4th European-Asian Workshop on Coding and Information Theory, Viareggio, Italien, 10/2004, p. 43 - 46, ISBN/ISSN: 3-9807929-5-1
U. Tamm, A. de la Cruz Nogueiras: Algorithms for hardware data compression
Proceedings 4th European-Asian Workshop on Coding and Information Theory, Viareggio, Italien, 10/2004, p. 47 - 48, ISBN/ISSN: 3-9807929-5-1
U. Tamm: Compression and decompression algorithms
Algorithms of Informatics, Chapter 10, Scolar Publisher, 09/2004, p. 421 - 463

U. Tamm: On a problem of Berlekamp
Proceedings 2003 International Symposium on Information Theory, Yokohama, Japan, 07/2003, p. 41
U. Tamm: Communication complexity and data compression
Proceedings 3rd Asian-European Workshop on Coding and Information Theory, Kamogawa, Japan, 06/2003, p. 92 - 95, ISBN/ISSN: 4-902087-04-9, invited contribution
U. Tamm: The Berlekamp-Massey algorithm and Combinatorics
Proceedings International Workshop on Coding and Cryptography, WCC 2003, Versailles, (D. Augot, P. Charpin, and G. Kabatianski eds.), 2003, p. 433 - 443

U. Tamm: Orthogonal Polynomials in Information Theory
2002, habilitation treatise
U. Tamm: Lattice paths not touching a given boundary
Journal of Statistical Planning and Inference, 105(2), 2002, p. 433-448

U. Tamm: Communication complexity and orthogonal polynomials
Codes and Association Schemes (A. Barg and S. Litsyn eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 56, American Mathematical Society, 2001, p. 277-285
U. Tamm: Some aspects of Hankel matrices in Coding Theory and Combinatorics
The Electronic Journal of Combinatorics, 8, #A1, 2001, p. 31 pp.

U. Tamm: Communication complexity and association schemes
Proceedings 2000 International Symposium on Information Theory, Sorrento, 06/2000, p. 4