Rüdiger L. Urbanke - Publications

Book chapter

  1. Information theory, B. Rimoldi and R. Urbanke, CRC Handbook of Communication, in print.

Journal papers

  1. Bilinear time-frequency representations of signals: The shift-scale invariant class, R. Hlawatsch and R. Urbanke, IEEE Transactions on Signal Processing, 42 (February 1994), pp. 357-366.
  2. Smoothed pseudo-Wigner distribution, Choi-Williams distribution, and cone-kernel representation: Ambiguity-domai n analysis and experimental comparison, F. Hlawatsch, T. Manickam, R. Urbanke and B. Jones, EURASIP Signal Processing, 43 (1995), pp. 149-168.
  3. A counterexample to a Voronoi region conjecture, R. Urbanke and D. Agrawal, IEEE Transactions on Information Theory, July 1995, pp. 1195-1196.
  4. An algorithm to calculate the kernel of certain polynomial ring homomorphisms, F. Di Biase and R. Urbanke, Experimental Mathematics, 4 (1995), pp. 227-234.
  5. A rate-splitting approach to the Gaussian multiple-access channel, B. Rimoldi and R. Urbanke, IEEE Trans. on Information Theory, March 1996, pp. 364-375.
  6. Approach regions for trees and the unit disc, N. Arcozzi, F. Di Biase and R. Urbanke, J. Reine Angew. Math., 472 (1996), pp. 157-175.
  7. Lattice codes can achieve capacity on the AWGN channel, R. Urbanke and B. Rimoldi, accepted for publication in IEEE Trans. on Information Theory.
  8. Rate-splitting multiple access for discrete memoryless channels , A. Grant, B. Rimoldi, R. Urbanke and P. Whiting, submitted to IEEE Trans. on Information Theory.
  9. Twist points of the von Koch snowflake, F. Di Biase , B. Fischer and R. Urbanke, accepted, Proccedings of the AMS .
  10. Compact description of Golay sequences and their extensions, R. Urbanke and A. S. Krishnakumar, in preparation .
  11. On the ensemble performance of Turbo Codes , E. Telatar and R. Urbanke, in preparation .
  12. On the performance of Recursive Decoding Schemes , E. Soljanin and R. Urbanke, in preparation .

Conferences

  1. Coding for the F-Adder channel: Two applications for Reed-Solomon codes, R. Urbanke and B. Rimoldi, IEEE Intl. Symposium on Information Theory, San Antonio, Texas, January 1993, page 85.
  2. A new coding technique for the Gaussian multiple access channel at low SNR ratios, R. Urbanke and B. Rimoldi, Twenty-Eighth Annual Conference on Information Sciences and Systems, Princeton, NJ, March 1994.
  3. On single-user decodable codes for the Gaussian multiple access channel, B. Rimoldi and R. Urbanke, 1994 IEEE Intl. Symposium on Information Theory, Trondheim, Norway, June 27-July 1, 1994, page 55.
  4. On the cardinality of the group of permutations that commute with the Discrete Fourier Transform, R. Urbanke, Q. Li and B. Rimoldi, 32nd Allerton Conf. on Communication, Control, and Computing, Monticello, IL, Sept. 28-30, 1994.
  5. An algorithm to calculate the kernel of certain polynomial ring homomorphism, F. Di Biase and R. Urbanke, Abstracts of Papers Presented to the American Mathematical Society, San Francisco, CA, January 4-7, 1995, page 51.
  6. Single user decoding for the discrete multiple access channel, A. Grant, B. Rimoldi, R. Urbanke and P. Whiting, 1995 IEEE Intl. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, page 136.
  7. Lattice codes can achieve capacity on the AWGN channel, R. Urbanke and B. Rimoldi, 1995 IEEE Intl. Symposium on Information Theory, Whistler, Canada, September 17-22, 1995, page 448.
  8. Compact description of Golay sequences and their extensions, R. Urbanke and A. S. Krishnakumar, 34th Allerton Conf. on Communication, Control, and Computing, Monticello, IL, October 2-3, 1996.

Thesis

  1. On multiple-access communication , R. Urbanke, PhD thesis, Washington University, St. Louis, August 1995.