NetCod 2005

First Workshop on Network Coding, Theory, and Applications

April 7, 2005, Riva del Garda, Italy

(in conjunction with WiOpt 2005)

Multiuser information theory has been an important research area since the 1970’s. In the past few years, there has been a surge in research activities in the area due to its potential applications to communication networks. In particular, the recent theory of network coding reveals the surprising fact that unlike what was believed in the past, information should not be regarded as a commodity in a network. Since its inception, network coding has emerged as a new paradigm that has influenced information and coding theory, networking, wireless communications, computer science, graph theory, and matrix theory.

NETCOD 2005 will be organized around the following themes:

Network Coding Theory and Algorithms
Multiuser Information Theory
Applications of Network Coding

Special consideration will be given to these themes as they relate to Mobile, Ad Hoc, and Wireless Networks.

Important Dates

Submission deadline:	December 17, 2004
Notification date:	January 28, 2005
Camera-ready due:	~~February 18, 2005~~ extended to February 25, 2005
Registration deadline:	March 3, 2005

Keynote Speaker

Jean-Yves Le Boudec (Ecole Polytechnic Fédérale de Lausanne)

Invited Speakers

Ralf Koetter (University of Illinois)

Muriel Médard (Massachusetts Institute of Technology)

Ken Zeger (University of California, San Diego)

Program

07:30 – 08:00. Registration open.

08:00 – 08:10. Opening remarks. Raymond Yeung.

08:10 – 09:10. Keynote. Jean-Yves Le Boudec, The optimal MAC layer for low power UWB networks is with independent channels and no power control.

09:10 – 10:50. Session I. Chair: Ken Zeger.

· Invited talk. Ralf Koetter. On the non-multicast case.

· X. Yan, J. Yang, and Z. Zhang, An improved outer bound for multisource multisink network coding.

· N. Ratnakar and G. Kramer, The multicast capacity of acyclic, deterministic, relay networks with no interference.

· R. Khalili and K. Salamatian, On the capacity of multiple input erasure relay channels.

10:50 – 11:10. Coffee break.

11:10 – 01:10. Session II. Chair: Murial Médard.

· Invited talk. Ken Zeger. Unachievability of network coding capacity. (with R. Dougherty and C. Freiling)

· E. Erez and M. Feder, Convolutional network codes for cyclic networks.

· S. Riis and R. Alswede, Problems in network coding and error correcting codes.

· K. Bhattad and K. R. Nayayanan, Weakly secure network coding.

· N. Sarshar and X. Wu, Statistical mechanics of optimal networked source coding.

1:10 – 2:30. Lunch.

2:30 – 4:10. Session III. Chair: Meir Feder.

· Invited talk. Muriel Médard. How good is random linear coding based distributed networked storage? (with S. Acedański, S. Deb, and R. Koetter)

· T. Ho, B. Leong, R. Koetter, and M. Médard, Distributed asynchronous algorithms for multicast network coding.

· D. S. Lun, M. Médard, and D. Karger, On the dynamic multicast problem for coded networks.

· T. Coleman, M. Médard, and M. Effros, Practical universal decoding for combined routing and compression in network coding.

4:10 – 4:30. Coffee break.

4:30 – 6:20. Session IV. Chair: Ralf Koetter.

· Y. Wu, V. Stanković, Z. Xiong, and S.-Y. Kung, On practical design for combined Slepian-Wolf and network coding.

· B. Ma and X. Wu, Maximum network flow of multiple description codes.

· Y. Sagduyu and A. Ephremides, Joint scheduling and wireless network coding.

· J. Widmer, C. Fragouli, and J.-Y. Le Boudec, Energy-efficient broadcasting in wireless ad-hoc networks.

· D. Petrović, K. Ramchandran, and J. Rabaey, Overcoming untuned radios in wireless networks with network coding.

6:20 – 6:30. Closing remarks.

Submission Guidelines

Submissions and final versions appearing in the workshop proceedings shall be 6 pages long in the IEEE double-column format. Submissions should be sent to pachou@microsoft.com by the submission deadline.

All accepted papers (poster and 20-minute oral presentations) should be prepared and submitted according to the instructions at http://www.wiopt.org/workshop_instructions.html.