{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:12:17Z","timestamp":1742965937188,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030611422"},{"type":"electronic","value":"9783030611439"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-61143-9_11","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T11:06:30Z","timestamp":1604574390000},"page":"121-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Threshold Decoding Algorithm for Non-binary OSMLD Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2303-0715","authenticated-orcid":false,"given":"Zakaria","family":"M\u2019rabet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-5301","authenticated-orcid":false,"given":"Fouad","family":"Ayoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2790-0784","authenticated-orcid":false,"given":"Mostafa","family":"Belkasmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"11_CR1","unstructured":"Belkasmi, M., Lahmer, M., Benchrifa, M.: Iterative threshold decoding of parallel concatenated block codes. In: 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding, pp. 1\u20134. VDE (2006)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Belkasmi, M., Lahmer, M., Ayoub, F.: Iterative threshold decoding of product codes constructed from majority logic decodable codes. In: 2006 2nd International Conference on Information & Communication Technologies, vol. 2, pp. 2376\u20132381. IEEE (2006)","DOI":"10.1109\/ICTTA.2006.1684778"},{"key":"11_CR3","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory, vol. 8. McGraw-Hill, New York (1968)"},{"issue":"7","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2001","unstructured":"Kou, Y., Lin, S., Fossorier, M.P.: Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. theory 47(7), 2711\u20132736 (2001)","journal-title":"IEEE Trans. Inf. theory"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1109\/TIT.1972.1054900","volume":"18","author":"S Lin","year":"1972","unstructured":"Lin, S.: Number of information symbols in polynomial codes. IEEE Trans. Inf. Theory 18(6), 785\u2013794 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR6","volume-title":"Error Control Coding","author":"S Lin","year":"2004","unstructured":"Lin, S., Costello, D.: Error Control Coding. Prentice Hall, Upper Saddle River (2004)"},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.21236\/AD0407946","volume-title":"Threshold Decoding","author":"JL Massey","year":"1963","unstructured":"Massey, J.L.: Threshold Decoding. MIT Press, Cambridge (1963)"},{"key":"11_CR8","volume-title":"Error-Correcting Codes","author":"WW Peterson","year":"1972","unstructured":"Peterson, W.W., Weldon, E.J.: Error-Correcting Codes. MIT Press, Cambridge (1972)"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel Codes: Classical and Modern","author":"W Ryan","year":"2009","unstructured":"Ryan, W., Lin, S.: Channel Codes: Classical and Modern. Cambridge University Press, Cambridge (2009)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/TMAG.2003.808600","volume":"39","author":"H Song","year":"2003","unstructured":"Song, H., Cruz, J.R.: Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. IEEE Trans. Mag. 39(2), 1081\u20131087 (2003)","journal-title":"IEEE Trans. Mag."},{"issue":"6","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TIT.2004.828088","volume":"50","author":"H Tang","year":"2004","unstructured":"Tang, H., Xu, J., Kou, Y., Lin, S., Abdel-Ghaffar, K.: On algebraic construction of Gallager and circulant low-density parity-check codes. IEEE Trans. Inf. Theory 50(6), 1269\u20131279 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.2004.840867","volume":"51","author":"H Tang","year":"2005","unstructured":"Tang, H., Xu, J., Lin, S., Abdel-Ghaffar, K.A.: Codes on finite geometries. IEEE Trans. Inf. Theory 51(2), 572\u2013596 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR13","unstructured":"Weldon, E.J.: Euclidean geometry cyclic codes (No. Scientific-13). Hawaii University Honolulu Department of Electrical Engineering (1967)"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/TCOMM.2008.060025","volume":"56","author":"L Zeng","year":"2008","unstructured":"Zeng, L., Lan, L., Tai, Y.Y., Zhou, B., Lin, S., Abdel-Ghaffar, K.A.: Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach. IEEE Trans. Commun. 56(3), 378\u2013387 (2008)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"11_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/TIT.1954.1057465","volume":"4","author":"I Reed","year":"1954","unstructured":"Reed, I.: A class of multiple-error-correcting codes and the decoding scheme. Trans. IRE Prof. Group Inf. Theory 4(4), 38\u201349 (1954)","journal-title":"Trans. IRE Prof. Group Inf. Theory"},{"key":"11_CR16","unstructured":"Rudolph, L.: Geometric configuration and majority logic decodable codes. M.E.E. thesis, University of Oklahoma, Norman (1964)"},{"key":"11_CR17","unstructured":"Davey, M.C., MacKay, D.J.: Low density parity check codes over GF(q). In: 1998 Information Theory Workshop (Cat. No. 98EX131), pp. 70\u201371. IEEE (1998)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"M\u2019rabet, Z., Ayoub, F., Belkasmi, M., Yatribi, A., El Abidine, A.I.Z.: Non-binary Euclidean geometry codes: majority logic decoding. In: 2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS), pp. 1\u20137. IEEE (2016)","DOI":"10.1109\/ACOSIS.2016.7843943"}],"container-title":["Communications in Computer and Information Science","Advanced Communication Systems and Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61143-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T23:33:58Z","timestamp":1723851238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61143-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030611422","9783030611439"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61143-9_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACOSIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Communication Systems and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acosis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acosis.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.14","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.22","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}