University of Cambridge > > Communications Research Group Seminar > Density Evolution for SUDOKU Codes on the Erasure Channel

Density Evolution for SUDOKU Codes on the Erasure Channel

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jossy Sayir.

Codes based on SUDOKU puzzles are discussed, and belief propagation decoding introduced for the erasure channel. Despite the non-linearity of the code constraints, it is argued that density evolution can be used to analyse code performance due to the invariance of the code under alphabet permutation. The belief propagation decoder for erasure channels operates by exchanging messages containing sets of possible values. Accordingly, density evolution tracks the probability mass functions of the set cardinalities. The equations governing the mapping of those probability mass functions are derived and calculated for variable and constraint nodes, and decoding thresholds are computed for long SUDOKU codes with random interleavers.

This talk is a pre-view of a talk to be delivered at the Turbo Coding Symposium next week

This talk is part of the Communications Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity