Some of you may have been inspired by the excellent performance of
probability propagation in loopy graphs for error-correcting decoding.
For those of you who are interested in coding, you may want to consider
submitting a paper to a special issue of the IEEE Trans. Info. Theory,
Codes on Graphs and Iterative Algorithms.
Brendan.
======================================================================
CALL FOR PAPERS
Special issue of the IEEE Transactions on Information Theory
CODES ON GRAPHS AND ITERATIVE ALGORITHMS
======================================================================
A special issue of the IEEE Transactions on Information Theory will be
devoted to the connections between graphical models, codes, and iterative
algorithms. Original research papers that make major contributions
to research on the application of iterative, graph-based algorithms to
decoding and other related detection and estimation problems are sought.
Iterative algorithms, such as belief propagation, turbo-decoding,
gradient search and variations of these, have proven to be extremely
successful in (approximately) solving various problems in communications.
This has led to a surge of research devoted to understanding and
exploiting the connection between codes on graphs and iterative
algorithms. One of the main goals of this research is to understand
why iterative algorithms work so well empirically on graphs with cycles.
Another emerging research direction is the efficient representation of
codes on graphs. Much promising research has also been devoted to joint
iterative, graph-based treatment of different tasks in a communication
system.
Papers for this special issue should relate to the developments described
in the previous paragraph. Expository papers, survey papers, research
papers and correspondence items are all welcome. Topics include, but are
not limited to, the following:
o Analysis of iterative algorithms in graphical models
o Realization complexity of graphical models for codes
o Graph-based constructions for codes
o Graphical models for sources, channels and signaling systems
that are suited for iterative algorithms
o Combined decoding and adaptive filtering/estimation using
graphical models
Prospective authors should follow the regular guidelines of these
Transactions, except that manuscripts should be submitted directly
to one of the following sites:
PAPER: ELECTRONIC:
Ralf Koetter www.cs.uwaterloo.ca/~frey/cgia.html
Coordinated Science Laboratory
University of Illinois
1308 W. Main St.
Urbana, Il, 61801
Electronic submission of manuscripts is encouraged. The deadline
for submission is December 15, 1999.
GUEST EDITORS
G. David Forney, Jr., Motorola, Inc.
Brendan J. Frey, University of Waterloo (co-Editor-in-Chief)
Ralf Koetter, University of Illinois at Urbana (co-Editor-in-Chief)
Robert J. McEliec, California Institute of Technology
Daniel Spielman, Massachussetts Institute of Technology
SCHEDULE
Deadline for submission of manuscripts: December 15, 1999
Final selection of papers to be published: August 15, 2000
Publication: February 2001
======================================================================
