N. Abramson, Cascade Decoding of Cyclic Product Codes, IEEE Transactions on Communications, vol.16, issue.3, pp.398-402, 1968.
DOI : 10.1109/TCOM.1968.1089859

M. Alipour, O. Etesami, G. Maatouk, and A. Shokrollahi, Irregular product codes, 2012 IEEE Information Theory Workshop, pp.197-201, 2012.
DOI : 10.1109/ITW.2012.6404656

M. Asteris and A. G. Dimakis, Repairable fountain codes, IEEE Proceedings of ISIT, 2012.

D. Augot, M. El-khamy, R. J. Mceliece, F. Parvaresh, M. Stepanov et al., Algebraic list decoding of Reed-Solomon product codes, Algebraic and Combinatorial Coding Workshop, pp.210-213, 2006.

E. Ar?kan, Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels, IEEE Transactions on Information Theory, vol.55, issue.7, pp.3051-3073, 2009.
DOI : 10.1109/TIT.2009.2021379

S. Benedetto and G. Montorsi, Unveiling turbo codes: some results on parallel concatenated coding schemes, IEEE Transactions on Information Theory, vol.42, issue.2, pp.409-428, 1996.
DOI : 10.1109/18.485713

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1, Proceedings of ICC '93, IEEE International Conference on Communications, pp.1064-1070, 1993.
DOI : 10.1109/ICC.1993.397441

C. Berrou and A. 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

E. Biglieri, Coding for Wireless Channels, 2005.

R. E. Blahut, Algebraic codes for data transmission, 2003.
DOI : 10.1017/CBO9780511800467

B. C. Bollobás12-]-r, D. K. Bose, and . Ray-chaudhuri, Modern graph theory On a class of error correcting binary group codes, Information and Control, vol.3, pp.68-79, 1960.

J. J. Boutros, O. Pothier, and G. Zémor, Generalized low density (Tanner) codes, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311), pp.441-445, 1999.
DOI : 10.1109/ICC.1999.767979

J. J. Boutros, G. Zémor, A. Guillén, and E. Biglieri, Full-diversity product codes for block erasure and block fading channels, 2008 IEEE Information Theory Workshop, pp.313-317, 2008.
DOI : 10.1109/ITW.2008.4578676
URL : http://repositori.upf.edu/bitstream/10230/20497/1/Boutros_itw08_1.pdf

J. J. Boutros, G. Zémor, A. Guillén, I. , and E. Biglieri, Generalized lowdensity codes with BCH constituents for full-diversity near-outage performance, IEEE International Symposium on Information Theory (ISIT), pp.787-791, 2008.
DOI : 10.1109/isit.2008.4595094
URL : https://hal.archives-ouvertes.fr/hal-00311848

J. J. Boutros, Diversity and coding gain evolution in graph codes Information Theory and Applications Workshop, pp.34-43, 2009.
DOI : 10.1109/ita.2009.5044920
URL : http://ita.calit2.net/workshop/09/files/paper/paper_31.pdf

J. J. Boutros, A. Guillén-i-f-`-abregas, E. Biglieri, and G. Zémor, Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4286-4300, 2010.
DOI : 10.1109/TIT.2010.2053890
URL : https://hal.archives-ouvertes.fr/hal-00270543

J. Boutros, V. Dedeoglu, and M. Bloch, The anti-diversity concept for secure communication on a two-link compound channel, Proc. International Zurich Seminar on Communications (IZS), pp.116-119, 2014.

A. R. Calderbank and N. Seshadri, Multilevel codes for unequal error protection, IEEE Transactions on Information Theory, vol.39, issue.4, pp.1234-1248, 1993.
DOI : 10.1109/18.243441

E. R. Canfield and B. D. Mckay, Asymptotic enumeration of integer matrices with constant row and column sums, Combinatorics, 2009.

J. Chakareski, S. Han, and B. Girod, Layered coding vs multiple descriptions for video streaming over multiple paths, ACM international conference on Multimedia, pp.422-431, 2003.
DOI : 10.1007/s00530-004-0162-3

J. H. Conway and R. K. Guy, The Book of Numbers, pp.94-96, 1996.
DOI : 10.1007/978-1-4612-4072-3

M. Lentmaier, A. Sridharan, K. Sh, D. J. Zigangirov, and . Costello, Terminated LDPC convolutional codes with thresholds close to capacity, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.1372-1376, 2005.
DOI : 10.1109/ISIT.2005.1523567
URL : http://arxiv.org/pdf/cs/0508030v1.pdf

C. Greenhill and B. D. Mckay, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, Advances in Applied Mathematics, vol.41, issue.4, pp.459-481, 2008.
DOI : 10.1016/j.aam.2008.01.002
URL : https://doi.org/10.1016/j.aam.2008.01.002

A. Datta and F. Oggier, An overview of codes Tailor-made for networked distributed data storage, 2011.
DOI : 10.1145/2447712.2447735

V. Dedeoglu and J. J. Boutros, Diversity-security tradeoff for compound channels, 2015 IEEE International Conference on Communications (ICC), 2015.
DOI : 10.1109/ICC.2015.7249028

C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, Finite-length analysis of low-density parity-check codes on the binary erasure channel, IEEE Trans. on Inf. Theory, vol.48, issue.6, pp.1570-1579, 2002.

A. G. Dimakis, B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, Network Coding for Distributed Storage Systems, IEEE Transactions on Information Theory, vol.56, issue.9, pp.4539-4551, 2010.
DOI : 10.1109/TIT.2010.2054295
URL : http://arxiv.org/pdf/cs/0702015

A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, A Survey on Network Codes for Distributed Storage, IEEE Proceedings, pp.476-489, 2011.
DOI : 10.1109/JPROC.2010.2096170
URL : http://users.ece.utexas.edu/~dimakis/rc_Ieeeproc.pdf

Q. Du and X. Zhang, On Rate Adaptation for Video Multicast with Layered Coding over Multirate Wireless Networks, IEEE GLOBECOM 2008, 2008 IEEE Global Telecommunications Conference, pp.1-5, 2008.
DOI : 10.1109/GLOCOM.2008.ECP.980

P. Elias, Error-free Coding, Transactions of the IRE Professional Group on Information Theory, vol.4, issue.4, pp.29-39, 1954.
DOI : 10.1109/TIT.1954.1057464

M. El-khamy and R. J. Mceliece, Iterative algebraic soft-decision list decoding of Reed-Solomon codes, IEEE Journal on Selected Areas in Communications, vol.24, issue.3, pp.481-490, 2006.
DOI : 10.1109/JSAC.2005.862399
URL : http://authors.library.caltech.edu/3533/1/ELKieeejsac06.pdf

K. S. Esmaili, L. Pamies-juarez, and A. Datta, CORE: Cross-object redundancy for efficient data repair in storage systems, 2013 IEEE International Conference on Big Data, pp.246-254, 2013.
DOI : 10.1109/BigData.2013.6691581

A. J. Felström and K. S. Zigangirov, Time-varying periodic convolutional codes with low-density parity-check matrix, IEEE Transactions on Information Theory, vol.45, issue.6, pp.2181-2191, 1999.
DOI : 10.1109/18.782171

D. F. Freeman and A. M. Michelson, A two-dimensional product code with robust soft-decision decoding, IEEE Transactions on Communications, vol.44, issue.10, pp.1222-1226, 1996.
DOI : 10.1109/26.539758

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1963.
DOI : 10.1109/TIT.1962.1057683

M. Ghanbari, Two-layer coding of video signals for VBR networks, IEEE Journal on Selected Areas in Communications, vol.7, issue.5, pp.771-781, 1989.
DOI : 10.1109/49.32340

P. Gopalan, A. R. Klivans, D. Zuckerman, P. Gopalan, V. Guruswami et al., List-decoding Reed?Muller codes over small fields List decoding tensor products and interleaved codes, 40th Annu. ACM Symp. Theory of Computing (STOC), pp.265-274, 2008.
DOI : 10.1137/090778274
URL : http://arxiv.org/pdf/0811.4395

P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, On the Locality of Codeword Symbols, IEEE Transactions on Information Theory, vol.58, issue.11, pp.6925-6934, 2012.
DOI : 10.1109/TIT.2012.2208937
URL : http://arxiv.org/pdf/1106.3625

A. Guillén, Coding in the Block-Erasure Channel, IEEE Transactions on Information Theory, vol.52, issue.11, pp.5116-5121, 2006.
DOI : 10.1109/TIT.2006.883556

A. Guillén-i-f-`-abregas and G. Caire, Coded modulation in the block-fading channel: coding theorems and code construction, IEEE Transactions on Information Theory, vol.52, issue.1, pp.91-114, 2006.
DOI : 10.1109/TIT.2005.860414

V. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999.
DOI : 10.1109/18.782097
URL : http://www.cs.washington.edu/homes/venkat/pubs/papers/rsag-jl.ps

T. Helleseth, T. Klove, and O. Ytrehus, Generalized Hamming weights of linear codes, IEEE Transactions on Information Theory, vol.38, issue.3, pp.1133-1140, 1992.
DOI : 10.1109/18.135655

W. Henkel, K. Hassan, N. Von-deetzen, S. Sandberg, L. Sassatelli et al., UEP concepts in modulation and coding Advances in Multimedia, p.416797, 2010.
DOI : 10.1155/2010/416797
URL : http://downloads.hindawi.com/journals/am/2010/416797.pdf

A. Hocquenghem, Codes correcteurs d'erreurs, Chiffres (Paris), vol.2, pp.147-156, 1959.

P. Huang, E. Yaakobi, H. Uchikawa, and P. H. Siegel, Cyclic linear binary locally repairable codes, 2015 IEEE Information Theory Workshop (ITW), pp.1-5, 2015.
DOI : 10.1109/ITW.2015.7133128

J. Jiang and K. R. Narayanan, Iterative Soft Decoding of Reed???Solomon Codes, IEEE Communications Letters, vol.8, issue.4, pp.244-246, 2004.
DOI : 10.1109/LCOMM.2004.827977
URL : http://www.tamu.edu/faculty/commtheory/papers/softRS_commletter04.pdf

J. Katz and L. Trevisan, On the efficiency of local decoding procedures for errorcorrecting codes, 32nd ACM Symposium on Theory of Computing (STOC), pp.80-86, 2000.

S. B. Korada, E. Sasoglu, and R. Urbanke, Polar Codes: Characterization of Exponent, Bounds, and Constructions, IEEE Transactions on Information Theory, vol.56, issue.12, pp.6253-6264, 2010.
DOI : 10.1109/TIT.2010.2080990

R. Knopp and P. A. Humblet, On coding for block fading channels, IEEE Transactions on Information Theory, vol.46, issue.1, pp.189-205, 2000.
DOI : 10.1109/18.817517

F. R. Kschischang, P. Codes, and J. G. Proakis, Wiley encyclopedia of telecommunications, pp.2007-2012, 2003.

F. R. Kschischang, B. J. Frey, and H. Loeliger, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory, vol.47, issue.2, pp.498-519, 2001.
DOI : 10.1109/18.910572

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton et al., Oceanstore: An architecture for global-scale persistent storage, 9th Int. Conf. on Architectural Support Programm, pp.190-201, 2000.

S. Kudekar, T. Richardson, and R. L. Urbanke, Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC, IEEE Transactions on Information Theory, vol.57, issue.2, pp.803-834, 2011.
DOI : 10.1109/TIT.2010.2095072
URL : http://arxiv.org/pdf/1001.1826

S. Kudekar, T. Richardson, and R. L. Urbanke, Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation, IEEE Transactions on Information Theory, vol.59, issue.12, pp.7761-7813, 2013.
DOI : 10.1109/TIT.2013.2280915
URL : http://arxiv.org/pdf/1201.2999.pdf

S. Kudekar, M. Mondelli, E. Sasoglu, and R. Urbanke, Reed-Muller codes achieve capacity on the binary erasure channel under MAP decoding, 2015.

S. Kumar and H. D. Pfister, Reed-muller codes achieve capacity on the quantum erasure channel, 2016 IEEE International Symposium on Information Theory (ISIT), 2015.
DOI : 10.1109/ISIT.2016.7541599

A. Lapidoth, Convolutional codes and finite interleavers for the block erasure channel, Lecture Notes in Computer Science, vol.783, pp.113-120, 2005.
DOI : 10.1007/3-540-57856-0_11

M. Lentmaier and G. P. Fettweis, On the thresholds of generalized LDPC convolutional codes based on protographs, 2010 IEEE International Symposium on Information Theory, pp.709-713, 2010.
DOI : 10.1109/ISIT.2010.5513595
URL : http://lup.lub.lu.se/search/ws/files/5929293/3731223.pdf

S. Lin and D. J. Costello, Error control coding, 2004.

M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, Practical loss-resilient codes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.150-159, 1997.
DOI : 10.1145/258533.258573
URL : http://www.cs.technion.ac.il/Labs/Lccn/projects/spring99/fastdl/docs/luby/losscode.ps

M. Luby, LT codes, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.271-282, 2002.
DOI : 10.1109/SFCS.2002.1181950

J. C. David and . Mackay, Information theory, inference, and learning algorithms, 2003.

F. J. Macwilliams and N. J. Sloane, The theory of error-correcting codes, 1977.

E. Malkamaki and H. Leib, Evaluating the performance of convolutional codes over block fading channels, IEEE Transactions on Information Theory, vol.45, issue.5, pp.1643-1646, 1999.
DOI : 10.1109/18.771235

B. Masnick, J. K. Wolf, and ]. E. Muller, On linear unequal error protection codes Application of Boolean algebra to switching circuit design and to error detection, IEEE Trans. on Inf. Theory Trans. on Electronic Computers of the I.R.E. Professional Group, vol.133, issue.4 3, pp.600-607, 1954.

F. Oggier and A. Datta, Self-repairing homomorphic codes for distributed storage systems, 2011 Proceedings IEEE INFOCOM, 2011.
DOI : 10.1109/INFCOM.2011.5934901
URL : http://arxiv.org/pdf/1008.0064.pdf

F. Oggier and A. Datta, Coding techniques for repairability in networked distributed storage systems, Foundations and Trends in Communications and Information Theory, pp.383-466, 2013.

G. C. Onwubolu and D. Davendra, Differential evolution: a handbook for global permutation-based combinatorial optimization, 2009.
DOI : 10.1007/978-3-540-92151-6

R. Pellikaan and X. Wu, List Decoding of<tex>$q$</tex>-ary Reed???Muller Codes, IEEE Transactions on Information Theory, vol.50, issue.4, pp.679-682, 2004.
DOI : 10.1109/TIT.2004.825043

H. Pishro-nik, N. Rahnavard, and F. Fekri, Nonuniform Error Correction Using Low-Density Parity-Check Codes, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2702-2714, 2005.
DOI : 10.1109/TIT.2005.850230

Y. Polyanskiy, H. V. Poor, and S. Verdú, Channel Coding Rate in the Finite Blocklength Regime, IEEE Transactions on Information Theory, vol.56, issue.5, pp.2307-2359, 2010.
DOI : 10.1109/TIT.2010.2043769
URL : http://www.princeton.edu/~verdu/reprints/PolPooVerMay2010.pdf

J. G. Proakis and M. Salehi, Digital Communications, 2008.

R. Pyndiah, Near-optimum decoding of product codes: block turbo codes, IEEE Transactions on Communications, vol.46, issue.8, pp.1003-1010, 1998.
DOI : 10.1109/26.705396

D. Rankin and T. A. Gulliver, Asymptotic performance of product codes, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311), pp.431-435, 1999.
DOI : 10.1109/ICC.1999.767977

K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, Explicit construction of optimal exact regenerating codes for distributed storage, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009.
DOI : 10.1109/ALLERTON.2009.5394538
URL : http://arxiv.org/pdf/0906.4913

K. V. Rashmi, N. B. Shah, and P. V. Kumar, Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction, IEEE Transactions on Information Theory, vol.57, issue.8, pp.5227-5239, 2011.
DOI : 10.1109/TIT.2011.2159049
URL : http://eecs.berkeley.edu/%7Erashmikv/papers/product_matrix_codes.pdf

K. V. Rashmi, N. B. Shah, D. Gu, H. Kuang, D. Borthakur et al., A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster, Proc. USENIX Hot- Storage, 2013.

V. Rathi, R. Urbanke, M. Andersson, and M. Skoglund, Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel, 2011 IEEE International Symposium on Information Theory Proceedings, pp.2393-2397, 2011.
DOI : 10.1109/ISIT.2011.6033992
URL : http://arxiv.org/pdf/1010.1669.pdf

S. R. Reddy and J. P. Robinson, Random error and burst correction by iterated codes, IEEE Transactions on Information Theory, vol.18, issue.1, pp.182-185, 1972.
DOI : 10.1109/TIT.1972.1054747

I. S. Reed, A class of multiple-error-correcting codes and the decoding scheme, Transactions of the IRE Professional Group on Information Theory, vol.4, issue.4, pp.38-49, 1954.
DOI : 10.1109/TIT.1954.1057465
URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=AD0025814&Location=U2&doc=GetTRDoc.pdf

I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.
DOI : 10.1137/0108018

T. Richardson, Multi-Edge Type LDPC Codes, " presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday (but not included in the proceedings), California Institute of Technology, 2002.

T. J. Richardson and R. L. Urbanke, Modern coding theory, 2008.
DOI : 10.1017/CBO9780511791338

E. Rosnes and O. Ytrehus, Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets, IEEE Transactions on Information Theory, vol.53, issue.11, pp.4059-4075, 2007.
DOI : 10.1109/TIT.2007.907496

E. Rosnes, Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes, IEEE Transactions on Information Theory, vol.54, issue.4, pp.1551-1560, 2008.
DOI : 10.1109/TIT.2008.917686

W. E. Ryan and S. Lin, Channel codes: Classical and modern, 2009.
DOI : 10.1017/CBO9780511803253

A. Sarwate, Soft decision decoding of Reed-Solomon product codes, EECS 229B Final Project Report, 2005.

M. Sathiamoorthy, M. Asteris, D. S. Papailiopoulos, A. G. Dimakis, R. Vadali et al., XORing elephants, Proc. VLDB Endow, 2013.
DOI : 10.14778/2535573.2488339

M. Schwartz, P. H. Siegel, and A. Vardy, On the asymptotic performance of iterative decoders for product codes, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.1758-1762, 2005.
DOI : 10.1109/ISIT.2005.1523647
URL : http://arxiv.org/pdf/cs/0508085

M. Schwartz and A. Vardy, On the stopping distance and the stopping redundancy of codes, IEEE Transactions on Information Theory, vol.52, issue.3, pp.922-932, 2006.
DOI : 10.1109/TIT.2005.864441
URL : https://authors.library.caltech.edu/6330/1/SCHWieeetit06.pdf

A. Sella and Y. Be-'ery, Convergence analysis of turbo decoding of product codes, Thèse de Doctorat de l'Université Paris 6, pp.723-735, 1991.
DOI : 10.1109/18.910584

A. Shokrollahi, Raptor codes, IEEE Trans. on Communications, vol.52, issue.6, pp.2551-2567, 2006.
DOI : 10.1109/isit.2004.1365073

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences
DOI : 10.1007/978-3-540-73086-6_12
URL : http://arxiv.org/pdf/math/0312448

R. P. Stanley, Enumerative combinatorics, 2012.

R. Storn and K. Price, Differential evolution -A simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, vol.11, issue.4, pp.341-359, 1997.
DOI : 10.1023/A:1008202821328

I. Tal and A. Vardy, List Decoding of Polar Codes, IEEE Transactions on Information Theory, vol.61, issue.5, pp.2213-2226, 2015.
DOI : 10.1109/TIT.2015.2410251
URL : https://doi.org/10.1109/tit.2015.2410251

R. M. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, vol.27, issue.5, pp.533-547, 1981.
DOI : 10.1109/TIT.1981.1056404
URL : http://www.ima.umn.edu/csg/bib/bib36.0533tann.pdf

R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, LDPC Block and Convolutional Codes Based on Circulant Matrices, IEEE Transactions on Information Theory, vol.50, issue.12, pp.2966-2984, 2004.
DOI : 10.1109/TIT.2004.838370

P. S. Chandrashekhar-thejaswi, A. Bennatan, J. Zhang, A. R. Calderbank, and D. Cochran, Layered Coding for Interference Channels With Partial Transmitter Side Information, IEEE Transactions on Information Theory, vol.57, issue.5, pp.2765-2780, 2011.
DOI : 10.1109/TIT.2011.2119670

J. Tillich and G. Zémor, Optimal Cycle Codes Constructed From Ramanujan Graphs, SIAM Journal on Discrete Mathematics, vol.10, issue.3, pp.447-459, 1997.
DOI : 10.1137/S0895480195292065

L. M. Tolhuizen, More results on the weight enumerator of product codes, IEEE Transactions on Information Theory, vol.48, issue.9, pp.2537-2577, 2002.
DOI : 10.1109/TIT.2002.801476

D. Truhachev, D. G. Mitchell, M. Lentmaier, and D. J. Costello, New codes on graphs constructed by connecting spatially coupled chains Information Theory and Applications (ITA'2012), pp.392-397, 2012.
DOI : 10.1109/ita.2012.6181771
URL : http://arxiv.org/pdf/1312.3368.pdf

D. Truhachev, D. G. Mitchell, M. Lentmaier, and D. J. Costello, New codes on graphs constructed by connecting spatially coupled chains, 2012 Information Theory and Applications Workshop, 2013.
DOI : 10.1109/ITA.2012.6181771
URL : http://arxiv.org/pdf/1312.3368.pdf

D. N. Tse and P. Viswanath, Fundamentals of Wireless Communication, 2005.
DOI : 10.1017/CBO9780511807213
URL : http://www.eecs.berkeley.edu/~dtse/main.pdf

W. M. Van-overveld, Multiple-burst error-correcting cyclic product codes (Corresp.), IEEE Transactions on Information Theory, vol.33, issue.6, pp.919-923, 1987.
DOI : 10.1109/TIT.1987.1057364

D. P. Varodayan, Investigation of the Elias product code construction for the binary erasure channel, 2002.

S. Vialle and J. J. Boutros, A Gallager-Tanner construction based on convolutional codes, Workshop on Coding and Cryptography (WCC'99), pp.393-404, 1999.

A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding, 1979.

S. Wainberg, Error-erasure decoding of product codes (Corresp.), IEEE Transactions on Information Theory, vol.18, issue.6, pp.821-823, 1972.
DOI : 10.1109/TIT.1972.1054922

V. K. Wei, Generalized Hamming weights for linear codes, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1412-1418, 1991.
DOI : 10.1109/18.133259

L. Weng and G. Sollman, Variable Redundancy Product Codes, IEEE Transactions on Communications, vol.15, issue.6, pp.835-838, 1967.
DOI : 10.1109/TCOM.1967.1089668

S. B. Wicker and V. K. Bhargava, Reed-Solomon Codes and their Applications, 1994.
DOI : 10.1109/9780470546345

J. K. Wolf, On codes derivable from the tensor product of check matrices, IEEE Transactions on Information Theory, vol.11, issue.2, pp.281-284, 1965.
DOI : 10.1109/TIT.1965.1053771

A. Yedla, P. S. Nguyen, H. D. Pfister, and K. R. Narayanan, Universal codes for the Gaussian MAC via spatial coupling, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.1801-1808, 2011.
DOI : 10.1109/Allerton.2011.6120387

S. Yekhanin, Locally Decodable Codes, of the series Lecture Notes in Computer Science, pp.289-290, 2012.
DOI : 10.1145/1326554.1326555

F. Jardel and J. J. Boutros, Edge Coloring in Product Code Graphs for Distributed Storage, Publications Journal Papers 1, 2015.

C. 1. Jardel, J. J. Boutros, and M. Sarkiss, Stopping sets for MDSbased product codes, IEEE International Symposium on Information Theory (ISIT), 2016.
URL : https://hal.archives-ouvertes.fr/cea-01840415

F. Jardel, J. J. Boutros, V. Dedeoglu, M. Sarkiss, G. Rekaya-ben et al., Spatial coupling for distributed storage and diversity applications, 2015 5th International Conference on Communications and Networking (COMNET), 2015.
DOI : 10.1109/COMNET.2015.7566624
URL : https://hal.archives-ouvertes.fr/cea-01841673

V. Dedeoglu, F. Jardel, and J. Boutros, Spatial coupling of root-LDPC: Parity bits doping, 2015 22nd International Conference on Telecommunications (ICT), pp.272-276, 2015.
DOI : 10.1109/ICT.2015.7124695

F. Jardel and J. J. Boutros, Non-uniform spatial coupling, 2014 IEEE Information Theory Workshop (ITW 2014), pp.446-450, 2014.
DOI : 10.1109/ITW.2014.6970871
URL : https://hal.archives-ouvertes.fr/cea-01841684