{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:23:56Z","timestamp":1770978236968,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319662770","type":"print"},{"value":"9783319662787","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66278-7_5","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T09:34:12Z","timestamp":1503394452000},"page":"48-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance"],"prefix":"10.1007","author":[{"given":"Irina E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Skachek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yauhen","family":"Yakimenka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511984068","volume-title":"Bipartite Graphs and Their Applications","author":"AS Asratian","year":"1998","unstructured":"Asratian, A.S.: Bipartite Graphs and Their Applications, vol. 131. Cambridge University Press, Cambridge (1998)"},{"issue":"12","key":"5_CR2","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1109\/LCOMM.2014.2367097","volume":"18","author":"M Baldi","year":"2014","unstructured":"Baldi, M., Chiaraluce, F., Maturo, N., Liva, G., Paolini, E.: A hybrid decoding scheme for short non-binary LDPC codes. IEEE Commun. Lett. 18(12), 2093\u20132096 (2014)","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/PROC.1980.11696","volume":"68","author":"ER Berlekamp","year":"1980","unstructured":"Berlekamp, E.R.: The technology of error-correcting codes. Proc. IEEE 68(5), 564\u2013593 (1980)","journal-title":"Proc. IEEE"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.2015.2496213","volume":"62","author":"IE Bocharova","year":"2016","unstructured":"Bocharova, I.E., Kudryashov, B., Johannesson, R.: Searching for binary and nonbinary block and convolutional LDPC codes. IEEE Trans. Inform. Theory 62(1), 163\u2013183 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Skachek, V.: Performance of ML decoding for ensembles of binary and nonbinary regular LDPC codes of finite lengths. In: Proceeding of IEEE International Symposium on Information Theory (ISIT), 2017, pp. 794\u2013798 (2017)","DOI":"10.1109\/ISIT.2017.8006637"},{"key":"5_CR6","unstructured":"Bocharova, I.E., Kudryashov, B.D., Skachek, V., Rosnes, E., Ytrehus, \u00d8.: ML and Near-ML Decoding Performance of LDPC Codes over BEC: Bounds and Decoding Algorithms (preprint) (August 2017). http:\/\/kodu.ut.ee\/~vitaly\/Papers\/BEC-bounds\/becbounds.pdf"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Skachek, V., Yakimenka, Y.: Low complexity algorithm approaching the ML decoding of binary LDPC codes. In: Proceeding of IEEE International Symposium on Information Theory (ISIT), 2016, pp. 2704\u20132708 (2016)","DOI":"10.1109\/ISIT.2016.7541790"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Skachek, V., Yakimenka, Y.: Average spectra for ensembles of LDPC codes and their applications. In: Proceeding of IEEE International Symposium on Information (ISIT), 2017, pp. 361\u2013365 (2017)","DOI":"10.1109\/ISIT.2017.8006550"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","volume":"48","author":"C Di","year":"2002","unstructured":"Di, C., Proietti, D., Telatar, I.E., Richardson, T.J., Urbanke, R.L.: Finite-length analysis of low-density parity-check codes on the binary erasure channel. IEEE Trans. Inform. Theory 48(6), 1570\u20131579 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR10","unstructured":"El-Khamy, M., McEliece, R.J.: Bounds on the average binary minimum distance and the maximum likelihood performance of Reed Solomon codes. In: Proceeding of 42nd Allerton Conference on Communication, Control and Computing (2004)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Fang, Y., Zhang, J., Wang, L., Lau, L.: BP-Maxwell decoding algorithm for LDPC codes over AWGN channels. In: 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM), 2010, pp. 1\u20134 (2010)","DOI":"10.1109\/WICOM.2010.5600948"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"J Feldman","year":"2005","unstructured":"Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inform. Theory 51(3), 954\u2013972 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. M.I.T. Press, Cambridge (1963)"},{"key":"5_CR14","unstructured":"Hehn, T., Huber, J.B., Laendner, S.: Improved iterative decoding of LDPC codes from the IEEE WiMAX standard. In: Proceeding International ITG Conference on Source and Channel Coding (SCC), 2010, pp. 1\u20136 (2010)"},{"issue":"12","key":"5_CR15","doi-asserted-by":"publisher","first-page":"5308","DOI":"10.1109\/TIT.2008.2006456","volume":"54","author":"T Hehn","year":"2008","unstructured":"Hehn, T., Milenkovic, O., Laendner, S., Huber, J.B.: Permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes. IEEE Trans. Inform. Theory 54(12), 5308\u20135331 (2008)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR16","unstructured":"Hosoya, G., Matsushima, T., Hirasawa, S.: A decoding method of low-density parity-check codes over the binary erasure channel. In: Proceeding of 27th Symposium on Information Theory and its Applications (SITA), 2004, pp. 263\u2013266 (2004)"},{"issue":"6","key":"5_CR17","first-page":"1725","volume":"94","author":"M Jianjun","year":"2011","unstructured":"Jianjun, M., Xiaopeng, J., Jianguang, L., Rong, S.: Parity-check matrix extension to lower the error floors of irregular LDPC codes. IEICE Trans. Commun. 94(6), 1725\u20131727 (2011)","journal-title":"IEICE Trans. Commun."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Johannesson, R., Zigangirov, K.S.: Fundamentals of Convolutional Coding, vol. 2015. Wiley (2015)","DOI":"10.1002\/9781119098799"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Laendner, S., Hehn, T., Milenkovic, O., Huber, J.B.: When does one redundant parity-check equation matter? In: Global Telecommunications Conference (Globecom), 2006, pp. 1\u20136 (2006)","DOI":"10.1109\/GLOCOM.2006.44"},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1109\/18.992777","volume":"48","author":"S Litsyn","year":"2002","unstructured":"Litsyn, S., Shevelev, V.: On ensembles of low-density parity-check codes: asymptotic distance distributions. IEEE Trans. Inform. Theory 48(4), 887\u2013908 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Olmos, P.M., Murillo-Fuentes, J.J., P\u00e9rez-Cruz, F.: Tree-structure expectation propagation for decoding LDPC codes over binary erasure channels. In: Proceeding of IEEE International Symposium on Information Theory (ISIT), 2010, pp. 799\u2013803 (2010)","DOI":"10.1109\/ISIT.2010.5513636"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TIT.2004.842571","volume":"51","author":"A Orlitsky","year":"2005","unstructured":"Orlitsky, A., Viswanathan, K., Zhang, J.: Stopping set distribution of LDPC code ensembles. IEEE Trans. Inform. Theory 51(3), 929\u2013953 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TIT.2004.824918","volume":"50","author":"H Pishro-Nik","year":"2004","unstructured":"Pishro-Nik, H., Fekri, F.: On decoding of low-density parity-check codes over the binary erasure channel. IEEE Trans. Inform. Theory 50(3), 439\u2013454 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TIT.2006.889701","volume":"53","author":"H Pishro-Nik","year":"2007","unstructured":"Pishro-Nik, H., Fekri, F.: Results on punctured low-density parity-check codes and improved iterative decoding techniques. IEEE Trans. Inform. Theory 53(2), 599\u2013614 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1109\/18.335935","volume":"40","author":"G Poltyrev","year":"1994","unstructured":"Poltyrev, G.: Bounds on the decoding error probability of binary linear codes via their spectra. IEEE Trans. Inform. Theory 40(4), 1284\u20131292 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T Richardson","year":"2008","unstructured":"Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008)"},{"key":"5_CR27","unstructured":"Santhi, N., Vardy, A.: On the effect of parity-check weights in iterative decoding. In: Proceeding of International Symposium on Information Theory (ISIT), Chicago, IL, p. 322 (2004)"},{"issue":"3","key":"5_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/4234.831034","volume":"4","author":"I Sason","year":"2000","unstructured":"Sason, I., Shamai, S.: Improved upper bounds on the ensemble performance of ML decoded low density parity check codes. IEEE Commun. Lett. 4(3), 89\u201391 (2000)","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"5_CR29","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TIT.2005.864441","volume":"52","author":"M Schwartz","year":"2006","unstructured":"Schwartz, M., Vardy, A.: On the stopping distance and the stopping redundancy of codes. IEEE Trans. Inform. Theory 52(3), 922\u2013932 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5_CR30","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1002\/j.1538-7305.1959.tb03905.x","volume":"38","author":"CE Shannon","year":"1959","unstructured":"Shannon, C.E.: Probability of error for optimal codes in a Gaussian channel. Bell Syst. Tech. J. 38(3), 611\u2013656 (1959)","journal-title":"Bell Syst. Tech. J."},{"issue":"7","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/TCOMM.2007.900611","volume":"55","author":"N Varnica","year":"2007","unstructured":"Varnica, N., Fossorier, M.P., Kavcic, A.: Augmented belief propagation decoding of low-density parity check codes. IEEE Trans. Commun. 55(7), 1308\u20131317 (2007)","journal-title":"IEEE Trans. Commun."},{"key":"5_CR32","unstructured":"Vontobel, P.O., K\u00f6tter, R.: Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, arXiv preprint cs\/0512078 (2005)"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Yakimenka, Y., Skachek, V.: Refined upper bounds on stopping redundancy of binary linear codes. In: Proceeding of IEEE Information Theory Workshop (ITW), 2015, pp. 1\u20135 (2015)","DOI":"10.1109\/ITW.2015.7133087"},{"key":"5_CR34","unstructured":"Yedidia, J.S., Chen, J., Fossorier, M.: Generating code representations suitable for belief propagation decoding. In: Proceeding of 40-th Allerton Conference Communication, Control, and Computing, Monticello, IL (2002)"},{"issue":"7","key":"5_CR35","doi-asserted-by":"publisher","first-page":"4848","DOI":"10.1109\/TIT.2012.2193661","volume":"58","author":"J Zumbr\u00e4gel","year":"2012","unstructured":"Zumbr\u00e4gel, J., Flanagan, M.F., Skachek, V.: On the pseudocodeword redundancy of binary linear codes. IEEE Trans. Inform. Theory 58(7), 4848\u20134861 (2012)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66278-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:04:18Z","timestamp":1710345858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66278-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662770","9783319662787"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66278-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMCTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Castle Meeting on Coding Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vihula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmcta2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.castle-meeting-2017.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}