{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T05:10:21Z","timestamp":1696569021740},"reference-count":14,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T00:00:00Z","timestamp":1354752000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans. Emerging Tel. Tech."],"published-print":{"date-parts":[[2015,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This letter proposes an effective scheme to improve the error performance of conventional bit\u2010flipping (BF) algorithms for decoding low\u2010density parity\u2010check codes. The proposed scheme, which is referred to as the multiple\u2010candidates (MC) scheme, constructs a set of candidates for the starting vector of the iterative decoding procedure. Each candidate vector in the set is generated by randomly flipping several high error probability bits of the original hard\u2010decision vector. Simulation results show that two typical BF algorithms applying the MC scheme achieve noticeable gains over the original BF algorithms with moderate increase in computational cost. Copyright \u00a9 2012 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/ett.2605","type":"journal-article","created":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T20:05:03Z","timestamp":1354824303000},"page":"503-508","source":"Crossref","is-referenced-by-count":0,"title":["Multiple candidates bit\u2010flipping algorithms for decoding LDPC codes"],"prefix":"10.1002","volume":"26","author":[{"given":"Zhiliang","family":"Huang","sequence":"first","affiliation":[{"name":"National Mobile Communications Research Laboratory Southeast University  Nanjing 210096 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Chen","sequence":"additional","affiliation":[{"name":"National Mobile Communications Research Laboratory Southeast University  Nanjing 210096 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunjuan","family":"Diao","sequence":"additional","affiliation":[{"name":"National Mobile Communications Research Laboratory Southeast University  Nanjing 210096 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua\u2010Min","family":"Chen","sequence":"additional","affiliation":[{"name":"National Mobile Communications Research Laboratory Southeast University  Nanjing 210096 China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2012,12,6]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1390"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1487"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.2564"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1319"},{"key":"e_1_2_7_8_1","first-page":"406","article-title":"Low density parity check codes based on finite geometries: a rediscovery and more","volume":"47","author":"Kou Y","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.825737"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2005.1506712"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.06.090046"},{"key":"e_1_2_7_12_1","volume-title":"Foundations of Genetic Algorithms","author":"Rawlins J","year":"1991"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.09.100594"},{"key":"e_1_2_7_14_1","doi-asserted-by":"crossref","unstructured":"Leduc\u2010primeauF HematiS MannorS GrossW.Lowering error floors using dithered belief propagation.IEEE GLOBECOM 2010 Miami America 2010.","DOI":"10.1109\/GLOCOM.2010.5683799"},{"key":"e_1_2_7_15_1","unstructured":"MacKayD.Database of low\u2010density parity\u2010check codes. [Online]. Available:http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html."}],"container-title":["Transactions on Emerging Telecommunications Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.2605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.2605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T21:47:44Z","timestamp":1696542464000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.2605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,6]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["10.1002\/ett.2605"],"URL":"https:\/\/doi.org\/10.1002\/ett.2605","archive":["Portico"],"relation":{},"ISSN":["2161-3915","2161-3915"],"issn-type":[{"value":"2161-3915","type":"print"},{"value":"2161-3915","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,6]]}}}