{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:41:14Z","timestamp":1773704474080,"version":"3.50.1"},"reference-count":25,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:p xml:lang=\"fr\">&lt;p style='text-indent:20px;'&gt;The intersection of a linear code and its dual is called the hull of this code. The code is a linear complementary dual (LCD) code if the dimension of its hull is zero. In this paper, we develop a method to construct LCD codes and linear codes with one-dimensional hull by association schemes. One of constructions in this paper generalizes that of linear codes associated with Gauss periods given in [&lt;xref ref-type=\"bibr\" rid=\"b5\"&gt;5&lt;\/xref&gt;]. In addition, we present a generalized construction of linear codes, which can provide more LCD codes and linear codes with one-dimensional hull. We also present some examples of LCD MDS, LCD almost MDS codes, and MDS, almost MDS codes with one-dimensional hull from our constructions.&lt;\/p&gt;<\/jats:p>","DOI":"10.3934\/amc.2020114","type":"journal-article","created":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T01:57:25Z","timestamp":1603850245000},"page":"349","source":"Crossref","is-referenced-by-count":7,"title":["Constructions of linear codes with small hulls from association schemes"],"prefix":"10.3934","volume":"16","author":[{"given":"Ye","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ran","family":"Tao","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020114-1","unstructured":"E. Bannai and T. Ito, <i>Algebraic Combinatorics I: Association Schemes<\/i>, The Benjamin\/Cummings, London, 1984."},{"key":"key-10.3934\/amc.2020114-2","doi-asserted-by":"publisher","unstructured":"L. D. Baumert, W. H. Mills, R. L. Ward.Uniform cyclotomy, <i>J. Number Theory<\/i>, <b>14<\/b> (1982), 67-82.","DOI":"10.1016\/0022-314X(82)90058-0"},{"key":"key-10.3934\/amc.2020114-3","doi-asserted-by":"publisher","unstructured":"A. E. Brouwer, A. M. Cohen and A. Neumaier, <i>Distance-regular Graphs<\/i>, Springer-Verlag, Berlin, 1989.","DOI":"10.1007\/978-3-642-74341-2"},{"key":"key-10.3934\/amc.2020114-4","doi-asserted-by":"publisher","unstructured":"C. Carlet, S. Guilley.Complementary dual codes for counter-measures to side-channel attacks, <i>Adv. Math. Commun.<\/i>, <b>10<\/b> (2016), 131-150.","DOI":"10.3934\/amc.2016.10.131"},{"key":"key-10.3934\/amc.2020114-5","doi-asserted-by":"publisher","unstructured":"C. Carlet, C. Li, S. Mesnager.Linear codes with small hulls in semi-primitive case, <i>Des. Codes Cryptogr.<\/i>, <b>87<\/b> (2019), 3063-3075.","DOI":"10.1007\/s10623-019-00663-4"},{"key":"key-10.3934\/amc.2020114-6","doi-asserted-by":"publisher","unstructured":"C. Carlet, S. Mesnager, C. Tang, Y. Qi.Euclidean and Hermitian LCD MDS codes, <i>Des. Codes Cryptogr.<\/i>, <b>86<\/b> (2018), 2605-2618.","DOI":"10.1007\/s10623-018-0463-8"},{"key":"key-10.3934\/amc.2020114-7","doi-asserted-by":"publisher","unstructured":"C. Carlet, S. Mesnager, C. Tang, Y. Qi.New characterization and parametrization of LCD codes, <i>IEEE Trans. Inform. Theory<\/i>, <b>65<\/b> (2019), 39-49.","DOI":"10.1109\/TIT.2018.2829873"},{"key":"key-10.3934\/amc.2020114-8","doi-asserted-by":"publisher","unstructured":"C. Carlet, S. Mesnager, C. Tang, Y. Qi, R. Pellikaan.Linear codes over $\\Bbb F_q$ are equivalent to LCD codes for $q&gt;3$, <i>IEEE Trans. Inform. Theory<\/i>, <b>64<\/b> (2018), 3010-3017.","DOI":"10.1109\/TIT.2018.2789347"},{"key":"key-10.3934\/amc.2020114-9","doi-asserted-by":"publisher","unstructured":"C. Ding, J. Yang.Hamming weights in irreducible cyclic codes, <i>Discrete Math.<\/i>, <b>313<\/b> (2013), 434-446.","DOI":"10.1016\/j.disc.2012.11.009"},{"key":"key-10.3934\/amc.2020114-10","unstructured":"K. Feng., <i>An Introduction to Algebraic Number Theory<\/i>, <b>${ref.volume}<\/b> (2000)."},{"key":"key-10.3934\/amc.2020114-11","doi-asserted-by":"publisher","unstructured":"T. Feng, K. Momihara.Three-class association schemes from cyclotomy, <i>J. Combin. Theory Ser. A<\/i>, <b>120<\/b> (2013), 1202-1215.","DOI":"10.1016\/j.jcta.2013.03.002"},{"key":"key-10.3934\/amc.2020114-12","doi-asserted-by":"publisher","unstructured":"K. Ireland and M. Rosen, A classical introduction to modern number theory, 2$^nd$ edition, Graduate Texts in Mathematics, 84, Springer-Verlag, New York, 1990.","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"key-10.3934\/amc.2020114-13","doi-asserted-by":"publisher","unstructured":"L. Jin, C. Xing.Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound, <i>IEEE Trans. Inform. Theory<\/i>, <b>64<\/b> (2018), 6277-6282.","DOI":"10.1109\/TIT.2017.2773057"},{"key":"key-10.3934\/amc.2020114-14","doi-asserted-by":"publisher","unstructured":"H. Kharaghani, S. Suda.Symmetric Bush-type generalized Hadamard matrices and association schemes, <i>Finite Fields Appl.<\/i>, <b>37<\/b> (2016), 72-84.","DOI":"10.1016\/j.ffa.2015.09.003"},{"key":"key-10.3934\/amc.2020114-15","doi-asserted-by":"publisher","unstructured":"C. Li, C. Ding, S. Li.LCD cyclic codes over finite fields, <i>IEEE Trans. Inform. Theory<\/i>, <b>63<\/b> (2017), 4344-4356.","DOI":"10.1109\/TIT.2017.2672961"},{"key":"key-10.3934\/amc.2020114-16","doi-asserted-by":"publisher","unstructured":"C. Li, P. Zeng.Constructions of linear codes with one-dimensional hull, <i>IEEE Trans. Inform. Theory<\/i>, <b>65<\/b> (2019), 1668-1676.","DOI":"10.1109\/TIT.2018.2863693"},{"key":"key-10.3934\/amc.2020114-17","doi-asserted-by":"crossref","unstructured":"S. Li, C. Li, C. Ding, H. Liu.Two families of LCD BCH codes, <i>IEEE Trans. Inform. Theory<\/i>, <b>63<\/b> (2017), 5699-5717.","DOI":"10.1109\/TIT.2017.2672961"},{"key":"key-10.3934\/amc.2020114-18","unstructured":"X. Liu and H. Liu, Matrix-product complementary dual codes, preprint, arXiv: 1604.03774."},{"key":"key-10.3934\/amc.2020114-19","doi-asserted-by":"publisher","unstructured":"J. L. Massey.Linear codes with complementary duals, <i>Discret. Math.<\/i>, <b>106<\/b> (1992), 337-342.","DOI":"10.1016\/0012-365X(92)90563-U"},{"key":"key-10.3934\/amc.2020114-20","doi-asserted-by":"publisher","unstructured":"S. Mesnager, C. Tang, Y. Qi.Complementary dual algebraic geometry codes, <i>IEEE Trans. Inform. Theory<\/i>, <b>64<\/b> (2018), 2390-2397.","DOI":"10.1109\/TIT.2017.2766075"},{"key":"key-10.3934\/amc.2020114-21","doi-asserted-by":"publisher","unstructured":"B. Pang, S. Zhu, Z. Sun.On LCD negacyclic codes over finite fields, <i>J. Syst. Sci. Complex.<\/i>, <b>31<\/b> (2018), 1065-1077.","DOI":"10.1007\/s11424-017-6301-7"},{"key":"key-10.3934\/amc.2020114-22","doi-asserted-by":"publisher","unstructured":"N. Sendrier.Finding the permutation between equivalent linear codes: The support splitting algorithm, <i>IEEE Trans. Inform. Theory<\/i>, <b>46<\/b> (2000), 1193-1203.","DOI":"10.1109\/18.850662"},{"key":"key-10.3934\/amc.2020114-23","doi-asserted-by":"publisher","unstructured":"N. Sendrier and G. Skersys, On the computation of the automorphism group of a linear code, in <i>: Proceedings of IEEE ISIT2001<\/i>, Washington, DC, 2001.","DOI":"10.1109\/ISIT.2001.935876"},{"key":"key-10.3934\/amc.2020114-24","doi-asserted-by":"publisher","unstructured":"X. Shi, Q. Yue and S. Yang, New LCD MDS codes constructed from generalized Reed-Solomon codes, <i>J. Algebra Appl.<\/i>, <b>18<\/b> (2019), 1950150.","DOI":"10.1142\/S0219498819501500"},{"key":"key-10.3934\/amc.2020114-25","doi-asserted-by":"publisher","unstructured":"E. R. van Dam, M. Muzychuk.Some implications on amorphic association schemes, <i>J. Combin. Theory Ser. A<\/i>, <b>117<\/b> (2010), 111-127.","DOI":"10.1016\/j.jcta.2009.03.018"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=19970811-062e-44cf-a6ad-e2091702b9b3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T11:38:25Z","timestamp":1645789105000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_2_349"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020114","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}