{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:03:23Z","timestamp":1750395803261,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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-3-031-20624-5_16","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"255-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Subfield Codes of\u00a0a\u00a0Subclass of\u00a0Optimal Cyclic Codes and\u00a0Their Covering Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4791-485X","authenticated-orcid":false,"given":"F\u00e9lix","family":"Hern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4957-6575","authenticated-orcid":false,"given":"Gerardo","family":"Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998). https:\/\/doi.org\/10.1109\/18.705584","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4\u20135","key":"16_CR2","first-page":"143","volume":"39","author":"AR Calderbank","year":"1984","unstructured":"Calderbank, A.R., Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39(4\u20135), 143\u2013152 (1984)","journal-title":"Philips J. Res."},{"issue":"6","key":"16_CR3","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.847722","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for des-like cryptosystems. Des. Codes Cryptogr. 15, 125\u2013156 (1998). https:\/\/doi.org\/10.1023\/A:1008344232130","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"16_CR5","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding, C., Heng, Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2907276","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81\u201399 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.09.011","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"16_CR7","doi-asserted-by":"publisher","first-page":"3741","DOI":"10.1109\/TIT.2008.926410","volume":"54","author":"C Ding","year":"2008","unstructured":"Ding, C., Yin, J.: Sets of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 54(8), 3741\u20133745 (2008). https:\/\/doi.org\/10.1109\/TIT.2008.926410","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR8","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 4 Aug 2022"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ffa.2018.12.006","volume":"56","author":"Z Heng","year":"2019","unstructured":"Heng, Z., Ding, C.: The subfield codes of hyperoval and conic codes. Finite Fields Appl. 56, 308\u2013331 (2019). https:\/\/doi.org\/10.1016\/j.ffa.2018.12.006","journal-title":"Finite Fields Appl."},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"6872","DOI":"10.1109\/TIT.2020.3006846","volume":"66","author":"Z Heng","year":"2020","unstructured":"Heng, Z., Wang, Q., Ding, C.: Two families of optimal linear codes and their subfield codes. IEEE Trans. Inf. Theory 66(11), 6872\u20136883 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.3006846","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"16_CR11","doi-asserted-by":"publisher","first-page":"4501","DOI":"10.1109\/TIT.2016.2550029","volume":"62","author":"Z Heng","year":"2016","unstructured":"Heng, Z., Yue, Q.: Several classes of cyclic codes with either optimal three weights or a few weights. IEEE Trans. Inf. Theory 62(8), 4501\u20134513 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2550029","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TIT.2008.2008145","volume":"55","author":"C Li","year":"2009","unstructured":"Li, C., Qu, L., Ling, S.: On the covering structures of two classes of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Theory 55(1), 70\u201382 (2009). https:\/\/doi.org\/10.1109\/TIT.2008.2008145","journal-title":"IEEE Trans. Inf. Theory"},{"key":"16_CR14","volume-title":"Finite Fields","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1983)"},{"key":"16_CR15","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory Of Error-Correcting Codes. North-Holland, Amsterdam, The Netherlands (1977)"},{"key":"16_CR16","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279 (1993)"},{"key":"16_CR17","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33\u201347 (1995)"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/ffta.2000.0293","volume":"8","author":"B Schmidt","year":"2002","unstructured":"Schmidt, B., White, C.: All two-weight irreducible cyclic codes? Finite Fields Their Appl. 8(1), 1\u201317 (2002). https:\/\/doi.org\/10.1006\/ffta.2000.0293","journal-title":"Finite Fields Their Appl."},{"issue":"10","key":"16_CR19","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s10623-019-00628-7","volume":"87","author":"M Shi","year":"2019","unstructured":"Shi, M., Sol\u00e9, P.: Three-weight codes, triple sum sets, and strongly walk regular graphs. Des. Codes Crypt. 87(10), 2395\u20132404 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00628-7","journal-title":"Des. Codes Crypt."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ffa.2016.07.001","volume":"42","author":"G Vega","year":"2016","unstructured":"Vega, G.: A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field. Finite Fields Their Appl. 42, 23\u201338 (2016). https:\/\/doi.org\/10.1016\/j.ffa.2016.07.001","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TIT.2005.860412","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206\u2013212 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.860412","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:06:11Z","timestamp":1667084771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","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":"46","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":"0","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":"40% - 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","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":"8.7","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)"}}]}}