{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:38:54Z","timestamp":1743025134456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_8","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T11:06:30Z","timestamp":1604574390000},"page":"95-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Semi-Algebraic Decoding Algorithm for Golay Code"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9966-651X","authenticated-orcid":false,"given":"Hamza","family":"Boualame","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idriss","family":"Chana","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":"8_CR1","doi-asserted-by":"crossref","unstructured":"Boualame, H., Chana, I., Belkasmi; M.: New efficient decoding algorithm of the (17, 9, 5) quadratic residue code. In: International Conference on Advanced Communication Technologies and Networking (CommNet), Marrakech, pp. 1\u20136 (2018)","DOI":"10.1109\/COMMNET.2018.8360258"},{"key":"8_CR2","unstructured":"Prange, E.: Some cyclic error-correcting codes with simple decoding algorithms. Air Force Cambridge Res. Center, Bedford, MA, USA, TN-58-156 (1958)"},{"key":"8_CR3","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"key":"8_CR4","unstructured":"Berlekamp, E. R.: Algebraic Coding Theory, revised edn. McGraw-Hill, Aegean Park Press (1984)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TIT.1987.1057262","volume":"33","author":"M Elia","year":"1987","unstructured":"Elia, M.: Algebraic decoding of the (23, 12, 7) Golay codes. IEEE Trans. Inf. Theory 33(1), 150\u2013151 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"8_CR6","first-page":"1654","volume":"40","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, T.K.: Use of Grobner bases to decode binary cyclic codes up to the true minimum distance. IEEE Trans. Commun. 40(5), 1654\u20131661 (1994)","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/18.53750","volume":"36","author":"I Reed","year":"1990","unstructured":"Reed, I., Yin, X., Truong, T.K.: Algebraic decoding of the (32,16,8) quadratic residue code. IEEE Trans. Inf. Theory 36(4), 876\u2013880 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/18.135639","volume":"38","author":"I Reed","year":"1992","unstructured":"Reed, I., Truong, T.K., Chen, X., Yin, X.: The algebraic decoding of the (41 21 9) quadratic residue code. IEEE Trans. Inf. Theory 38(3), 974\u2013986 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/18.915677","volume":"47","author":"R He","year":"2001","unstructured":"He, R., Reed, I.S., Truong, T.K., Chen, X.: Decoding the (47, 24, 11) quadratic residue code. IEEE Trans. Inf. Theory 47, 1181\u20131186 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1109\/TCOMM.2003.816994","volume":"51","author":"Y Chang","year":"2003","unstructured":"Chang, Y., Truong, T.K., Reed, I.S., Cheng, H.Y., Lee, C.D.: Algebraic decoding of (71, 36, 11), (79, 40, 15), and (97, 49, 15) quadratic residue codes. IEEE Trans. Commun. 51, 1463\u20131473 (2003)","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"8_CR11","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/TCOMM.2012.122712.120287","volume":"61","author":"L Wang","year":"2013","unstructured":"Wang, L., Li, Y., Truong, T.K., Lin, T.: On decoding of the (89, 45, 17) quadratic residue code. IEEE Trans. Commun. 61(3), 832\u2013841 (2013)","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"8_CR12","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1109\/TCOMM.2014.2333663","volume":"62","author":"Y Li","year":"2014","unstructured":"Li, Y., Liu, H., Chen, Q., Truong, T.K.: On decoding of the (73, 37, 13) quadratic residue code. IEEE Trans. Commun. 62(8), 2615\u20132625 (2014)","journal-title":"IEEE Trans. Commun."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"2470","DOI":"10.1016\/j.ins.2009.03.011","volume":"179","author":"YH Chen","year":"2009","unstructured":"Chen, Y.H., Truong, T.K., Huang, C.H., Chien, C.H.: A lookup table decoding of systematic (47, 24, 11) quadratic residue code. Inf. Sci. 179, 2470\u20132477 (2009)","journal-title":"Inf. Sci."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1049\/iet-com.2015.0546","volume":"10","author":"CH Chien","year":"2016","unstructured":"Chien, C.H., Huang, C.H., Chang, J.: Decoding of binary quadratic residue codes with hash table. IET Commun. 10(1), 122\u2013130 (2016)","journal-title":"IET Commun."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T11:23:21Z","timestamp":1604575401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61143-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030611422","9783030611439"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61143-9_8","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)"}}]}}