{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T12:06:37Z","timestamp":1769342797763,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T00:00:00Z","timestamp":1570233600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10623-019-00682-1","type":"journal-article","created":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T07:03:01Z","timestamp":1570258981000},"page":"257-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Four classes of minimal binary linear codes with $$w_{min}\/w_{max}<1\/2$$ derived from Boolean functions"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9925-1026","authenticated-orcid":false,"given":"Xia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"key":"682_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"RJ Anderson","year":"1998","unstructured":"Anderson R.J., Ding C., Helleseth T., Kl\u00f8ve T.: How to build robust shared control systems. Des. Codes Cryptogr. 15, 111\u2013124 (1998).","journal-title":"Des. Codes Cryptogr."},{"key":"682_CR2","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, 2010\u20132017 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR3","doi-asserted-by":"publisher","first-page":"4152","DOI":"10.1109\/TIT.2019.2891992","volume":"65","author":"D Bartoli","year":"2019","unstructured":"Bartoli D., Bonini M.: Minimal linear codes in odd characteristic. IEEE Trans. Inf. Theory 65, 4152\u20134155 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR4","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 highly nonlinear functions and their secret sharing schemes. IEEE Trans. Inf. Theory 51, 2089\u20132102 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-319-12160-4_3","volume-title":"Information Security and Cryptology -- ICISC 2013","author":"Herv\u00e9 Chabanne","year":"2014","unstructured":"Chabanne H., Cohen G., Patey A.: Towards secure two-party computation from the wire-tap channel. In: Information Security and Cryptology-ICISC 2013, Lecture Notes in Comput. Sci., vol. 8565, pp. 34\u201346. Springer, Cham (2014)."},{"key":"682_CR6","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang S., Hyun J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86, 2167\u20132181 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"682_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-45239-0_6","volume-title":"Cryptography and Coding","author":"G\u00e9rard D. Cohen","year":"2013","unstructured":"Cohen G.D., Mesnager S., Patey A.: On minimal and quasi-minimal linear codes. In: IMA International Conference on Cryptography and Coding. Lecture Notes Cryptography and coding, vol. 8308, pp. 85-98. Springer, Heidelberg (2013)."},{"key":"682_CR8","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61, 3265\u20133275 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR9","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61, 5835\u20135842 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"Cunsheng Ding","year":"2003","unstructured":"Ding C., Yuan J.: Covering and secret sharing with linear codes. In: Discrete Mathematics and Theoretical Computer Science. Lecture Notes Computer Science, vol. 2731, pp. 11\u201325. Springer, Berlin (2003)."},{"key":"682_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.disc.2015.09.001","volume":"339","author":"C Ding","year":"2016","unstructured":"Ding C., Li C., Li N., Zhou Z.: Three-weight cyclic codes and their weight distributions. Discret. Math. 339, 415\u2013427 (2016).","journal-title":"Discret. Math."},{"key":"682_CR12","doi-asserted-by":"publisher","first-page":"6536","DOI":"10.1109\/TIT.2018.2819196","volume":"64","author":"C Ding","year":"2018","unstructured":"Ding C., Heng Z., Zhou Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory 64, 6536\u20136545 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR13","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s12095-018-0339-9","volume":"11","author":"Y Gao","year":"2019","unstructured":"Gao Y., Liu Z., Liu Y.: The separation of binary relative three-weight codes and its applications. Cryptogr. Commun. 11, 979\u2013992 (2019).","journal-title":"Cryptogr. Commun."},{"key":"682_CR14","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/LCOMM.2015.2455032","volume":"19","author":"Z Heng","year":"2015","unstructured":"Heng Z., Yue Q.: A class of binary linear codes with at most three weights. IEEE Commun. Lett. 19, 1488\u20131491 (2015).","journal-title":"IEEE Commun. Lett."},{"key":"682_CR15","doi-asserted-by":"publisher","first-page":"2832","DOI":"10.1016\/j.disc.2016.05.033","volume":"339","author":"Z Heng","year":"2016","unstructured":"Heng Z., Yue Q., Li C.: Three classes of linear codes with two or three weights. Discret. Math. 339, 2832\u20132847 (2016).","journal-title":"Discret. Math."},{"key":"682_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ffa.2018.08.010","volume":"54","author":"Z Heng","year":"2018","unstructured":"Heng Z., Ding C., Zhou Z.: Minimal linear codes over finite fields. Finite Field Appl. 54, 176\u2013196 (2018).","journal-title":"Finite Field Appl."},{"key":"682_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ffa.2014.01.009","volume":"28","author":"C Li","year":"2014","unstructured":"Li C., Yue Q.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Field Appl. 28, 94\u2013114 (2014).","journal-title":"Finite Field Appl."},{"key":"682_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-013-9896-2","volume":"75","author":"Z Liu","year":"2015","unstructured":"Liu Z., Wu W.: On relative constant-weight codes. Des. Codes Cryptogr. 75, 127\u2013144 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"682_CR19","unstructured":"Massey J.L.: Minimal codewords and secret sharing. In: Proc. 6th Joint Swedish-Russian Workshop on Information Theory, pp. 246\u2013249 (1993)."},{"key":"682_CR20","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1109\/TIT.2016.2518678","volume":"62","author":"C Tang","year":"2016","unstructured":"Tang C., Li N., Qi Y., Zhou Z., Helleseth T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62, 1166\u20131176 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/LCOMM.2015.2497344","volume":"20","author":"C Tang","year":"2016","unstructured":"Tang C., Qi Y., Huang D.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20, 29\u201332 (2016).","journal-title":"IEEE Commun. Lett."},{"key":"682_CR22","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, 206\u2013212 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"682_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00200-018-0367-x","volume":"30","author":"W Zhang","year":"2019","unstructured":"Zhang W., Yan H., Wei H.: Four families of minimal binary linear codes with $$w_{\\min }\/w_{\\max }\\le 1\/2$$. Appl. Algebr. Eng. Commun. Comput. 30, 175\u2013184 (2019).","journal-title":"Appl. Algebr. Eng. Commun. Comput."},{"key":"682_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10623-015-0144-9","volume":"81","author":"Z Zhou","year":"2016","unstructured":"Zhou Z., Li N., Fan C., Helleseth T.: Linear codes with two or three weights from quadratic Bent functions. Des. Codes Cryptogr. 81, 283\u2013295 (2016).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00682-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00682-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00682-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T09:17:13Z","timestamp":1695287833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00682-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["682"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00682-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,5]]},"assertion":[{"value":"8 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}