{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T15:49:51Z","timestamp":1776354591160,"version":"3.51.2"},"reference-count":228,"publisher":"Emerald","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,7,18]]},"abstract":"<jats:p>This article is focused on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In this article, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen\u2019s based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.<\/jats:p>","DOI":"10.1561\/0100000009","type":"journal-article","created":{"date-parts":[[2006,7,7]],"date-time":"2006-07-07T14:39:50Z","timestamp":1152283190000},"page":"1-222","source":"Crossref","is-referenced-by-count":81,"title":["Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial"],"prefix":"10.1561","volume":"3","author":[{"given":"Igal","family":"Sason","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Technion \u2013 Israel Institute of Technology , Haifa 32000,","place":["Israel"]}]},{"given":"Shlomo","family":"Shamai","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion \u2013 Israel Institute of Technology , Haifa 32000,","place":["Israel"]}]}],"member":"140","published-online":{"date-parts":[[2006,7,18]]},"reference":[{"key":"2026041610513431500_ref001","first-page":"514","article-title":"Maximum-likelihood decoding analysis of accumulate-repeat-accumulate codes","author":"Abbasfar","year":"2004"},{"key":"2026041610513431500_ref002","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/18.481810","article-title":"Voronoi regions for binary linear block codes","volume":"42","author":"Agrell","year":"1996","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref003","doi-asserted-by":"crossref","first-page":"3064","DOI":"10.1109\/18.737535","article-title":"On the Voronoi neighbor ratio for binary linear block codes","volume":"44","author":"Agrell","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref004","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-1-4613-0165-3_11","volume-title":"Codes, Systems and Graphical Models","author":"Aji","year":"2001"},{"key":"2026041610513431500_ref005","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/TCOMM.2004.831386","article-title":"Performance analysis of coded communication systems on Nakagami fading channels with selection combining diversity","volume":"52","author":"Annavajjala","year":"2004","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref006","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1109\/18.705584","article-title":"Minimal vectors in linear codes","volume":"44","author":"Ashikmin","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref007","first-page":"90","volume-title":"Proceedings 2005 Conference on Information Sciences and Systems (CISS 2005)","author":"Aydinlik","year":"2005"},{"key":"2026041610513431500_ref008","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1049\/el:19981198","article-title":"Performance bounds of continuous and blockwise decoded turbo codes in Rician fading channel","volume":"34","author":"Babich","year":"1998","journal-title":"Electronics Letters"},{"key":"2026041610513431500_ref009","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1049\/ip-com:20000826","article-title":"Improved union bounds on turbo codes performance","volume":"147","author":"Babich","year":"2000","journal-title":"IEE Proceedings on Communications"},{"key":"2026041610513431500_ref010","first-page":"527","article-title":"On the Viterbi and Viterbi\u2019s improved union bounds on turbo codes performance","volume-title":"Proceedings Second International Symposium on Turbo Codes and Related Topics","author":"Babich","year":"2000"},{"key":"2026041610513431500_ref011","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/TWC.2003.821138","article-title":"On the performance of efficient coding techniques over fading channels","volume":"3","author":"Babich","year":"2004","journal-title":"IEEE Trans. on Wireless Communications"},{"key":"2026041610513431500_ref012","first-page":"1568","article-title":"Estimates of the decoding error probability for parallel channels with dependent noise","author":"Balakirsky","year":"2004","journal-title":"Proceedings IEEE International Symposium on Information Theory and its Applications (ISITA 2004)"},{"key":"2026041610513431500_ref013","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1109\/18.144721","article-title":"On computing the weight spectrum of cyclic codes","volume":"38","author":"Barg","year":"1992","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref014","first-page":"1352","volume-title":"Proceedings Forty-Second Annual Allerton Conference on Communication, Control and Computing","author":"Barg","year":"2004"},{"key":"2026041610513431500_ref015","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1109\/TIT.2004.833352","article-title":"Exact thresholds and optimal codes for the binary symmetric channel and Gallager\u2019s decoding algorithm A","volume":"50","author":"Bazzi","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref016","first-page":"2227","article-title":"Improved lower bounds for the error rate of linear block codes","volume-title":"Proceedings 43rd Allerton Conference on Control, Computing and Communications","author":"Behnamfar","year":"2005"},{"key":"2026041610513431500_ref017","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/49.661111","article-title":"Analysis, design, and iterative decoding of double serially concatenated codes with interleavers","volume":"16","author":"Benedetto","year":"1998","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026041610513431500_ref018","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1109\/18.669119","article-title":"Serial concatenation of interleaved codes: Performance analysis, design and iterative decoding","volume":"44","author":"Benedetto","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref019","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/18.485713","article-title":"Unveiling turbo codes: some results on parallel concatenated coding schemes","volume":"42","author":"Benedetto","year":"1996","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref020","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/4234.585802","article-title":"Performance of continuous and blockwise decoded turbo codes","volume":"1","author":"Benedetto","year":"1997","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref021","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TIT.2004.824917","article-title":"On the application of LDPC codes to arbitrary discrete-memoryless channels","volume":"50","author":"Bennatan","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref022","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/PROC.1980.11696","article-title":"The technology of error correction codes","volume":"68","author":"Berlekamp","year":"1980","journal-title":"Proceedings of the IEEE"},{"key":"2026041610513431500_ref023","first-page":"1064","article-title":"Near Shannon limit errorcorrecting coding and decoding","volume-title":"Proceedings 1993 IEEE International Conference on Communications (ICC\u201993)","author":"Berrou","year":"1993"},{"key":"2026041610513431500_ref024","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1109\/26.539767","article-title":"Near optimum error correcting coding and decoding: Turbo codes","volume":"44","author":"Berrou","year":"1996","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref025","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.1997.613310","article-title":"Expurgating the union bound to error probability: A generalization of the Verdu-Shields theorem","volume-title":"Proceedings of the 1997 IEEE International Symposium on Information Theory","author":"Biglieri","year":"1997"},{"key":"2026041610513431500_ref026","doi-asserted-by":"crossref","first-page":"2619","DOI":"10.1109\/18.720551","article-title":"Fading channels: Information-theoretic and communications aspects","volume":"44","author":"Biglieri","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref027","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/LCOMM.2003.814705","article-title":"An upper bound on turbo codes performance over quasi-static fading channels","volume":"7","author":"Bouzekri","year":"2003","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref028","first-page":"219","article-title":"A method for determining the distance profile of turbo codes","volume-title":"Proceedings 3rd ITG Conference on Source and Channel Coding","author":"Breiling","year":"2000"},{"key":"2026041610513431500_ref029","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02998585","article-title":"Serial concatenation of interleaved convolutional codes and M-ary continuous phase modulations","volume":"54","author":"Brutel","year":"1999","journal-title":"Annals of Telecommunications"},{"key":"2026041610513431500_ref030","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02998580","article-title":"Comparison of iterative decoder performance with union bounds for short frame turbo codes","volume":"54","author":"Burr","year":"1999","journal-title":"Annals of Telecommunications"},{"key":"2026041610513431500_ref031","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.1997.613266","article-title":"Bounds on coding gain versus decoding delay for spherical codes on the Gaussian channel","volume-title":"Proceedings 1997 IEEE International Symposium on Information Theory (ISIT 1997)","author":"Burr","year":"1997"},{"key":"2026041610513431500_ref032","first-page":"111","article-title":"Multilevel turbo-coded modulation: performance bounds","volume-title":"Proceedings of the First International Symposium on Turbo Codes and Related Topics","author":"Burr","year":"1997"},{"key":"2026041610513431500_ref033","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1109\/TIT.2002.801408","article-title":"Upper bounds on the rate of LDPC codes","volume":"48","author":"Burshtein","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref034","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1109\/TIT.2004.828064","article-title":"Asymptotic enumeration methods for analyzing LDPC codes","volume":"50","author":"Burshtein","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026041610513431500_ref035","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1109\/18.669123","article-title":"Bit-interleaved coded modulation","volume":"44","author":"Caire","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref036","first-page":"206","article-title":"Weight distribution and performance of the iterated product of single-parity check-codes","author":"Caire","year":"1994","journal-title":"Proceedings 1994 IEEE Global Telecommunications Conference (GLOBECOM \u201894), Communications Theory Mini-Conference"},{"key":"2026041610513431500_ref037","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/18.45271","article-title":"A fast algorithm for computing the distance spectrum of convolutional codes","volume":"35","author":"Cedervall","year":"1989","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref038","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/4234.901815","article-title":"Using the Fourier transform to compute the weight distribution of a binary linear block code","volume":"5","author":"Chaudhari","year":"2001","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref039","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/TIT.2003.822577","article-title":"Lower bounds on the error probability of block codes based on improvements on de Caen\u2019s inequality","volume":"50","author":"Cohen","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref040","first-page":"25.5.1","article-title":"A new, simple and exact result for calculating error probability for two-dimensional signal constellation","author":"Craig","year":"1991","journal-title":"Proceedings of 1991 Military Communications Conference (MILCOM \u201891)"},{"key":"2026041610513431500_ref041","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u2019ar","year":"1981"},{"key":"2026041610513431500_ref042","author":"Dembo","year":"2000","journal-title":"personal communications"},{"key":"2026041610513431500_ref043","first-page":"1230","article-title":"A method for computing the weight distribution of a block code by using its trellis diagram","volume":"E77-A","author":"Desaki","year":"1994","journal-title":"IEICE Trans. Fundamentals"},{"key":"2026041610513431500_ref044","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1109\/18.605611","article-title":"The weight distributions of extended binary primitive BCH codes of length 128","volume":"43","author":"Desaki","year":"1997","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref045","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0012-365X(96)00107-0","article-title":"A lower bound on the probability of a union","volume":"169","author":"de Caen","year":"1997","journal-title":"Discrete mathematics"},{"key":"2026041610513431500_ref046","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02999683","article-title":"The random coded modulation: Performance and Euclidean distance spectrum evaluation","volume":"47","author":"de Oliveira","year":"1992","journal-title":"Annals of Telecommunications"},{"key":"2026041610513431500_ref047","doi-asserted-by":"crossref","first-page":"2011","DOI":"10.1109\/TCOMM.2003.820746","article-title":"Upper bounds to error probabilities of coded systems beyond the cuttoff rate","volume":"51","author":"Divsalar","year":"2003","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref048","unstructured":"D.\n              Divsalar\n            , S.Dolinar, R. J.McEliece, and F.Pollara, \u201cTransfer function bounds on the performance of turbo codes,\u201d Jet Propulsion Laboratory (JPL), CA, USA, TDA Progress Report42\u2013122, August1995. [Online] Available: http:\/\/tmo.jpl.nasa.gov\/tmo\/progressreport\/42-122\/122A.pdf."},{"key":"2026041610513431500_ref049","first-page":"201","article-title":"Coding theorems for \u2018turbo-like\u2019 codes","volume-title":"Proceedings of the 36th Allerton Conference on Communication, Control, and Computing","author":"Divsalar","year":"1998"},{"key":"2026041610513431500_ref050","first-page":"80","article-title":"Serial and hybrid concatenated codes with applications","volume-title":"Proceedings of International Symposium on Turbo Codes and Related Topics","author":"Divsalar","year":"1997"},{"key":"2026041610513431500_ref051","first-page":"9","article-title":"Ensemble weight enumerators for protograph LDPC codes","volume-title":"Proceedings IEEE 2006 International Symposium on Information Theory (ISIT 2006)","author":"Divsalar","year":"2006"},{"key":"2026041610513431500_ref052","unstructured":"D.\n              Divsalar\n            \n          , \u201cA simple tight bound on error probability of block codes with application to turbo codes,\u201d the Telecommunications and Mission Operations (TMO) Progress Report 42\u2013139, JPL, pp. 1\u201335, November15, 1999. [Online] Available: http:\/\/tmo.jpl.nasa.gov\/tmo\/progressreport\/42-139\/139L.pdf."},{"key":"2026041610513431500_ref053","first-page":"102","article-title":"Weight distributions of LDPC code ensembles: combinatorics meets statistical physics","volume-title":"Proceedings 2004 IEEE International Symposium on Information Theory (ISIT 2004)","author":"Di","year":"2004"},{"key":"2026041610513431500_ref054","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2006.883541","article-title":"Weight distribution of low-density parity-check codes","volume-title":"IEEE Trans. on Information Theory","author":"Di","year":"2006"},{"key":"2026041610513431500_ref055","volume-title":"Asymptotic and Finite-Length Analysis of Low-Density Parity-Check Codes","author":"Di","year":"2004"},{"key":"2026041610513431500_ref056","unstructured":"S.\n              Dolinar\n            , D.Divsalar, and F.Pollara, \u201cCode performance as a function of block size,\u201d Jet Propulsion Laboratory (JPL), TMO Progress Report 42\u2013133, pp. 1\u201323, May15, 1998. [Online] Available: http:\/\/tmo.jpl.nasa.gov\/tmo\/progressreport\/42-133\/133K.pdf."},{"key":"2026041610513431500_ref057","unstructured":"S.\n              Dolinar\n             and D.Divsalar, \u201cWeight distributions for turbo codes using random and nonrandom permutations,\u201d Jet Propulsion Laboratory (JPL), CA, USA, TDA Progress Report42\u2013122, August1995. [Online] Available: http:\/\/tmo.jpl.nasa.gov\/tmo\/progressreport\/42-122\/122B.pdf."},{"key":"2026041610513431500_ref058","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1109\/18.915684","article-title":"Performance bounds for high rate linear codes over partial response channels","volume":"47","author":"Duman","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref059","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/26.681398","article-title":"New performance bounds for turbo codes","volume":"46","author":"Duman","year":"1998","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref060","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1109\/26.764924","article-title":"Performance bounds for turbo-coded modulation systems","volume":"47","author":"Duman","year":"1999","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref061","doi-asserted-by":"crossref","DOI":"10.17760\/D20234675","volume-title":"Turbo Codes and Turbo Coded Modulation Systems: Analysis and Performance Bounds","author":"Duman","year":"1998"},{"key":"2026041610513431500_ref062","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1049\/el:20010496","article-title":"Maximum likelihood decoding bounds for high rate turbo codes over Loretnzian channels","volume":"37","author":"Duman","year":"2001","journal-title":"Electronics Letters"},{"key":"2026041610513431500_ref063","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1109\/26.795818","article-title":"The union bound for turbo coded modulation systems over fading channels","volume":"47","author":"Duman","year":"1999","journal-title":"IEEE Transactions on Communications"},{"key":"2026041610513431500_ref064","volume-title":"Error Bounds for Parallel Communication Channels","author":"Ebert","year":"1966"},{"key":"2026041610513431500_ref065","unstructured":"M.\n              El-Khamy\n             and R.Garello, \u201cOn the weight enumerator and the maximum-likelihood performance of linear product codes,\u201d in submitted to IEEE Trans. on Information Theory, December2005. [Online]. Available: http:\/\/arxiv.org\/abs\/cs.IT\/0601095."},{"key":"2026041610513431500_ref066","first-page":"290","article-title":"Bounds on the average binary minimum distance and the maximum-likelihood performance of Reed Solomon codes","volume-title":"Proceedings Forty-Second Annual Allerton Conference on Communication, Control and Computing","author":"El-Khamy","year":"2004"},{"key":"2026041610513431500_ref067","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1109\/18.923750","article-title":"Tighter bounds on the error probability of fixed convolutional codes","volume":"47","author":"Engdahl","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref068","doi-asserted-by":"crossref","first-page":"1871","DOI":"10.1109\/TIT.2005.846431","article-title":"The ML decoding performance of LDPC ensembles over Zq","volume":"51","author":"Erez","year":"2005","journal-title":"IEEE Trans. On Information Theory"},{"key":"2026041610513431500_ref069","doi-asserted-by":"crossref","first-page":"2173","DOI":"10.1109\/18.782170","article-title":"Which codes have cycle-free Tanner graphs?","volume":"45","author":"Etzion","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref070","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TIT.2005.860414","article-title":"Coded modulation in the block-fading channel: Coding theorems and code construction","volume":"52","author":"Fabregas","year":"2006","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref071","doi-asserted-by":"crossref","DOI":"10.1063\/1.3057290","volume-title":"Transmission of Information","author":"Fano","year":"1961"},{"key":"2026041610513431500_ref072","first-page":"2156","article-title":"Enumerators for protograph ensembles of LDPC codes","volume-title":"Proceedings IEEE 2005 International Symposium on Information Theory (ISIT 2005)","author":"Fogal","year":"2005"},{"key":"2026041610513431500_ref073","doi-asserted-by":"crossref","first-page":"2384","DOI":"10.1109\/18.720542","article-title":"Modulation and coding for linear Gaussian channels","volume":"44","author":"Forney","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref074","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1109\/18.771236","article-title":"On the weight distribution of terminated convolutional codes","volume":"45","author":"Fossorier","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref075","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/LCOMM.2005.1506713","article-title":"Critical point for maximum-likelihood decoding of linear block codes","volume":"9","author":"Fossorier","year":"2005","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref076","doi-asserted-by":"crossref","first-page":"2681","DOI":"10.1109\/TIT.2003.817453","article-title":"On performance limits of space-time codes: A sphere-packing bound approach","volume":"49","author":"Fozunbal","year":"2003","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref077","doi-asserted-by":"crossref","first-page":"0461201","DOI":"10.1103\/PhysRevE.66.046120","article-title":"Dynamic phase transition for decoding algorithms","volume":"66","author":"Franz","year":"2002","journal-title":"Physical Review E"},{"key":"2026041610513431500_ref078","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/26.129197","article-title":"Bounds on the error performance of coding for non independent Rician Fading channels","volume":"40","author":"Gagnon","year":"1992","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref079","article-title":"Bonferroni-type inequalities with Applications","volume-title":"Springer Series in Statistics, Probability and its Applications","author":"Galambos","year":"1996"},{"key":"2026041610513431500_ref080","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","article-title":"Low-density parity-check codes","volume":"8","author":"Gallager","year":"1962","journal-title":"IRE Trans. on Information Theory"},{"key":"2026041610513431500_ref081","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-density parity-check codes","author":"Gallager","year":"1963"},{"key":"2026041610513431500_ref082","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TIT.1965.1053730","article-title":"A simple derivation of the coding theorem and some applications","volume":"11","author":"Gallager","year":"1965","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref083","volume-title":"Information Theory and Reliable Communications","author":"Gallager","year":"1968"},{"key":"2026041610513431500_ref084","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TIT.1973.1054971","article-title":"The random coding bound is tight for the average code","volume":"19","author":"Gallager","year":"1973","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref085","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1109\/18.887846","article-title":"Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit","volume":"46","author":"Ganti","year":"2000","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref086","volume-title":"Tables of integrals, series and products","author":"Gradshteyn","year":"1994"},{"key":"2026041610513431500_ref087","first-page":"14","article-title":"On the performance of finite length irregular repeat-accumulate codes","volume-title":"Proceedings of the Fifth ITG Conference on Source and Channel Coding","author":"Guemghar","year":"2004"},{"key":"2026041610513431500_ref088","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/49.661105","article-title":"Design and analysis of turbo codes on Rayleigh fading channels","volume":"16","author":"Hall","year":"1998","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026041610513431500_ref089","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/TIT.2004.836667","article-title":"Rate-compatible puncturing of low-density parity-check codes","volume":"50","author":"Ha","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref090","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/18.335901","article-title":"Techniques for bounding the probability of decoding error for block coded modulations structures","volume":"40","author":"Herzberg","year":"1994","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref091","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/26.489088","article-title":"The error probability of M-ary PSK block coded modulation schemes","volume":"44","author":"Herzberg","year":"1996","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref092","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/49.924868","article-title":"On the theory and performance of trellis termination methods for turbo codes","volume":"19","author":"Hokfelt","year":"2001","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026041610513431500_ref093","first-page":"1147","article-title":"Asymptotic weight distributions of irregular repeat-accumulate codes","author":"Hsu","year":"2005","journal-title":"Proceedings 2005 IEEE Global Telecommunications Conference (GLOBECOM \u201805)"},{"key":"2026041610513431500_ref094","unstructured":"C. H.\n              Hsu\n             and A.Anastasopoulos, \u201cCapacity-achieving codes with bounded graphical complexity on noisy channels,\u201d in presented in the 43rd Allerton Conference on Communication, Control and Computing, (Monticello, Illinois, USA), pp. 28\u201330, September2005. [Online]. Available: http:\/\/www.arxiv.org\/abs\/cs.IT\/0509062."},{"key":"2026041610513431500_ref095","first-page":"13","article-title":"Capacity-achieving LDPC codes through puncturing","volume-title":"Proceedings 2005 IEEE International Conference on Wireless Networks and Mobile Computing (WirelessCom 2005)","author":"Hsu","year":"2005"},{"key":"2026041610513431500_ref096","first-page":"2436","article-title":"BER bounds on parallel concatenated single parity-check arrays and Zigzag codes","volume-title":"Proceedings 1999 IEEE Conference on Global Communications (GLOBECOM \u201899)","author":"Huang","year":"1999"},{"key":"2026041610513431500_ref097","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/18.61116","article-title":"On the error probability of signals in additive white Gaussian noise","volume":"37","author":"Hughes","year":"1991","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref098","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1109\/26.141419","article-title":"A simple upper bound on the error probability for orthogonal signals in white noise","volume":"40","author":"Hughes","year":"1992","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref099","doi-asserted-by":"crossref","first-page":"597","DOI":"10.2307\/3212481","article-title":"An upper bound for the probability of a union","volume":"13","author":"Hunter","year":"1976","journal-title":"Journal of Applied Probability"},{"key":"2026041610513431500_ref100","first-page":"1593","article-title":"An improved upper bound on the performance of convolutional codes over quasi-static fading channels","volume-title":"Proceedings 2003 IEEE Global Communications Conference (GLOBECOM 2003)","author":"Hu","year":"2003"},{"key":"2026041610513431500_ref101","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/LCOMM.2005.01013","article-title":"Efficient expression and bound for pairwise error probability in Rayleigh fading channels, with application to union bounds for turbo codes","volume":"9","author":"Ince","year":"2005","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref102","doi-asserted-by":"crossref","unstructured":"J.\n              Jiang\n             and K. R.Narayanan, \u201cIterative soft input soft output decoding of Reed-Solomon codes by adapting the parity-check matrix,\u201d submitted to IEEE Trans. on Information Theory, [Online]. Available: http:\/\/www.arxiv.org\/list\/cs.IT\/0506073, June2005.","DOI":"10.1109\/TIT.2006.878176"},{"key":"2026041610513431500_ref103","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-46796-3_2","volume-title":"Proceedings in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: 13th International Symposium (AAECC-13)","author":"Jin","year":"1999"},{"key":"2026041610513431500_ref104","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TIT.2002.1003833","article-title":"Coding theorems for turbo-like ensembles","volume":"48","author":"Jin","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref105","first-page":"228","article-title":"Information rates and error exponents of compound channels with application to antipodal signaling in a fading environment","volume":"47","author":"Kaplan","year":"1993","journal-title":"International Journal of Electronics and Communication (AEU)"},{"key":"2026041610513431500_ref106","doi-asserted-by":"crossref","first-page":"2967","DOI":"10.1109\/26.328978","article-title":"Achievable performance over the correlated Rician channel","volume":"42","author":"Kaplan","year":"1994","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref107","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TIT.1985.1057107","article-title":"Approximation of the weight distribution of binary linear block codes","volume":"31","author":"Kasami","year":"1985","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref108","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/EEEI.2000.924389","article-title":"A lower bound on the probability of decoding error over a BSC channel","author":"Keren","year":"2000","journal-title":"Proceedings 21st IEEE Convention of the Electrical and Electronic Engineers in Israel"},{"key":"2026041610513431500_ref109","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/18.817517","article-title":"On coding for block fading channels","volume":"46","author":"Knopp","year":"2000","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref110","first-page":"2418","article-title":"Performance evaluation of turbo codes over impulsive noise channels","volume":"E84\u2013A","author":"Koiko","year":"2001","journal-title":"IEICE Trans. Fundamentals"},{"key":"2026041610513431500_ref111","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/49.661108","article-title":"Performance evaluation of superorthognal turbo codes in AWGN and flat Rayleight fading channels","volume":"16","author":"Komulainen","year":"1998","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026041610513431500_ref112","unstructured":"T.\n              Koumoto\n            \n          , \u201cWeb site on the weight distribution of BCH and ReedMuller codes,\u201d [Online]. Available: http:\/\/www.infsys.cne.okayama-u.ac.jp\/\u223ckoumoto\/wd\/index.html., August2004."},{"key":"2026041610513431500_ref113","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0012-365X(99)00246-0","article-title":"A lower bound on the probability of a finite union of events","volume":"215","author":"Kuai","year":"2000","journal-title":"Journal of Discrete Mathematics"},{"key":"2026041610513431500_ref114","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1109\/18.995552","article-title":"Fading channels: How perfect need \u201cperfect sideinformation\u201d be?","volume":"48","author":"Lapidoth","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref115","first-page":"192","article-title":"How close are turbo codes to optimal codes?","author":"Lazic","year":"1997","journal-title":"Proceedings of the International Symposium on Turbo Codes and Related Topics"},{"key":"2026041610513431500_ref116","doi-asserted-by":"crossref","first-page":"2506","DOI":"10.1109\/26.310602","article-title":"Chernoff bound of trellis-coded modulation over correlated fading channels","volume":"42","author":"Leeuwin","year":"1994","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref117","volume-title":"personal communications","author":"Ling","year":"2005"},{"key":"2026041610513431500_ref118","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1109\/18.992777","article-title":"On ensembles of low-density parity-check codes: Asymptotic distance distributions","volume":"48","author":"Litsyn","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref119","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/TIT.2006.871615","article-title":"Reliable channel regions for good binary codes transmitted over parallel channels","volume":"52","author":"Liu","year":"2006","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref120","first-page":"975","article-title":"Generalized product-accumulate codes: Analysis and performance","author":"Li","year":"2001","journal-title":"Proceedings 2001 IEEE Global Communications Conference (GLOBECOM 2001)"},{"key":"2026041610513431500_ref121","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TIT.2003.821995","article-title":"Product-accumulate codes: A class of codes with near-capacity performance and low decoding complexity","volume":"50","author":"Li","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref122","unstructured":"Y.\n              Li\n             and J.Moon, \u201cPerformance analysis of bit-interleaved space-time coding for OFDM in block fading channels,\u201d in Proceedings 2004 IEEE Vehicular Technology Conference (VTC2004-Spring), (Milan, Italy), May2004. [Online]. Available: http:\/\/www-cdslab.ece.umn.edu\/library\/papers\/vtc04S.pdf."},{"key":"2026041610513431500_ref123","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/LCOMM.2004.832779","article-title":"On the input-output weight enumerators of product accumulate codes","volume":"8","author":"Lu","year":"2004","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref124","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1049\/el:19970362","article-title":"Near Shannon limit performance of low-density parity-check codes","volume":"33","author":"C","year":"1997","journal-title":"IEEE Electronic Letters"},{"key":"2026041610513431500_ref125","doi-asserted-by":"crossref","first-page":"3009","DOI":"10.1109\/18.737529","article-title":"A comparison of known codes, random codes and the best codes","volume":"44","author":"Macmullan","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref126","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1109\/18.771235","article-title":"Evaluating the performance of convolutional codes over block fading channels","volume":"45","author":"Malkamaki","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref127","first-page":"121","article-title":"How to compute weight enumerators for convolutional codes","volume-title":"Communications and Coding","author":"McEliece","year":"1998"},{"key":"2026041610513431500_ref128","unstructured":"C.\n              Measson\n            , A.Montanari, T.Richardson, and R.Urbanke, \u201cLife above threshold: From list decoding to area theorem and MSE,\u201d in 2004 IEEE Information Theory Workshop, (San Antonio, TX, USA), October24\u201329, 2004. [Online]. Available: http:\/\/www.arxiv.org\/abs\/cs.IT\/0410028."},{"key":"2026041610513431500_ref129","unstructured":"C.\n              Measson\n            , A.Montanari, and R.Urbanke, \u201cMaxwell construction: The hidden bridge between iterative and maximum a posteriori decoding,\u201d in IEEE Trans. on Information Theory, June2005. submitted to [Online]. Available: http:\/\/www.arxiv.org\/abs\/cs.IT\/0506083."},{"key":"2026041610513431500_ref130","unstructured":"C.\n              Measson\n            , A.Montanari, and R.Urbanke, \u201cWhy we can not surpass capacity: The matching condition,\u201d presented in the 43rd Allerton Conference on Communication, Control and Computing, pp. 28\u201330, [Online]. Available: http:\/\/www.arxiv.org\/abs\/cs.IT\/0510045, September2005."},{"key":"2026041610513431500_ref131","first-page":"176","volume-title":"Proceedings 2005 Conference on Information Sciences and Systems (CISS 2005)","author":"Mehrabian","year":"2005"},{"key":"2026041610513431500_ref132","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1109\/18.340469","article-title":"On information rates for mismatched decoders","volume":"40","author":"Merhav","year":"1994","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref133","doi-asserted-by":"crossref","first-page":"2696","DOI":"10.1109\/18.959254","article-title":"Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes","volume":"47","author":"Miller","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref134","doi-asserted-by":"crossref","first-page":"2078","DOI":"10.1109\/TIT.2002.1013147","article-title":"Variance of the turbo code performance bound over the interleavers","volume":"48","author":"Mohammadi","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref135","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s100510070085","article-title":"Turbo codes: The phase transition","volume":"18","author":"Montanari","year":"2000","journal-title":"The European Physical Journal B"},{"key":"2026041610513431500_ref136","doi-asserted-by":"crossref","first-page":"3221","DOI":"10.1109\/TIT.2005.853320","article-title":"Tight bounds for LDPC codes and LDGM codes under MAP decoding","volume":"51","author":"Montanari","year":"2005","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref137","doi-asserted-by":"crossref","first-page":"1901","DOI":"10.1109\/26.966054","article-title":"Serially concatenated continuous phase modulation with iterative decoding","volume":"49","author":"Moqvist","year":"2001","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref138","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1049\/el:20000478","article-title":"Evaluation of transfer functions for punctured turbo codes","volume":"36","author":"Mugaibel","year":"2000","journal-title":"Electronics Letters"},{"key":"2026041610513431500_ref139","first-page":"404","article-title":"Error performance bounds of turbo codes employing nonuniform interleavers","volume-title":"Proceedings 1999 IEEE International Conference on Personal Wireless Communications","author":"Namokel","year":"1999"},{"key":"2026041610513431500_ref140","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1109\/26.774833","article-title":"A serial concatenation approach to iterative demodulation and decoding","volume":"47","author":"Narayanan","year":"1999","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref141","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/26.917774","article-title":"Performance of trellis-coded CPM with iterative demodulation and decoding","volume":"49","author":"Narayanan","year":"2001","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref142","first-page":"419","article-title":"Evaluation of transfer functions for punctured turbo codes","author":"Nefedov","year":"2000","journal-title":"Proceedings 2nd International Symposium on Turbo Codes & Related Topics"},{"key":"2026041610513431500_ref143","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/26.911451","article-title":"Performance analysis of turbo-equalized partial response channels","volume":"49","author":"Oberg","year":"2001","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref144","doi-asserted-by":"crossref","first-page":"1776","DOI":"10.1109\/50.908727","article-title":"BER performance of turbo-coded PPM CDMA systems on optical fiber","volume":"18","author":"Ohutsuki","year":"2000","journal-title":"IEEE Journal of Lightwave Technology"},{"key":"2026041610513431500_ref145","first-page":"623","article-title":"Transfer function bounds on performance of binary turbo coding followed by M-ary ortohognal signal mapping through interleaver","volume-title":"Proceedings 2000 IEEE International Conference on Communications (ICC 2000)","author":"Ohutsuki","year":"2000"},{"key":"2026041610513431500_ref146","first-page":"42","volume-title":"Finding the complete path and weight enumerators of convolutional codes","author":"Onyszchuk","year":"1990"},{"key":"2026041610513431500_ref147","doi-asserted-by":"crossref","first-page":"2572","DOI":"10.1109\/18.796409","article-title":"On interleaved, differntially encoded convolutional codes","volume":"45","author":"Peleg","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref148","doi-asserted-by":"crossref","first-page":"2352","DOI":"10.1109\/TIT.2005.850079","article-title":"Capacity-achieving ensembles for the binary erasure channel with bounded complexity","volume":"51","author":"Pfister","year":"2005","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref149","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TIT.2003.811907","article-title":"The serial concatenation of rate\u20131 codes through uniform random interleavers","volume":"49","author":"Pfister","year":"2003","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref150","volume-title":"On the capacity of finite state channels and the analysis of convolutional accumulate-m codes","author":"Pfister","year":"2003"},{"key":"2026041610513431500_ref151","doi-asserted-by":"crossref","first-page":"3213","DOI":"10.1109\/TIT.2003.820018","article-title":"Low-rate turbo-hadamard codes","volume":"49","author":"Ping","year":"2003","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref152","first-page":"9","article-title":"Random coding bounds for discrete memoryless channels","volume":"18","author":"Poltyrev","year":"1982","journal-title":"Problems on Information Transmission"},{"key":"2026041610513431500_ref153","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1109\/18.335935","article-title":"Bounds on the decoding error probability of binary linear codes via their spectra","volume":"40","author":"Poltyrev","year":"1994","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref154","first-page":"1199","article-title":"Bounds on the performance of turbo codes on Nakagami fading channels with diversity combining","author":"Ramesh","year":"2001","journal-title":"Proceedings 2001 IEEE Global Telecommunications Conference (GLOBECOM 2001)"},{"key":"2026041610513431500_ref155","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/18.995649","article-title":"An average weight-distance enumerator for binary expansions of Reed-Solomon codes","volume":"48","author":"Retter","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref156","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/18.910578","article-title":"Design of capacityapproaching irregular low-density parity-check codes","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref157","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.910577","article-title":"The capacity of low-density parity-check codes under message-passing decoding","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref158","first-page":"492","article-title":"On the distribution of low weight codewords for turbo codes","volume-title":"Proceedings Forty-Second Annual Allerton Conference on Communication, Control and Computing","author":"Richardson","year":"2004"},{"key":"2026041610513431500_ref159","unstructured":"T.\n              Richardson\n             and R.Urbanke, \u201cModern coding theory,\u201d in preparation. [Online]. Available: http:\/\/lthcwww.epfl.ch\/papers\/ics.ps."},{"key":"2026041610513431500_ref160","first-page":"439","article-title":"An efficient algorithm for tailbiting turbo code weight distribution calculation","volume-title":"Proceedings Third International Symposium on Turbo Codes and Related Topics","author":"Rosnes","year":"2003"},{"key":"2026041610513431500_ref161","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TCOMM.2004.840632","article-title":"Improved algorithms for the determination of turbo code weight distributions","volume":"53","author":"Rosnes","year":"2005","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref162","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/49.29615","article-title":"An algorithm for computing the distance spectrum of trellis codes","volume":"7","author":"Rouanne","year":"1989","journal-title":"IEEE Journal on Selected Areas in Comunications"},{"key":"2026041610513431500_ref163","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1049\/el:19991464","article-title":"Approach for deriving performance bounds of punctured turbo codes","volume":"35","author":"Salah","year":"1999","journal-title":"Electronics Letters"},{"key":"2026041610513431500_ref164","article-title":"Coding for parallel channels: Gallager bounds for binary linear codes with applications to turbo-like codes","volume-title":"IEEE Trans. on Onformation Theory","author":"Sason","year":"2006"},{"key":"2026041610513431500_ref165","first-page":"15","article-title":"On coding for independent and memoryless parallel channels: Tightened performance bounds and achievable channel regions for linear codes","volume-title":"IEEE Convention of Electrical and Electronics Engineers in Israel","author":"Sason","year":"2006"},{"key":"2026041610513431500_ref166","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1109\/TCOMM.2003.815057","article-title":"Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels","volume":"51","author":"Sason","year":"2003","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref167","article-title":"Gallager\u2019s 1961 bound: Extensions and observations","volume-title":"Technical Report, CC No. 258, Technion, Israel","author":"Sason","year":"1998"},{"key":"2026041610513431500_ref168","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02998579","article-title":"Bounds on the error probability for block and turboblock codes","volume":"54","author":"Sason","year":"1999","journal-title":"Annals of Telecommunications"},{"key":"2026041610513431500_ref169","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/4234.831034","article-title":"Improved upper bounds on the ensemble performance of ML decoded low-density parity-check codes","volume":"4","author":"Sason","year":"2000","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref170","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/18.817506","article-title":"Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum","volume":"46","author":"Sason","year":"2000","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref171","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/ett.4460110304","article-title":"On union bounds for random serially concatenated turbo codes with maximum likelihood decoding","volume":"11","author":"Sason","year":"2000","journal-title":"European Trans. on Telecommunications"},{"key":"2026041610513431500_ref172","doi-asserted-by":"crossref","first-page":"2275","DOI":"10.1109\/18.945248","article-title":"On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes","volume":"47","author":"Sason","year":"2001","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref173","doi-asserted-by":"crossref","first-page":"3052","DOI":"10.1109\/TIT.2002.805065","article-title":"On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders","volume":"48","author":"Sason","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref174","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/ISIT.2003.1228283","article-title":"Information-theoretic lower bounds on the bit error probability of codes on graphs","author":"Sason","year":"2003","journal-title":"Proceedings 2003 IEEE International Symposium on Information Theory"},{"key":"2026041610513431500_ref175","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1109\/TIT.2003.813560","article-title":"Parity-check density versus performance of binary linear block codes over memoryless symmetric channels","volume":"49","author":"Sason","year":"2003","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref176","doi-asserted-by":"crossref","unstructured":"I.\n              Sason\n             and G.Wiechman, \u201cOn achievable rates and complexity of LDPC codes for parallel channels with application to puncturing,\u201d submitted to IEEE Trans. on Information Theory, See http:\/\/arxiv.org\/abs\/cs.IT\/0508072, August2005.","DOI":"10.1109\/ISIT.2006.261700"},{"key":"2026041610513431500_ref177","first-page":"9","article-title":"On achievable rates and complexity of LDPC codes for parallel channels with application to puncturing","author":"Sason","year":"2006","journal-title":"Proceedings IEEE 2006 IEEE International Symposium on Information Theory (ISIT 2006)"},{"key":"2026041610513431500_ref178","first-page":"3","article-title":"Performance versus complexity per iteration for low-density parity-check codes: An information-theoretic approach","author":"Sason","year":"2006","journal-title":"Proceedings of the Fourth International Symposium on Turbo Codes and Related Topics"},{"key":"2026041610513431500_ref179","volume-title":"Upper bounds on the maximum-likelihood decoding error probability for block codes and turbo-like codes","author":"Sason","year":"2001"},{"key":"2026041610513431500_ref180","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/4234.775255","article-title":"On error bounds and turbo codes","volume":"3","author":"Schlegel","year":"1999","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref181","doi-asserted-by":"crossref","first-page":"3168","DOI":"10.1109\/18.737550","article-title":"A lower bound on the error probability for signals in white Gaussian noise","volume":"44","author":"Seguin","year":"1998","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref182","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1109\/TIT.2002.805064","article-title":"Variations on the gallager bounds, connections and applications","volume":"48","author":"Shamai","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref183","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1002\/j.1538-7305.1959.tb03905.x","article-title":"Probability of error for optimal codes in a Gaussian channel","volume":"38","author":"Shannon","year":"1959","journal-title":"Bell System Technical Journal"},{"key":"2026041610513431500_ref184","first-page":"65","article-title":"Lower bounds to error probability for coding on discrete memoryless channels","volume":"10","author":"Shannon","year":"1967","journal-title":"Parts I and II, Information and Control"},{"key":"2026041610513431500_ref185","first-page":"A.169","article-title":"Improved upper bound on the bit error probability of turbo codes for ML decoding with perfect CSI in a Rayleigh fading channel","volume-title":"Proceedings 2001 IEEE 12th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2001)","author":"Shin","year":"2001"},{"key":"2026041610513431500_ref186","doi-asserted-by":"crossref","first-page":"2101","DOI":"10.1109\/18.782147","article-title":"Random coding techniques for nonrandom codes","volume":"45","author":"Shulman","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref187","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/26.659479","article-title":"Some new twists to problems involving the Gaussian probability integral","volume":"46","author":"Simon","year":"1998","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref188","doi-asserted-by":"crossref","first-page":"11131","DOI":"10.1088\/0305-4470\/36\/43\/032","article-title":"Average and reliability error exponents in low-density parity-check codes","volume":"36","author":"Skantzos","year":"2003","journal-title":"Journal of Physics A"},{"key":"2026041610513431500_ref189","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1109\/18.532911","article-title":"The weight distribution of the third-order Reed-muller code of length 512","volume":"42","author":"Sugita","year":"1996","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref190","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/ett.4460060510","article-title":"Weight distributions and bounds for turbo codes","volume":"6","author":"Svirid","year":"1995","journal-title":"European Transactions on Telecommunications"},{"key":"2026041610513431500_ref191","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1109\/18.382038","article-title":"A lower bound on the error probability for signals in white Gaussian noise","volume":"41","author":"Swaszek","year":"1995","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref192","first-page":"105","article-title":"On the ensemble performance of turbo codes","author":"Telatar","year":"1997","journal-title":"Proceedings 1997 IEEE International Symposium on Information Theory (ISIT 97)"},{"key":"2026041610513431500_ref193","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1109\/4234.846501","article-title":"Generation of bivariate Rayleigh and Nakagami-m fading envelopes","volume":"4","author":"Tellambura","year":"2000","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref194","first-page":"15","article-title":"Union bounds on the performance of product codes","author":"Tolhuizen","year":"1998","journal-title":"Proceedings 1998 IEEE International Symposium on Information Theory (ISIT 1998)"},{"key":"2026041610513431500_ref195","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/0012-365X(92)90579-5","article-title":"On the weight enumerator of product codes","volume":"106\u2013107","author":"Tolhuizen","year":"1992","journal-title":"Discrete Mathematics"},{"key":"2026041610513431500_ref196","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1109\/TIT.2002.801476","article-title":"More results on the weight enumerator of product codes","volume":"48","author":"Tolhuizen","year":"2002","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref197","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TCOMM.2004.840630","article-title":"Serial concatenated TCM with inner accumulate code \u2013 Part 1: Maximum-likelihood analysis","volume":"53","author":"Tullberg","year":"2005","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref198","doi-asserted-by":"crossref","unstructured":"M.\n              Twitto\n            , I.Sason, and S.Shamai, \u201cTightened upper bounds on the ML decoding error probability of binary linear block codes,\u201d submitted to the IEEE Trans. on Information Theory, [Online]. Available: http:\/\/www.ee.technion.ac.il\/people\/sason\/SFB.pdf, February2006.","DOI":"10.1109\/ISIT.2006.261625"},{"key":"2026041610513431500_ref199","first-page":"9","article-title":"Tightened upper bounds on the ML decoding error probability of binary linear codes","author":"Twitto","year":"2006","journal-title":"IEEE International Symposium on Information Theory (ISIT 2006) Seatle"},{"key":"2026041610513431500_ref200","doi-asserted-by":"crossref","unstructured":"M.\n              Twitto\n             and I.Sason, \u201cOn the error exponents of some versions of improved tangential-sphere bounds,\u201d submitted to the IEEE Trans. on Information Theory, [Online]. Available: http:\/\/www.ee.technion.ac.il\/people\/sason\/errorexponentsitsb.pdf, March2006.","DOI":"10.1109\/TIT.2006.890725"},{"key":"2026041610513431500_ref201","unstructured":"R.\n              Urbanke\n            \n          , \u201cLDPC asymptotic weight and stopping set spectrum calculator,\u201d [Online]. Available: http:\/\/lthcwww.epfl.ch\/\u223ccdi\/ldpc\/ldpcdefine.php."},{"key":"2026041610513431500_ref202","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1109\/TIT.2004.826644","article-title":"Box and match techniques applied to soft-decision decoding","volume":"50","author":"Valembois","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref203","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1109\/TIT.2004.838090","article-title":"Sphere-packing bounds revisited for moderate block length","volume":"50","author":"Valembois","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref204","volume-title":"Multiuser detection","author":"Verdu\u2019","year":"1998"},{"key":"2026041610513431500_ref205","volume-title":"Principles of digital communications and coding","author":"Viterbi","year":"1979"},{"key":"2026041610513431500_ref206","first-page":"47","article-title":"Perspectives on interleaved concatenated codes with iterative soft-output decoding","author":"Viterbi","year":"1997","journal-title":"Proceedings First International Symposium on Turbo Codes and Related Topics"},{"key":"2026041610513431500_ref207","first-page":"242","volume-title":"Principles of coherent communication","author":"Viterbi","year":"1966"},{"key":"2026041610513431500_ref208","first-page":"72","article-title":"An improved union bound for binary linear codes on the AWGN channel, with application to turbo decoding","volume-title":"Proceedings of IEEE Information Theory Workshop","author":"Viterbi","year":"1998"},{"key":"2026041610513431500_ref209","first-page":"29","article-title":"Improved union bound on linear codes for the binary-input AWGN channel, with application to turbo codes","volume-title":"Proceedings 1998 IEEE International Symposium on Information Theory (ISIT 1998)","author":"Viterbi","year":"1998"},{"key":"2026041610513431500_ref210","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02998578","article-title":"New results on serial concatenated and accumulated convolutional turbo code performance","volume":"54","author":"Viterbi","year":"1999","journal-title":"Annals of Telecommunications"},{"key":"2026041610513431500_ref211","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/18.771140","article-title":"Multilevel codes: Theoretical concepts and practical design rules","volume":"45","author":"Wachsmann","year":"1999","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref212","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1109\/TMAG.2002.801877","article-title":"Bounds for low-density parity-check codes over partial response channels","volume":"38","author":"Weijun","year":"2002","journal-title":"IEEE Trans. on Magnetics"},{"key":"2026041610513431500_ref213","unstructured":"G.\n              Wiechman\n             and I.Sason, \u201cImproved bounds on the parity-check density and achievable rates of binary linear block codes with applications to LDPC codes,\u201d submitted to IEEE Trans. on Information Theory, See http:\/\/arxiv.org\/abs\/cs.IT\/0505057, May2005."},{"key":"2026041610513431500_ref214","unstructured":"G.\n              Wiechman\n             and I.Sason, \u201cImproved bounds on the parity-check density and achievable rates of LDPC codes,\u201d in Proceedings Forty-Third Annual Allerton Conference on Communications, Control and Computing, pp. 1747\u20131758, September28\u201330, 2005. See http:\/\/arxiv.org\/abs\/cs.IT\/0505078."},{"key":"2026041610513431500_ref215","first-page":"27","article-title":"Improved sphere-packing bounds for codes of short to moderate block lengths with application to turbo-like codes","author":"Wiechman","year":"2006","journal-title":"Forty-Four Annual Allerton Conference on Communications, Control and Computing"},{"key":"2026041610513431500_ref216","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1109\/26.536907","article-title":"On the weight distribution of linear block codes formed from convolutional codes","volume":"44","author":"Wolf","year":"1996","journal-title":"IEEE Trans. on Communications"},{"key":"2026041610513431500_ref217","doi-asserted-by":"crossref","first-page":"2490","DOI":"10.1109\/TIT.2004.834850","article-title":"Performance analysis of turbo- SPC codes","volume":"50","author":"Wu","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref218","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/LCOMM.2005.1496596","article-title":"The Engdahl-Zigangirov bound for binary coded systems over block fading channels","volume":"9","author":"Wu","year":"2005","journal-title":"IEEE Communications Letters"},{"key":"2026041610513431500_ref219","article-title":"New gallager bounds in block fading channels","volume-title":"IEEE Trans. on Information Theory","author":"Wu","year":"2005"},{"key":"2026041610513431500_ref220","first-page":"382","article-title":"Relations between the local weight distributions of a linear block code, its extended code, and its even weight subcode","volume-title":"Proceedings 2005 IEEE International Symposium on Information Theory (ISIT 2005)","author":"Yasunaga","year":"2005"},{"key":"2026041610513431500_ref221","first-page":"303","article-title":"ML Performance analysis method for SCCC and SCTCM with an \u2018in-line\u2019 interleaver","author":"Yokokawa","year":"2003","journal-title":"Proceedings Third International Symposium on Turbo Codes and Related Topics"},{"key":"2026041610513431500_ref222","first-page":"852","article-title":"On the calculation method of input-output weight distribution of terminated convolutional codes","author":"Yoshikawa","year":"2004","journal-title":"Proceedings 2003 International Symposium on Information Theory and Applications (ISITA 2004)"},{"key":"2026041610513431500_ref223","doi-asserted-by":"crossref","first-page":"2810","DOI":"10.1109\/TIT.2004.836666","article-title":"Generalized tangential-sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference","volume":"50","author":"Yousefi","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref224","doi-asserted-by":"crossref","first-page":"3026","DOI":"10.1109\/TIT.2004.838091","article-title":"A new upper bound on the ML decoding error probability of linear block codes in the AWGN channel","volume":"50","author":"Yousefi","year":"2004","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026041610513431500_ref225","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/49.924866","article-title":"Improved tangential sphere bound on the bit error probability of concatenated codes","volume":"19","author":"Zangl","year":"2001","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026041610513431500_ref226","first-page":"1623","article-title":"Performance analysis of coded OFDM systems over frequency-selective fading channels","author":"Zheng","year":"2003","journal-title":"Proceedings 2003 IEEE Global Telecommunications Conference (GLOBECOM \u201803)"},{"key":"2026041610513431500_ref227","first-page":"1129","article-title":"Performance analysis of coded systems over block fading channels","volume-title":"Proceedings 2002 IEEE Vehicular Technology Conference (VTC 2002-Fall)","author":"Zummo","year":"2002"},{"key":"2026041610513431500_ref228","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/MILCOM.2003.1290121","article-title":"Performance analysis of binary coded systems over rician block fading channels","volume-title":"Proceedings 2003 IEEE Military Communications Conference (MILCOM 2003)","author":"Zummo","year":"2003"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/3\/1-2\/1\/11522276\/0100000009en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/3\/1-2\/1\/11522276\/0100000009en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T14:52:12Z","timestamp":1776351132000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/3\/1-2\/1\/1360115\/Performance-Analysis-of-Linear-Codes-under-Maximum"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,18]]},"references-count":228,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,7,18]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000009","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,18]]}}}