{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:45:03Z","timestamp":1773081903462,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icc.2004.1312511","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"361-364","source":"Crossref","is-referenced-by-count":25,"title":["The all-zero iterative decoding algorithm for turbo code minimum distance computation"],"prefix":"10.1109","author":[{"given":"R.","family":"Garello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vila-Casado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Optimization of the Turbo Code Constrained Subcode Algorithm","author":"garello","year":"2003","journal-title":"To be sumbitted"},{"key":"ref11","article-title":"Web page on turbo code minimum distance algorithm","author":"garello","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023354"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICTEL.2003.1191190"},{"key":"ref14","article-title":"Distance Measurement Method for Double Binary Turbo Codes and a New Interleaver Design for DVB-RCS","author":"mouhamedou","year":"2004","journal-title":"Submitted to Globecom 2004 Conference"},{"key":"ref15","article-title":"Private communications","author":"douillard","year":"2003"},{"key":"ref16","article-title":"Telemetry Channel Coding","year":"1999","journal-title":"Blue Book 101 0-B-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref3","article-title":"DVB-S2 Coding Standard Proposal","year":"2003","journal-title":"DVB-S2 Standardization Committee Geneva"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.556666"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref8","first-page":"251","article-title":"An Efficient Algorithm for Obtaining the Distance Spectrum of Turbo Codes","author":"daneshgaran","year":"1997","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1994.512991"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/49.924864"},{"key":"ref1","first-page":"1017","article-title":"Computing the Minimum Distance of Linear Codes by the Error Impulse Method","author":"berrou","year":"2002","journal-title":"IEEE Global Telecommunications Conference GLOBE-COM"},{"key":"ref9","first-page":"219","article-title":"A Method for Determining the Distance Profile of Turbo Codes","author":"breiling","year":"2000","journal-title":"Proc ITG Congr Source and Channel Coding"}],"event":{"name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","location":"Paris, France","start":{"date-parts":[[2004,6,24]]},"end":{"date-parts":[[2004,6,24]]}},"container-title":["2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9179\/29118\/01312511.pdf?arnumber=1312511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T21:39:57Z","timestamp":1489441197000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1312511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icc.2004.1312511","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}