Vincent Gripon's Homepage

Research and Teaching Blog

Random clique codes

V. Gripon, V. Skachek, W. J. Gross and M. Rabbat, "Random clique codes," in Proceedings of 7" International Symposium on Turbo Codes and Iterative Information Processing, Gothenburg, Sweden, pp. 121--125, August 2012.

A new family of associative memories based on sparse neural networks has been recently introduced. These memories achieve excellent performance thanks to the use of error-correcting coding principles. Based on these devices, we introduce a new family of codes termed clique codes. These codes are based on the cliques in balanced c-partite graphs describing associative memories. In particular, we study an ensemble of random clique codes, and prove that such ensemble contains asymptotically good codes. Furthermore, these codes can be efficiently decoded using the neural network-based associative memories with limited complexity and memory consumption. They offer a new interesting alternative to existing codes, in particular when the underlying channel is assumed to be a memoryless erasure channel.

Download manuscript.
Download presentation support.

  author = {Vincent Gripon and Vitaly Skachek and
Warren J. Gross and Michael Rabbat},
  title = {Random clique codes},
  booktitle = {Proceedings of 7" International
Symposium on Turbo Codes and Iterative Information
  year = {2012},
  address = {Gothenburg, Sweden},
  month = {August},
  pages = {121--125},

You are the 504784th visitor

Vincent Gripon's Homepage