Coding I: Network Coding
Organizers: Muriel Medard, Ralf Koetter
Wednesday AM, Chair: Muriel Medard, MIT
| Author(s): |
Title: |
| Peter Sanders, MPI Informatik, Germany Sebastian Egner,Philips Research, The Netherlands , Ludo Tolhuizen Philips Research, The Netherlands |
Polynomial time algorithms for multicast network code construction |
| Meir Fedr, Tel Aviv University Elona Erez, Tel Aviv University Ami Tavory, Tel Aviv University |
Bounds on Codes for Network Multicast |
| April Rasala Lehman, MIT Eric Lehman, MIT |
Complexity Classification of Network Information Flow Problems |
| Tracey Ho, MIT Muriel Medard, MIT |
On randomised Network coding |
| Muriel Medard, MIT Michelle Effros, Caltech |
On coding for non-multicast networks |
| Richard Wesel, UCLA Jun Shi, UCLA Aditya Ramamoorthy, UCLA |
On the Capacity of Network Coding for Random Networks |
| Philip A. Chou, Microsoft Research Yunnan Wu, Phil Chou, Kamal Jain |
Practical Network Coding |
Coding II: Coding Techniques
Organizers: Richard E. Blahut, Pascal Vontobel, Ralf Koetter
Wednesday PM, Chair: TBA
| Author(s): |
Title: |
| G. David Forney, MIT |
On the role of MMSE estimation in approaching the information- theoretic
limits of linear Gaussian channels: Shannon meets Wiener |
| Marc Fossorier, University of Hawaii, Kazukuni Kobara, University of Tokyo Hideki Imai, University of Tokyo |
On the Vulnerability of McEliece Crypto-Systems under Iterative Decoding Attack |
| Jorn Justesen, Technical University
of Denmark |
Near Maximum Likelihood Decoding of Products of Extended Hamming Codes |
| Hans-Andrea Loeliger, Swiss Federal
Institute of Technology |
LFSR Synchronization by Message Passing on Graphs with Short Cycles |
| Paul Siegel, UCSD |
On distribution shaping codes for partial-response
channels |
| Madhu Sudan, MIT |
Locally Testable Codes |
| Author(s): | Title: |
| Alexander Vardy, UCSD, Tao Jiang, University of Miami |
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes |
| Ramarathnam Venkatesan, Microsoft
Research |
Efficient Codes via Cryptographic Assumptions |
| Venkatesan Guruswami, University
of Washington |
Efficiently Decodable Codes meeting Gilbert-Varshamov
Bound for Low Rates |
| Martin Wainwright, Berkeley Michael Jordan, Berkeley |
Variational inference: exponential families
and marginal polytopes. |
| Jonathan Feldman, MIT Martin Wainwright, Berkeley David Karger, MIT |
LP Decoding |
| Eran Sharon, Tel Aviv University Alexei Ashikhmin, Lucent Bell Labs Simon Litsyn, Tel Aviv University |
EXIT Functions for the Gaussian Channel |
| Author(s): |
Title: |
| Alexander Barg, DIMACS Gilles Zemor, ENST |
More properties of expander codes |
| Joachim Rosenthal, Notre Dame, Christine Kelley, Notre Dame, Deepak Sridhara, Notre Dame |
Some new Algebraic Constructions of Codes from
Graphs which are Good Expanders. |
| Amin Shokrollahi, EPFL |
Fountain Codes |
| Daniel J. Costello, Notre Dame, Ching He, Notre Dame, Axel Huebner, Notre Dame, Kamil Zigangirov, Notre Dame |
Joint Interleaver Design for Low Complexity Multiple Turbo Codes |
| Frank R. Kschischang, University of Toronto Andrew W. Eckford, University of Toronto |
Low-Density Parity-Check Codes for the Gilbert-Elliott
Channel |
| Jonathan Yedidia, MERL
Cambridge Research Emin Martinian, MIT |
Data Compression Using Codes on Graphs |
Coding V: Analysis of Iterative Coding
Organizers: Richard E. Blahut, Pascal Vontobel, Ralf Koetter
Friday AM, Chair: TBA
| Author(s): |
Title: |
| Sekhar Tatikonda, Yale |
When Does the Sum-Product Algorithm Work? |
| Ruediger Urbanke, EPFL Abdelaziz Amraoui, EPFL Andrea Montanari, ENS Tom Richardsonm, Flarion |
Finite-Length Scaling for Iterative Coding Systems |
| David Burshtein, Tel-Aviv University Amir Bennatan, Tel-Aviv University |
Iterative Decoding of LDPC Codes over Arbitrary Discrete-Memoryless Channels
|
| Thomas Richardson, Flarion Tech
|
Error Floors of LDPC codes |
| Author(s): |
Title: |
| Uri Erez, MIT Stephan ten Brink, Realtek |
Approaching the dirty paper limit for canceling
known interference |
| Amir Bennatan, Tel-Aviv University David Bursthein, Tel-Aviv University Giuseppe Caire, Institut Eurecom Shlomo Shamai, Technion |
Coding Schemes for Dirty Paper Problems |
| Aaron Cohen, Brown University Ram Zamir, Tel-Aviv University |
Difference Set Noise and Applications to Side
Information Problems |
| K. Solanki, UC Santa Barbara O. Dabeer, UC Santa Barbara U. Madhow, UC Santa Barbara B. S. Manjunath, UC Santa Barbara S. Chandrasekaran, UC Santa Barbara |
Robust Image-Adaptive Data Hiding: Modeling, Source Coding and Channel Coding |
| Kannan Ramchandran, Berkeley Sandeep Pradhan, University of Michigan Vinod Prabhakaran, Berkeley |
On the role of side-information coding for the
source-channel Gaussian broadcast problem |