{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:54:51Z","timestamp":1729659291668,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icc.2005.1494402","type":"proceedings-article","created":{"date-parts":[[2005,8,16]],"date-time":"2005-08-16T11:17:27Z","timestamp":1124191047000},"page":"500-504","source":"Crossref","is-referenced-by-count":1,"title":["Gear-shift decoding for algorithms with varying complexity"],"prefix":"10.1109","volume":"1","author":[{"given":"M.","family":"Ardakani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.838718"},{"key":"ref11","first-page":"503","article-title":"Hybrid decoding of low-density parity-check codes","author":"zarrinkhat","year":"2003","journal-title":"Proc 3rd Intl Symp on Turbo Codes"},{"key":"ref12","article-title":"On the optimality of Gallager's decoding algorithm B","author":"ardakani","year":"2003","journal-title":"IEEE Trans Inform Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.817545"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/18.910576","article-title":"improved low-density parity-check codes using irregular graphs","volume":"47","author":"luby","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref15","article-title":"Extrinsic information transfer functions: a model and two properties","author":"ashikhmin","year":"2002","journal-title":"Proc Conf Inform Sciences and Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/4234.905935"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-46796-3_7","article-title":"New sequence of linear time erasure codes approaching the channel capacity","author":"shokrollahi","year":"1999","journal-title":"Proceedings of the International Symposium on Applied Algebra Algebraic Algorithms and Error-Correcting Codes Lecture Notes in Computer Science"},{"key":"ref6","first-page":"86","article-title":"Gear-shift decoding","author":"ardakani","year":"2002","journal-title":"Proc 21st Biennial Symp Communications"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref8","first-page":"73","article-title":"Low complexity turbo-like codes","author":"divsalar","year":"2000","journal-title":"Proc 2nd Internat Synp on Turbo Codes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/26.957394"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.910581"}],"event":{"name":"IEEE International Conference on Communications, 2005. ICC 2005. 2005","location":"Seoul, Korea"},"container-title":["IEEE International Conference on Communications, 2005. ICC 2005. 2005"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9996\/32109\/01494402.pdf?arnumber=1494402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T21:55:50Z","timestamp":1586382950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1494402\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icc.2005.1494402","relation":{},"subject":[]}}