. K. Bibliography-[-agj12-]-b, C. Aliabadi, V. Berrou, X. Gripon, and . Jiang, Learning sparse messages in networks of neural cliques, IEEE Trans. Neural Networks, 2012.

P. [. Averbeck, A. Latham, and . Pouget, Neural correlations, population coding and computation, Nature Reviews Neuroscience, vol.2, issue.5, pp.358-366, 2006.
DOI : 10.1038/nrn1888

. [. Abu-mostafa, Information theory, complexity and neural networks, IEEE Communications Magazine, vol.27, issue.11, pp.25-28, 1989.
DOI : 10.1109/35.41397

R. [. Atkinson and . Shiffrin, Human memory: A proposed system and its control processes, Psychology of Learning and Motivation, pp.89-195, 1968.

V. [. Aeron, M. Saligrama, and . Zhao, Information Theoretic Bounds for Compressed Sensing, IEEE Transactions on Information Theory, vol.56, issue.10, pp.5111-5130, 2010.
DOI : 10.1109/TIT.2010.2059891

V. [. Akcakaya and . Tarokh, Shannon-Theoretic Limits on Noisy Compressive Sampling, IEEE Transactions on Information Theory, vol.56, issue.1, pp.492-504, 2010.
DOI : 10.1109/TIT.2009.2034796

E. [. Baraniuk, R. Candès, M. Nowak, and . Vetterli, Compressive Sampling [From the Guest Editors], IEEE Signal Processing Magazine, vol.25, issue.2, pp.12-13, 2008.
DOI : 10.1109/MSP.2008.915557

M. [. Baron and . Duarte, Universal MAP estimation in compressed sensing, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2011.
DOI : 10.1109/Allerton.2011.6120245

]. H. Betvg08, A. Bay, T. Ess, L. Tuytelaars, and . Van-gool, Speeded-up robust features (SURF), Computer Vision and Image Understanding (CVIU), vol.110, issue.3, pp.346-359, 2008.

A. [. Berrou and . Glavieux, Near optimum error correcting coding and decoding: turbo-codes, IEEE Transactions on Communications, vol.44, issue.10, pp.1261-1271, 1996.
DOI : 10.1109/26.539767

G. [. Baddeley and . Hitch, Working memory The psychology of learning and motivation, volume VIII, pp.47-89

S. [. Baron, R. G. Sarvotham, and . Baraniuk, Bayesian Compressive Sensing Via Belief Propagation, IEEE Transactions on Signal Processing, vol.58, issue.1, pp.269-280, 2010.
DOI : 10.1109/TSP.2009.2027773

F. [. Borst and . Theunissen, Information theory and neural coding, Nature Neuroscience, vol.2, issue.11, pp.947-957, 1999.
DOI : 10.1038/14731

]. E. Can06 and . Candès, Compressive sampling, Proc. of the International Congress of Mathematicians, 2006.

]. E. Can08 and . Candès, The restricted isometry property and its implications for compressed sensing Compte Rendus de l, Academie des Sciences, Serie I, issue.346, pp.589-592, 2008.

L. Cruz, S. V. Buldyrev, S. Peng, D. L. Roe, B. Urbanc et al., A statistically based density map method for identification and quantification of regional differences in microcolumnarity in the monkey brain, Journal of Neuroscience Methods, vol.141, issue.2, pp.321-332, 2005.
DOI : 10.1016/j.jneumeth.2004.09.005

M. [. Candès, T. Rudelson, R. Tao, and . Vershynin, Error correction via linear programming, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.295-308, 2005.
DOI : 10.1109/SFCS.2005.5464411

T. [. Candès and . Tao, Decoding by Linear Programming, IEEE Transactions on Information Theory, vol.51, issue.12, pp.4203-4215, 2005.
DOI : 10.1109/TIT.2005.858979

J. [. Cover and . Thomas, Elements of Information Theory, 2006.

M. [. Candès and . Wakin, An Introduction To Compressive Sampling, IEEE Signal Processing Magazine, vol.25, issue.2, pp.21-30, 2008.
DOI : 10.1109/MSP.2007.914731

L. Aspremont and . Ghaoui, Testing the nullspace property using semidefinite programming, Math. Progr, 2010.

]. A. Aspremont and L. Ghaoui, Testing the nullspace property using semidefinite programming, Mathematical Programming, pp.123-144, 2011.

D. L. Donoho, A. Maleki, and A. Montanari, Message-passing algorithms for compressed sensing, 2009. 122 BIBLIOGRAPHY [Don06] D. L. Donoho. Compressed sensing, pp.1289-1306, 2006.
DOI : 10.1073/pnas.0909892106

]. B. Erm92 and . Ermrntrout, Complex dynamics in winner-take-all neural nets with slow inhibition, Neural Networks, vol.5, issue.3, pp.415-431, 1992.

S. [. Fletcher, V. Rangan, and . Goyal, Necessary and Sufficient Conditions for Sparsity Pattern Recovery, IEEE Transactions on Information Theory, vol.55, issue.12, pp.555758-5772, 2009.
DOI : 10.1109/TIT.2009.2032726

Z. [. Feng and . Zhang, The rank of a random matrix, Applied Mathematics and Computation, vol.185, issue.1, pp.689-694, 2007.
DOI : 10.1016/j.amc.2006.07.076

]. R. Gal62 and . Gallager, Low-density parity-check codes, IEEE Trans. Inf. Theory, vol.8, issue.1, pp.21-28, 1962.

C. [. Gripon and . Berrou, Sparse Neural Networks With Large Learning Diversity, IEEE Transactions on Neural Networks, vol.22, issue.7, pp.1087-1096, 2011.
DOI : 10.1109/TNN.2011.2146789

URL : https://hal.archives-ouvertes.fr/hal-00609246

C. [. Gripon and . Berrou, Nearly-optimal associative memories based on distributed constant weight codes, 2012 Information Theory and Applications Workshop, pp.269-273, 2012.
DOI : 10.1109/ITA.2012.6181790

URL : https://hal.archives-ouvertes.fr/hal-01056531

]. R. Gra06 and . Gray, Toeplitz and Circulant Matrices: A Review, 2006.

C. [. Grainger and . Whitney, Does the huamn mnid raed wrods as a wlohe?, Trends in Cognitive Sciences, vol.8, issue.2, pp.58-59, 2004.
DOI : 10.1016/j.tics.2003.11.006

URL : https://hal.archives-ouvertes.fr/hal-01441314

]. R. Ham50 and . Hamming, A mathematical theory of communication, Bell System Technical Journal, vol.29, pp.147-160, 1950.

]. M. Hay96 and . Hayes, Statistical Digital Signal Processing and Modeling, 1996.

]. S. Hay99 and . Haykin, Neural Networks: A Comprehensive Foundation, 1999.

]. S. Hay01 and . Haykin, Adaptive Filter Theory, 2001.

]. S. Hay05 and . Haykin, Cognitive radio: brain-empowered wireless communications, IEEE J. Sel. Areas in Commun, vol.23, issue.2, pp.201-220, 2005.

]. S. Hay09 and . Haykin, Communication Systems, 2009.

]. F. Hfyay, M. P. Herrmann, O. Friedlander, and . Yilmaz, Fighting the curse of dimensionality: Compressive sensing in exploration seismology, IEEE Signal Processing Magazine, vol.29, issue.3, pp.88-100

I. [. Mitola and J. G. Maguire, Cognitive radio: making software radios more personal, IEEE Personal Communications, vol.6, issue.4, pp.13-18, 1999.
DOI : 10.1109/98.788210

S. Jin and X. Gao, Tight lower bounds on the ergodic capacity of ricean fading MIMO channels, Proc. IEEE International Conference on Communications (ICC), pp.2412-2416, 2005.

Y. Jin, Y. Kim, and B. D. Rao, Limits on Support Recovery of Sparse Signals via Multiple-Access Communication Techniques, IEEE Transactions on Information Theory, vol.57, issue.12, pp.7877-7892, 2011.
DOI : 10.1109/TIT.2011.2170116

A. [. Jalali, R. Maleki, and . Baraniuk, Minimum complexity pursuit: Stability analysis, 2012 IEEE International Symposium on Information Theory Proceedings, 2012.
DOI : 10.1109/ISIT.2012.6283602

URL : http://arxiv.org/abs/1205.4673

. Trans, . Syst, C. S. Man, D. J. Lin, and . Costello, Error Control Coding, pp.49-60, 1988.

D. [. Lustig, J. M. Donoho, J. M. Santos, and . Pauly, Compressed Sensing MRI, IEEE Signal Processing Magazine, vol.25, issue.2, pp.72-82, 2008.
DOI : 10.1109/MSP.2007.914728

[. Li, F. Gao, G. Ge, and S. Zhang, Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves, IEEE Transactions on Information Theory, vol.58, issue.8, pp.5035-5041, 2012.
DOI : 10.1109/TIT.2012.2196256

]. Loe04 and . Loeliger, An introduction to factor graphs, IEEE Signal Processing Magazine, vol.21, issue.1, pp.28-41, 2004.

]. D. Low99 and . Lowe, Object recognition from local scale-invariant features, Proc. Seventh IEEE Int. Conf. on Computer Vision, pp.1150-1157, 1999.

]. W. Maa00 and . Maass, On the computational power of winner-take-all, Neural Computation, vol.12, issue.11, pp.2519-2535, 2000.

]. C. Mey01 and . Meyer, Matrix Analysis and Applied Linear Algebra, 2001.

]. G. Mil56 and . Miller, The magical number seven, plus or minus two: some limits on our capacity for processing information, Psychological Review, vol.63, issue.2, pp.81-97, 1956.

L. [. Moon and . Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

]. V. Mou97 and . Mountcastle, The columnar organization of the neocortex, Brain : a journal of neurology, vol.120, issue.4, pp.701-722, 1997.

W. [. Mcculloch and . Pitts, A logical calculus of the ideas immanent in nervous activity, Bulletin of Mathematical Biology, vol.5, issue.4, pp.115-133, 1943.

A. [. Merikoski and . Virtanen, Bounds for eigenvalues using the trace and determinant, Linear Algebra and its Applications, vol.264, pp.101-108, 1997.
DOI : 10.1016/S0024-3795(97)00067-0

R. [. Oyman, H. Nabar, A. J. Bölcskei, and . Paulraj, Tight lower bounds on the ergodic capacity of Rayleigh fading MIMO channels, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, pp.1172-1176, 2002.
DOI : 10.1109/GLOCOM.2002.1188380

D. [. Perfetti and . Bolger, The Brain Might Read That Way, Scientific Studies of Reading, vol.47, issue.3, pp.293-304, 2004.
DOI : 10.1037//0022-0663.91.3.415

]. Rad11 and . Rad, Nearly sharp sufficient conditions on exact sparsity pattern recovery, IEEE Trans. Inf. Theory, vol.57, issue.7, pp.4672-4679, 2011.

R. [. Richardson and . Urbanke, Modern Coding Theory, 2008.
DOI : 10.1017/CBO9780511791338

]. A. San03 and . Sandberg, Bayesian Attractor Neural Network Models of Memory

]. S. Sarvotham, D. Baron, and R. G. Baraniuk, Measurements vs. bits: Compressed sensing meets information theory, Proc. 44th Annual Allerton Conf. on Commun., Control, and Computing, pp.126-132, 2003.

]. C. Sha48 and . Shannon, A mathematical theory of communication, Bell System Technical Journal, vol.27, 1948.

F. [. Schwenker, G. Sommer, and . Palm, Iterative retrieval of sparsely coded associative memory patterns, Neural Networks, vol.9, issue.3, 1996.
DOI : 10.1016/0893-6080(95)00112-3

[. Stojnic, Explicit thresholds for approximately sparse compressed sensing via ? 1 -optimization, Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp.478-482, 2009.

J. Shihao, Y. Xue, and L. Carin, Bayesian compressive sensing, IEEE Trans. Signal Processing, vol.56, issue.6, pp.2346-2356, 2008.

M. [. Saligrama and . Zhao, Compressed sensing of autoregressive processes, Wavelets XIII, 2009.
DOI : 10.1117/12.826830

S. [. Taheri and . Vorobyov, Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis, IEEE Transactions on Signal Processing, vol.59, issue.2
DOI : 10.1109/TSP.2010.2091411

B. [. Versace and . Chandler, The brain of a new machine, IEEE Spectrum, vol.47, issue.12, p.47, 2010.
DOI : 10.1109/MSPEC.2010.5644776

]. M. Wai09 and . Wainwright, Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting, IEEE Trans. Inf. Theory, vol.55, issue.12, pp.5728-5741, 2009.

Y. Weiss, H. S. Chang, and W. T. Freeman, Learning compressed sensing, Proc. 45th Annual Allerton Conf. on Commun., Control, and Computing, 2007.

Y. Wang, D. Liu, and Y. Wang, Discovering the capacity of human memory, Brain and Mind, vol.4, issue.2, pp.189-198, 2003.
DOI : 10.1023/A:1025405628479

W. Wang, M. J. Wainwright, and K. Ramchandran, Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices, IEEE Transactions on Information Theory, vol.56, issue.6, pp.2967-2979, 2010.
DOI : 10.1109/TIT.2010.2046199

[. Kim and A. Lapidoth, On the log determinant of noncentral wishart matrices, Proc. IEEE Int. Symp. Inf. Theory (ISIT)

Y. [. Ying and . Zou, Linear transformations and Restricted Isometry Property, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.2961-2964, 2009.
DOI : 10.1109/ICASSP.2009.4960245

URL : http://arxiv.org/abs/0901.0541

V. [. Zhao and . Saligrama, On compressed blind de-convolution of filtered sparse processes, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, pp.4038-4041, 2010.
DOI : 10.1109/ICASSP.2010.5495759