{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T06:09:10Z","timestamp":1744265350202},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. T\u00e9l\u00e9commun."],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/bf03219809","type":"journal-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:33:22Z","timestamp":1625639602000},"page":"103-131","source":"Crossref","is-referenced-by-count":6,"title":["Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes"],"prefix":"10.1007","volume":"60","author":[{"given":"Pirouz","family":"Zarrinkhat","sequence":"first","affiliation":[]},{"given":"Amir H.","family":"Banihashemi","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03219809_CR1","unstructured":"Ardakani (M.),Kschischang (F. R.), Gear-shift decoding.Proc. 21\n                  \n                    st\n                  \n                  Biennial Symp. Commun. (June 2002), Kingston, on, Canada, pp. 86\u201390."},{"key":"BF03219809_CR2","unstructured":"Banihashemi (A. H.),Nouh (A.),Zarrinkhat (P.), Hybrid (multistage) decoding of low-density parity-check (LDPC) codes.Proc. 40\n                  \n                    th\n                  \n                  Allerton Conf. Commun., Control, and Computing, Allerton,il, usa, pp. 1437\u20131438, October 2002."},{"key":"BF03219809_CR3","unstructured":"Berrou (C.),Glavieux (A.),Thitimajshima (P.), Near Shannon limit error-correcting coding and decoding: Turbo-codes (I).Conf. Rec. Int\u2019l Conf. Commun., pp. 1064\u20131070, May 1993."},{"key":"BF03219809_CR4","unstructured":"\u201cCodes on graphs and iterative algorithms\u201d,IEEE Trans. Inform. Theory,47, no 2, February 2001."},{"key":"BF03219809_CR5","unstructured":"Divsalar (D.),Dolinar (S.),Pollara (F), Low complexity turbo-like codes.Proc. 2\n                  \n                    nd\n                  \n                  Int\u2019l Symp. Turbo Codes & Related Topics, Brest, France, pp. 73\u201380, September 2000."},{"key":"BF03219809_CR6","unstructured":"El Gamal (H.), On the theory and applications of space-time and graph based codes. Ph.D. dissertation, Univ. Maryland, College Park, May 2000."},{"key":"BF03219809_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"(R. G.) Gallager","year":"1963","unstructured":"Gallager (R. G.), Low-Density Parity-Check Codes. Cambridge, MA:MIT Press, 1963."},{"key":"BF03219809_CR8","unstructured":"http:\/\/www.eetimes.com\/semi\/news\/OEG20030505S0074"},{"issue":"2","key":"BF03219809_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.910575","volume":"47","author":"(M. G.) Luby","year":"2001","unstructured":"Luby (M. G.), Mitzenmacher (M.), Shokrollahi (M. A.), Spielman (D. A.), Efficient erasure correcting codes,IEEE Trans. Inform. Theory,47, no 2, pp. 569\u2013584, February 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"BF03219809_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/18.910576","volume":"47","author":"(M. G.) Luby","year":"2001","unstructured":"Luby (M. G.), Mitzenmacher (M.), Shokrollahi (M. A.), Spielman (D. A.), Improved low-density parity-check codes using irregular graphs.IEEE Trans. Inform. Theory,47, no 2, pp. 585\u2013598, February 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF03219809_CR11","doi-asserted-by":"crossref","unstructured":"Mackay (D. J. C.),Neal (R. M.), Good codes based on very sparse matrices.Proc. 5\n                  \n                    th\n                  \n                  IMA Conf. Crypto. Coding, pp. 100\u2013111, December 1995.","DOI":"10.1007\/3-540-60693-9_13"},{"issue":"1","key":"BF03219809_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02579283","volume":"2","author":"(G. A.) Margulis","year":"1982","unstructured":"Margulis (G. A.), Explicit constructions of graphs without short cycles and low density codes,Combinatorica,2, no 1, pp. 71\u201378, 1982.","journal-title":"Combinatorica"},{"key":"BF03219809_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/AD0407946","volume-title":"Threshold Decoding","author":"(J. L.) Massey","year":"1963","unstructured":"Massey (J. L.), Threshold Decoding. Cambridge, MA: MITPress, 1963."},{"issue":"2","key":"BF03219809_CR14","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"(T. J.) Richardson","year":"2001","unstructured":"Richardson (T. J.), Shokrollahi (M. A.), Urbanke (R. L.), Design of capacity-approaching irregular low-density parity-check codes,IEEE Trans. Inform. Theory,47, no 2, pp. 619\u2013637, February 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"BF03219809_CR15","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"(T. J.) Richardson","year":"2001","unstructured":"Richardson (T. J.), Urbanke (R. L.), The capacity of low-density parity-check codes under message-passing decoding,IEEE Trans. Inform. Theory,47, no 2, pp. 599\u2013618, February 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF03219809_CR16","unstructured":"Sipser (M.),Spielman (D. A.), Expander codes.Proc. 35\n                  \n                    th\n                  \n                  IEEE Symp. Found. Comp. Sci., pp. 566\u2013576, November 1994."},{"issue":"5","key":"BF03219809_CR17","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"(R. M.) Tanner","year":"1981","unstructured":"Tanner (R. M.), A recursive approach to low complexity codes,IEEE Trans. Inform. Theory,27, no 5, pp. 533\u2013547, September 1981.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF03219809_CR18","unstructured":"ten Brink (S.), Iterative decoding trajectories of parallel concatenated codes.Proc. 3\n                  \n                    rd\n                  \n                  ieee\/ITG\n                  Conf. Source and Channel Coding, Munich, Germany, pp. 75\u201380, January 2000."},{"key":"BF03219809_CR19","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1109\/26.957394","volume":"49","author":"(S.) ten Brink","year":"2001","unstructured":"ten Brink (S.), Convergence behavior of iteratively decoded parallel concatenated codes,IEEE Trans. Commun.,49, pp.1727\u20131737, October 2001.","journal-title":"IEEE Trans. Commun."},{"key":"BF03219809_CR20","doi-asserted-by":"crossref","unstructured":"\u201cThe turbo principle: from theory to practice\u201d;IEEE J. Select. Areas Commun.,19, no 5, May 2001.","DOI":"10.1109\/JSAC.2001.924863"},{"key":"BF03219809_CR21","doi-asserted-by":"crossref","unstructured":"\u201cThe turbo principle: from theory to practice\u201d,IEEE J. Select. Areas Commun.,19, no 9, September 2001.","DOI":"10.1109\/JSAC.2001.924863"},{"issue":"5","key":"BF03219809_CR22","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/ett.4460060507","volume":"6","author":"(N.) Wiberg","year":"1995","unstructured":"Wiberg (N.), Loeliger (H. A.), Kotter (R.), Codes and iterative decoding on general graphs.Euro. Trans. Telecomm.,6, no 5, pp. 513\u2013526, September 1995.","journal-title":"Euro. Trans. Telecomm."},{"key":"BF03219809_CR23","unstructured":"Zarrinkhat (P.),Banihashemi (A. H.), Density-evolution and convergence properties of majority-based algorithms for decoding low-density parity-check (LDPC) codes.Proc. 40\n                  \n                    th\n                  \n                  Allerton Conf. Commun., Control, and Computing, Allerton, IL, USA, pp. 1425\u20131434, October 2002."},{"key":"BF03219809_CR24","unstructured":"Zarrinkhat (P.),Banihashemi (A. H.), Dynamics of hybrid message-passing decoding algorithms for low-density parity-check codes.Proc. 3\n                  \n                    rd\n                  \n                  Int\u2019l Symp. Turbo Codes & Related Topics, Brest, France, pp. 503\u2013506, September 2003."},{"key":"BF03219809_CR25","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/LCOMM.2004.827438","volume":"8","author":"(P.) Zarrinkhat","year":"2004","unstructured":"Zarrinkhat (P.), Banihashemi (A. H.), Hybrid hard-decision iterative decoding of regular low-density parity-check codes,IEEE Commun. Lett., 8, pp. 250\u2013252, April 2004.","journal-title":"IEEE Commun. Lett."},{"key":"BF03219809_CR26","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1109\/TCOMM.2004.838738","volume":"52","author":"(P.) Zarrinkhat","year":"2004","unstructured":"Zarrinkhat (P.), Banihashemi (A. H.), Threshold values and convergence properties of majority-based algorithms for decoding regular low-density parity-check codes,IEEE Trans. Commun.,52, pp. 2087\u20132097, December 2004.","journal-title":"IEEE Trans. Commun."},{"key":"BF03219809_CR27","unstructured":"Zigangirov (K. Sh.),Lentmaier (M.), On the asymptotic iterative decoding performance of low-density parity-check codes.Proc. 2\n                  \n                    nd\n                  \n                  Int\u2019l Symp. Turbo Codes & Related Topics, Brest, France, pp. 39\u201342, September 2000."},{"issue":"1","key":"BF03219809_CR28","first-page":"23","volume":"11","author":"(V. V.) Zyablov","year":"1975","unstructured":"Zyablov (V. V.), Pinsker (M. S.), Estimation of the error-correction complexity for Gallager low-density codes.Probl. Peredach. Inform.,11, no 1, pp. 23\u201326, January\u2013March 1975.","journal-title":"Probl. Peredach. Inform."}],"container-title":["Annales Des T\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219809.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF03219809\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03219809.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T07:03:20Z","timestamp":1625641400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF03219809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["BF03219809"],"URL":"https:\/\/doi.org\/10.1007\/bf03219809","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}