{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:37:57Z","timestamp":1742913477352,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811623769"},{"type":"electronic","value":"9789811623776"}],"license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-2377-6_49","type":"book-chapter","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:44:09Z","timestamp":1632447849000},"page":"523-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Construction of Some Good Binary Linear Codes Using Hadamard Matrix and BCH Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4944-2171","authenticated-orcid":false,"given":"Driss","family":"Khebbou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8521-3184","authenticated-orcid":false,"given":"Reda","family":"Benkhouya","sequence":"additional","affiliation":[]},{"given":"Idriss","family":"Chana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,24]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379\u2013423. https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst Tech J"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming RW (1950) Error detecting and error correcting codes. Bell Syst Tech J 29:147\u2013160. https:\/\/doi.org\/10.1002\/j.1538-7305.1950.tb00463.x","journal-title":"Bell Syst Tech J"},{"key":"49_CR3","unstructured":"Marcel Golay (1949) Notes on digital coding"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-51103-0_1","volume-title":"Error-correction coding and decoding: bounds, codes, decoders, analysis and applications","author":"M Tomlinson","year":"2017","unstructured":"Tomlinson M, Tjhai CJ, Ambroze MA, Ahmed M, Jibril M (2017) Bounds on error-correction coding performance. In: Tomlinson M, Tjhai CJ, Ambroze MA, Ahmed M, Jibril M (eds) Error-correction coding and decoding: bounds, codes, decoders, analysis and applications. Springer International Publishing, Cham, pp 3\u201323"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/18.135638","volume":"38","author":"D Augot","year":"1992","unstructured":"Augot D, Charpin P, Sendrier N (1992) Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans Inf Theory 38:960\u2013973. https:\/\/doi.org\/10.1109\/18.135638","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/18.272483","volume":"40","author":"D Augot","year":"1994","unstructured":"Augot D, Sendrier N (1994) Idempotents and the BCH bound. IEEE Trans Inf Theory 40:204\u2013207. https:\/\/doi.org\/10.1109\/18.272483","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BF02685830","volume":"13","author":"Y Dianwu","year":"1996","unstructured":"Dianwu Y, Zhengming H (1996) On the dimension and minimum distance of BCH codes over GF(q). J Electron China 13:216\u2013221. https:\/\/doi.org\/10.1007\/BF02685830","journal-title":"J Electron China"},{"key":"49_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TIT.1960.1057586","volume":"6","author":"W Peterson","year":"1960","unstructured":"Peterson W (1960) Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans Inf Theory 6:459\u2013470. https:\/\/doi.org\/10.1109\/TIT.1960.1057586","journal-title":"IRE Trans Inf Theory"},{"key":"49_CR9","unstructured":"Spence LE, Insel AJ, Friedberg S (1999) Elementary Linear algebra: a matrix approach. presented at the (1999)"},{"key":"49_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0470035706","volume-title":"The art of error correcting coding","author":"RH Morelos-Zaragoza","year":"2006","unstructured":"Morelos-Zaragoza RH (2006) The art of error correcting coding. John Wiley & Sons Inc., Hoboken, NJ, USA"},{"key":"49_CR11","unstructured":"Hadamard J (1893) RESOLUTION D\u2019UNE QUESTION RELATIVE AUX DETERMINANTS\u2014in Bulletin des Sciences Mathematiques, Septembre 1893. See Description (1893)"},{"key":"49_CR12","unstructured":"Hadamard Matrix\u2014an overview | ScienceDirect Topics, https:\/\/www.sciencedirect.com\/topics\/computer-science\/hadamard-matrix"},{"key":"49_CR13","unstructured":"Grassl, Markus Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy A (1997) The intractability of computing the minimum distance of a code. IEEE Trans Inf Theory 43:1757\u20131766. https:\/\/doi.org\/10.1109\/18.641542","journal-title":"IEEE Trans Inf Theory"},{"key":"49_CR15","unstructured":"Bozzano Luisa. Handbook of Coding Theory, Volume II\u20141st Edition, https:\/\/www.elsevier.com\/books\/handbook-of-coding-theory\/luisa\/978-0-444-50087-8"},{"key":"49_CR16","volume-title":"Integral Hecke modules, integral generalized reed-Muller codes, and linear codes","author":"K-H Zimmermann","year":"1996","unstructured":"Zimmermann K-H (1996) Integral Hecke modules, integral generalized reed-Muller codes, and linear codes. Techn Univ, Hamburg-Harburg"},{"key":"49_CR17","unstructured":"The GAP Group, http:\/\/www.gap-system.org"},{"key":"49_CR18","unstructured":"Robert H. Morelos-Zaragoza: The Art of Error Correcting Coding, http:\/\/the-art-of-ecc.com\/"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of Sixth International Congress on Information and Communication Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-2377-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T18:15:24Z","timestamp":1644430524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-2377-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"ISBN":["9789811623769","9789811623776"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-2377-6_49","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,9,24]]},"assertion":[{"value":"24 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}