{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:18Z","timestamp":1740133938322,"version":"3.37.3"},"reference-count":24,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61772022"],"award-info":[{"award-number":["61772022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11971395"],"award-info":[{"award-number":["11971395"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCI201910"],"award-info":[{"award-number":["GCI201910"]}]},{"name":"National Key Research and Development Program of China","award":["2018YFB0704400"],"award-info":[{"award-number":["2018YFB0704400"]}]},{"name":"National Nature Science Foundation of Shanghai","award":["19ZR1417700"],"award-info":[{"award-number":["19ZR1417700"]}]},{"name":"Research and Development Program in Key Areas of Guangdong Province","award":["2018B010113001"],"award-info":[{"award-number":["2018B010113001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p> Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial [Formula: see text]-designs have attracted lots of research interest for decades. The interplay between coding theory and [Formula: see text]-designs started many years ago. It is generally known that [Formula: see text]-designs can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight in a code also may hold a [Formula: see text]-design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of [Formula: see text]-designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of [Formula: see text]-designs are calculated explicitly. <\/jats:p>","DOI":"10.1142\/s0129054121500143","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T13:38:13Z","timestamp":1610977093000},"page":"253-267","source":"Crossref","is-referenced-by-count":0,"title":["Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions"],"prefix":"10.1142","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5986-6015","authenticated-orcid":false,"given":"Rong","family":"Wang","sequence":"first","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University, Lanzhou, Gansu 730070, China"},{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin, Guangxi 541004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3997-7196","authenticated-orcid":false,"given":"Xiaoni","family":"Du","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University, Lanzhou, Gansu 730070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Mathematics, Southwest Jiaotong University, Chengdu, Sichuan 610000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihua","family":"Niu","sequence":"additional","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shanghai, 200444, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"S0129054121500143BIB001","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836"},{"key":"S0129054121500143BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80115-8"},{"key":"S0129054121500143BIB003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549533"},{"key":"S0129054121500143BIB004","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541"},{"volume-title":"Codes from Difference Sets","year":"2015","author":"Ding C.","key":"S0129054121500143BIB005"},{"key":"S0129054121500143BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/11101"},{"key":"S0129054121500143BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0352-6"},{"key":"S0129054121500143BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.05.013"},{"key":"S0129054121500143BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2473861"},{"key":"S0129054121500143BIB013","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21682"},{"key":"S0129054121500143BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2004.06.002"},{"key":"S0129054121500143BIB015","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"S0129054121500143BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"S0129054121500143BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90691-2"},{"key":"S0129054121500143BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00010-G"},{"key":"S0129054121500143BIB019","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025484821641"},{"key":"S0129054121500143BIB021","series-title":"Volume 20 of Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"Lidl R.","year":"1997"},{"key":"S0129054121500143BIB022","series-title":"North-Holland Mathematical Library","volume-title":"The Theory of Error-Correcting Codes. I","volume":"16","author":"MacWilliams F. J.","year":"1977"},{"key":"S0129054121500143BIB023","first-page":"1","volume":"18","author":"Reid C.","year":"2010","journal-title":"The Electronic Journal of Combinatorics"},{"key":"S0129054121500143BIB024","unstructured":"V. D. Tonchev,  Codes and Designs, In   V. Pless and  W. C. Huffman, editors,  Handbook of coding theory, Vol.  I, II,  (North-Holland,  Amsterdam,  1998),  pp. 1229\u20131267."},{"key":"S0129054121500143BIB025","unstructured":"V. D. Tonchev,  Codes, In   C. J. Colbourn and  J. H. Dinitz, editors,  Handbook of combinatorial designs, Discrete Mathematics and its Applications (Boca Raton),  Second edition  (Chapman & Hall\/CRC,  Boca Raton, FL,  2007),  pp. xxii+984."},{"key":"S0129054121500143BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0267-7"},{"key":"S0129054121500143BIB028","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1995.1133"},{"key":"S0129054121500143BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2012.06.001"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054121500143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T11:14:49Z","timestamp":1618312489000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054121500143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":24,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.1142\/S0129054121500143"],"URL":"https:\/\/doi.org\/10.1142\/s0129054121500143","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2021,1,18]]}}}