C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

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

L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate (Corresp.), IEEE Transactions on Information Theory, vol.20, issue.2, pp.284-287, 1974.
DOI : 10.1109/TIT.1974.1055186

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. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5754

M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, Efficient erasure correcting codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.569-584, 2001.
DOI : 10.1109/18.910575
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.244

D. Divsalar, H. Jin, and R. J. Mceliece, Coding theorems forv " turbolike " codes, Proceedings of Allerton Conference Comm, pp.201-210, 1998.

N. Varnica and A. Kavcic, Optimized LDPC codes for partial response channels, Proceedings IEEE International Symposium on Information Theory,, p.197, 2002.
DOI : 10.1109/ISIT.2002.1023469

X. Ma, N. Varnica, and A. Kavcic, Matched information rate codes for binary ISI channels, Proceedings of IEEE International Symposium on Information Theory ISIT, p.269, 2002.

N. Varnica and A. Kavcic, Optimized low-density parity-check codes for partial response channels, IEEE Communications Letters, vol.7, issue.4, 2003.
DOI : 10.1109/LCOMM.2003.810000

B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, Joint message-passing decoding of LDPC codes and partial-response channels, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1410-1422, 2002.
DOI : 10.1109/TIT.2002.1003830

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

H. Jin, A. Khandekar, and R. Mceliece, Irregular repeat-accumulate codes, Proceedings of International Symposium on Turbo Codes, pp.1-8, 2000.

J. Boutros, G. Caire, E. Viterbo, H. Sawaya, and S. Vialle, Turbo code at 0.03 dB from capacity limit, Proceedings IEEE International Symposium on Information Theory,, p.56, 2002.
DOI : 10.1109/ISIT.2002.1023328

B. J. Frey and D. Mackay, Irregular turbo codes, Proceedings of IEEE International Symposium on Information Theory ISIT, p.121, 2000.

M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, Analysis of low density codes and improved designs using irregular graphs, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.249-258, 1998.
DOI : 10.1145/276698.276756

T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, Design of capacity-approaching irregular low-density parity-check codes, IEEE Transactions on Information Theory, vol.47, issue.2, pp.619-637, 2001.
DOI : 10.1109/18.910578

S. Brink, Designing iterative decoding schemes with the extrinsic information transfer chart, AE¨UAE¨ AE¨U Int. J. Electronic. Commun, vol.54, issue.6, pp.389-398, 2000.

S. Brink, Convergence behavior of iteratively decoded parallel concatenated codes, IEEE Transactions on Communications, vol.49, issue.10, pp.1727-1737, 2001.
DOI : 10.1109/26.957394

S. Chung, T. J. Richardson, and R. L. Urbanke, Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation, IEEE Transactions on Information Theory, vol.47, issue.2, pp.657-670, 2001.
DOI : 10.1109/18.910580

H. Gamal and A. R. Hammons, Analyzing the turbo decoder using the Gaussian approximation, IEEE Transactions on Information Theory, vol.47, issue.2, pp.671-686, 2001.
DOI : 10.1109/18.910581

J. Boutros and G. Caire, Iterative multiuser joint decoding: unified framework and asymptotic analysis, IEEE Transactions on Information Theory, vol.48, issue.7, pp.1772-1793, 2002.
DOI : 10.1109/TIT.2002.1013125
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.9555

F. Lehmann and G. M. Maggio, An approximate analytical model of the message passing decoder of LDPC codes, Proceedings IEEE International Symposium on Information Theory,, p.31, 2002.
DOI : 10.1109/ISIT.2002.1023303

M. Ardakani and F. R. Kschischang, Designing irregular LPDC codes using EXIT charts based on message error rate, Proceedings IEEE International Symposium on Information Theory,, p.454, 2002.
DOI : 10.1109/ISIT.2002.1023726

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

A. Gamal and T. Cover, Multiple user information theory, Proceedings of the IEEE, pp.1463-1483, 1980.
DOI : 10.1109/PROC.1980.11897

S. Verdú, Multiuser Detection, p.158, 1998.

A. J. Viterbi, CDMA ? Principles of Spread Spectrum Communications, 1995.

S. Verdú and S. Shamai, Spectral efficiency of CDMA with random spreading, IEEE Transactions on Information Theory, vol.45, issue.2, pp.622-640, 1999.
DOI : 10.1109/18.749007

S. Verdú and S. Shamai, The impact of frequency-flat fading on the spectral efficiency of CDMA, IEEE Transactions on Information Theory, vol.47, issue.4, pp.1302-1327, 2001.

E. Biglieri, G. Caire, and G. Taricco, CDMA system design through asymptotic analysis, IEEE Transactions on Communications, vol.48, issue.11, pp.1882-1896, 2000.

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

J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, 1988.

R. J. Mceliece, D. J. Mackay, and J. Cheng, Turbo decoding as an instance of Pearl's "belief propagation" algorithm, IEEE Journal on Selected Areas in Communications, vol.16, issue.2, pp.140-152, 1998.
DOI : 10.1109/49.661103

F. R. Kschischang and B. J. Frey, Iterative decoding of compound codes by probability propagation in graphical models, IEEE Journal on Selected Areas in Communications, vol.16, issue.2, pp.219-230, 1998.
DOI : 10.1109/49.661110

J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes, IEEE Transactions on Information Theory, vol.42, issue.2, pp.429-445, 1996.
DOI : 10.1109/18.485714

T. J. Richardson and R. L. Urbanke, The capacity of low-density parity-check codes under message-passing decoding, IEEE Transactions on Information Theory, vol.47, issue.2, pp.599-618, 2001.
DOI : 10.1109/18.910577

D. Forney, Codes on graphs: normal realizations, IEEE Transactions on Information Theory, vol.47, issue.2, pp.520-548, 2001.
DOI : 10.1109/18.910573

A. Ashikhmin, G. Kramer, S. Ten, and . Brink, Extrinsic information transfer functions: A model and two properties, Proceedings of 36 th Annual Conference on Information Sciences and Systems CISS, 2002.
DOI : 10.1109/tit.2004.836693

A. Ashikhmin, G. Kramer, S. Ten, and . Brink, Code rate and the area under extrinsic information transfer curves, Proceedings IEEE International Symposium on Information Theory,, 2002.
DOI : 10.1109/ISIT.2002.1023387

S. Chung, On the Construction of Some Capacity-Approaching Coding Schemes, 2000.

S. Y. Chung, G. D. Forney, T. J. Richardson, and R. Urbanke, On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit, IEEE Communications Letters, vol.5, issue.2, pp.58-60, 2001.
DOI : 10.1109/4234.905935

S. Brink and G. Kramer, Turbo processing for scalar and vector channels, Proceedings of International Symposium on Turbo Codes, pp.23-30, 2003.

S. Brink and G. Kramer, Design of repeat-accumulate codes for iterative detection and decoding, IEEE Transactions on Signal Processing, vol.51, issue.11, pp.2764-2772, 2003.
DOI : 10.1109/TSP.2003.818250

H. Jin, Analysis and Design of Turbo-Like Codes, 2001.

S. Brink, Exploiting the chain rule of mutual information for the design of iterative decoding schemes, Proceedings of Allerton Conference Comm. Control and Comput, 2001.

M. Tuchler, S. Brink, and J. Hagenauer, Measures for tracing convergence of iterative decoding algorithms, Proceedings of the 4 th International ITG Conference on Source and Channel Coding, 2002.

S. Huettinger and J. Huber, Extrinsic and intrinsic information in systematic coding, Proceedings IEEE International Symposium on Information Theory,, 0160.
DOI : 10.1109/ISIT.2002.1023388

T. M. Cover and J. A. Thomas, Elements of Information Theory, 1991.
DOI : 10.1002/047174882x

T. F. Wong, Numerical calculation of symmetric capacity of Rayleigh fading channel with BPSK/QPSK, IEEE Communications Letters, vol.5, issue.8, pp.328-330, 2001.
DOI : 10.1109/4234.940981

A. Browder, Mathematical Analysis: An Introduction, 1996.
DOI : 10.1007/978-1-4612-0715-3

D. J. Mackay, S. T. Wilson, and M. C. Davey, Comparison of constructions of irregular Gallager codes, Proceedings of Allerton Conference Comm. Control and Comput, 1998.
DOI : 10.1109/26.795809

S. Dolinar and D. Divsalar, Weight distributions for turbo codes using random and nonrandom permutations, 1995.

W. Feng, J. Yuan, and B. S. Vucetic, A code-matched interleaver design for turbo codes, IEEE Transactions on Communications, vol.50, issue.6, pp.926-937, 2002.
DOI : 10.1109/TCOMM.2002.1010612

P. O. Vontobel, On the construction of turbo code interleavers based on graphs with large girth, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), pp.1408-1412, 2002.
DOI : 10.1109/ICC.2002.997082

J. Hokfelt, O. Edfors, and T. Maseng, A turbo code interleaver design criterion based on the performance of iterative decoding, IEEE Communications Letters, vol.5, issue.2, pp.52-54, 2001.
DOI : 10.1109/4234.905933

D. , L. Ruyet, and H. Vu-thien, Design of cycle optimized interleavers for turbo codes, Proceedings of International Symposium on Turbo Codes, pp.335-338, 2000.

X. Hu, E. Eleftheriou, and D. Arnold, Progressive edge-growth Tanner graphs, Proceedings of IEEE Global Telecommunication Conference, Globecom, pp.995-1001, 2001.

Y. Mao and A. H. Banihashemi, A heuristic for good low-density parity-check codes at short block lengths, Proceedings of IEEE International Conference on Communication ICC, pp.41-44, 2001.

J. A. Mcgowan and R. C. Williamson, Loop removal from LDPC codes, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), pp.230-233, 2003.
DOI : 10.1109/ITW.2003.1216737

T. Tian, C. Jones, J. D. Villasenor, and R. D. , Construction of irregular LDPC codes with low error floors, IEEE International Conference on Communications, 2003. ICC '03., pp.3125-3129, 2003.
DOI : 10.1109/ICC.2003.1203996

R. M. Tanner, Minimum-distance bounds by graph analysis, IEEE Transactions on Information Theory, vol.47, issue.2, pp.808-821, 2001.
DOI : 10.1109/18.910591
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.2467

S. Hoory, The Size of Bipartite Graphs with a Given Girth, Journal of Combinatorial Theory, Series B, vol.86, issue.2, pp.215-220, 2002.
DOI : 10.1006/jctb.2002.2123

H. Herzberg and G. Poltyrev, The error probability of M-ary PSK block coded modulation schemes, IEEE Transactions on Communications, vol.44, issue.4, pp.427-433, 1996.
DOI : 10.1109/26.489088

G. Poltyrev, Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Transactions on Information Theory, vol.40, issue.4, pp.1284-1292, 1994.
DOI : 10.1109/18.335935

I. Sason and S. Shamai, Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum, IEEE Transactions on Information Theory, vol.46, issue.1, pp.24-47, 2000.
DOI : 10.1109/18.817506

S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding, IEEE Transactions on Information Theory, vol.44, issue.3, pp.909-926, 1998.
DOI : 10.1109/18.669119

D. L. Kreher and D. R. Stinson, Combinatorial Algorithms-Generation , Enumeration and Search, 71] R. A. Brualdi. Introductory Combinatorics, 1999.
DOI : 10.1145/309739.309744
URL : http://dx.doi.org/10.1016/0166-218x(83)90108-7

D. Burshtein and G. Miller, Asymptotic Enumeration Methods for Analyzing LDPC Codes, IEEE Transactions on Information Theory, vol.50, issue.6, 2002.
DOI : 10.1109/TIT.2004.828064
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.9758

N. Kahale and R. Urbanke, On the minimum distance of parallel and serially concatenated codes, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), pp.31-47, 1998.
DOI : 10.1109/ISIT.1998.708611

D. J. Mackay, Online database of low-density parity check codes

C. Berrou, S. Vaton, M. Jezequel, and C. Douillard, Computing the minimum distance of linear codes by the error impulse method, Proceedings of IEEE International Symposium on Information Theory ISIT, p.5, 2002.

G. Zemor, G. Cohen, J. Boutros, C. Berrou, R. Pyndiah et al., IT: Décodage itératif pour les codes de longueur moyenne, 2003.

C. Berrou, Some clinical aspects of turbo codes, Proceedings of International Symposium on Turbo Codes, pp.26-31, 1997.

F. D. Neeser and J. L. Massey, Proper complex random processes with applications to information theory, IEEE Transactions on Information Theory, vol.39, issue.4, pp.1293-1302, 1993.
DOI : 10.1109/18.243446
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.1107

T. Cover, Multiple user information theory for the Gaussian channel, New Concepts in Multi-User Communication, number 43 in E:Applied Sciences, pp.53-61, 1981.

A. D. Wyner, Recent results in the Shannon theory, IEEE Transactions on Information Theory, vol.20, issue.1, 1974.
DOI : 10.1109/TIT.1974.1055171

B. Rimoldi and R. Urbanke, A rate-splitting approach to the Gaussian multiple-access channel, IEEE Transactions on Information Theory, vol.42, issue.2, pp.364-375, 1996.
DOI : 10.1109/18.485709

S. Verdú, Capacity region of Gaussian CDMA channels: The symbolsynchronous case, Proceedings of Allerton Conference Comm. Control and Comput, pp.1025-1034, 1986.

M. Varanasi and T. Guess, Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136), 1997.
DOI : 10.1109/ACSSC.1997.679134

M. Rupf and J. L. Massey, Optimum sequence multisets for synchronous code-division multiple-access channels, IEEE Transactions on Information Theory, vol.40, issue.4, pp.1261-1266, 1994.
DOI : 10.1109/18.335940

P. Viswanath and V. Anantharam, Optimal sequences and sum capacity of synchronous CDMA systems, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1984-1991, 1999.
DOI : 10.1109/18.782121

P. Viswanath and V. Anantharam, Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers, IEEE Transactions on Information Theory, vol.45, issue.6, p.1968, 1999.
DOI : 10.1109/18.782119

W. Yu, W. Rhee, S. Boyd, and J. Cioffi, Iterative Water-Filling for Gaussian Vector Multiple-Access Channels, IEEE Transactions on Information Theory, vol.50, issue.1, 2001.
DOI : 10.1109/TIT.2003.821988

T. Tanaka, A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors, IEEE Transactions on Information Theory, vol.48, issue.11, pp.2888-2910, 2002.
DOI : 10.1109/TIT.2002.804053

S. Verdú, Spectral efficiency in the wideband regime, IEEE Transactions on Information Theory, vol.48, issue.6, pp.1319-1343, 2002.
DOI : 10.1109/TIT.2002.1003824

D. N. Tse and S. V. Hanly, Linear multiuser receivers: effective interference, effective bandwidth and user capacity, IEEE Transactions on Information Theory, vol.45, issue.2, pp.641-657, 0164.
DOI : 10.1109/18.749008

E. Chong, J. Zhang, and D. Tse, Output MAI distribution of linear MMSE multiuser receivers in DS-CDMA systems, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1128-1144, 2001.

G. Caire and R. Müller, The optimal received power distribution for IC-based iterative multiuser joint decoders, Proceedings of Allerton Conference Comm. Control and Comput, 2001.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5055

L. Li, A. Tulino, and S. Verdú, Asymptotic eigenvalue moments for linear multiuser detection, Communications in Information and Systems, vol.1, issue.3, pp.273-304, 2001.
DOI : 10.4310/CIS.2001.v1.n3.a3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.2016

]. P. Varaiya, Lecture notes on optimization -web page

J. Edmonds, Submodular Functions, Matroids, and Certain Polyhedra, Proc. of Calgary International Conference on Combinatorial Structures and Their Applications, pp.69-87, 1969.
DOI : 10.1007/3-540-36478-1_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.454.4060

A. D. Wyner, Shannon-theoretic approach to a Gaussian cellular multiple-access channel, IEEE Transactions on Information Theory, vol.40, issue.6, pp.1713-1727, 1994.
DOI : 10.1109/18.340450