www.PseudoCodewords.info
Workshop Announcement
Preliminary list of talks at
Linear Programming and Message-Passing Approaches to
High-Density Parity-Check Codes and High-Density Graphical Models
Tel Aviv University, Israel, March 1 - 2, 2010
David Burshtein
Iterative Approximate Linear Programming Decoding of
LDPC Codes with Linear Complexity
Michael Chertkov
On Dense Graphical Models and their Potential for Coding
Daniel J. Costello, Jr.
TBA
Ilan Dimnik and Yair Be'ery
TBA
Jacob Goldberger
A MIMO detector based on Gaussian tree approximation of a fully
connected graph
Warren J. Gross
Stochastic Decoding of LDPC Codes over GF(q)
Joakim G. Knudsen and Eirik Rosnes
TBA
Talya Meltzer, David Sontag, Amir Globerson, Tommi Jaakkola,
and Yair Weiss
Tightening LP Relaxations for MAP using Message Passing
Amir Leshem
Solving Integer Least Squares Problems using Reconstruction
from Projections and Redundant Information
Shu Lin
Iterative Decodable Codes: Algebraic Constructions
Olgica Milenkovic
TBA
Vitaly Skachek
Correcting a Fraction of Errors in Nonbinary Expander Codes with
Linear Programming
Samuel Ouzan and Yair Be'ery
Moderate-Density Parity-Check Codes
Ilya Poltorak, Dror Baron, and Deanna Needell
TBA
Stefan Ruzika, Akin Tanatmis, Horst W. Hamacher, Norbert Wehn,
Frank Kienle, and Mayur Punekar
TBA
Amnon Shashua
Convergent Message Passing Algorithms over Region Graphs
for Approximate MAP and Marginal Probability Estimation
Ori Shental
TBA
Pascal O. Vontobel
TBA
Tadashi Wadayama
TBA
Alex Yufit, Asi Lifshitz, and Yair Be'ery
Near ML Linear Programming Decoding of HDPC codes
We gratefully acknowledge the financial support by the following sponsors:
 |
|
Advanced Communication Center at the School of Electrical Engineering, Tel Aviv University, and the Faculty of Engineering, Tel Aviv University, Israel |
|
|
Center
for Mathematical and Computational Modelling A research center at the University of Kaiserslautern, Germany |
Last Modified: Friday, 23-Oct-2009 02:32:49 PDT