{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:28:22Z","timestamp":1775770102638,"version":"3.50.1"},"reference-count":23,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MFC"],"published-print":{"date-parts":[[2022]]},"abstract":"<p style='text-indent:20px;'>Linear codes with few weights are widely used in strongly regular graphs, secret sharing schemes, association schemes and authentication codes. In this paper, we construct several two-weight and three-weight linear codes over finite fields by choosing suitable different defining sets. We also give some examples and some of the codes are optimal or almost optimal. Their applications to secret sharing schemes are also investigated.<\/p><\/jats:p>","DOI":"10.3934\/mfc.2021041","type":"journal-article","created":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T12:07:18Z","timestamp":1642162038000},"page":"129","source":"Crossref","is-referenced-by-count":5,"title":["Two-weight and three-weight linear codes constructed from Weil sums"],"prefix":"10.3934","volume":"5","author":[{"given":"Tonghui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hong","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Shudi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/mfc.2021041-1","doi-asserted-by":"publisher","unstructured":"A. Ashikhmin, A. Barg.Minimal vectors in linear codes, IEEE Trans. Inform. Theory<\/i>, 44<\/b> (1998), 2010-2017.","DOI":"10.1109\/18.705584"},{"key":"key-10.3934\/mfc.2021041-2","doi-asserted-by":"publisher","unstructured":"G. R. Blakley.Safeguarding cryptographic keys, 1979 International Workshop on Managing Requirements Knowledge (MARK)<\/i>, 48<\/b> (1979), 313-317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"key-10.3934\/mfc.2021041-3","doi-asserted-by":"publisher","unstructured":"Y. Cheng, X. Cao.Linear codes with few weights from weakly regular plateaued functions, Discrete Math.<\/i>, 344<\/b> (2021), 112597.","DOI":"10.1016\/j.disc.2021.112597"},{"key":"key-10.3934\/mfc.2021041-4","doi-asserted-by":"publisher","unstructured":"R. B. Chilwant, T. S. Sarvagod, K. R. Kumbhar, P. N. Gunjgur and A. V. Vidhate, SISA: A secret-sharing scheme application for cloud environment, in 2019 International Conference on Communication and Electronics Systems<\/i>, (2019), 638\u2013643.","DOI":"10.1109\/ICCES45898.2019.9002527"},{"key":"key-10.3934\/mfc.2021041-5","doi-asserted-by":"publisher","unstructured":"K. Ding, C. Ding.A class of two-weight and three-weight codes and their applications in secret sharing, IEEE Trans. Inform. Theory<\/i>, 61<\/b> (2015), 5835-5842.","DOI":"10.1109\/TIT.2015.2473861"},{"key":"key-10.3934\/mfc.2021041-6","doi-asserted-by":"publisher","unstructured":"C. Ding, H. Niederreiter.Cyclotomic linear codes of order $3$, IEEE Trans. Inform. Theory<\/i>, 53<\/b> (2007), 2274-2277.","DOI":"10.1109\/TIT.2007.896886"},{"key":"key-10.3934\/mfc.2021041-7","doi-asserted-by":"publisher","unstructured":"C. Ding, J. Yuan.Covering and secret sharing with linear codes, Discrete Mathematics and Theoretical Computer Science<\/i>, 2731<\/b> (2003), 11-25.","DOI":"10.1007\/3-540-45066-1_2"},{"key":"key-10.3934\/mfc.2021041-8","doi-asserted-by":"publisher","unstructured":"T. A. Gulliver.Two new optimal ternary two-weight codes and strongly regular graphs, Discrete Math.<\/i>, 149<\/b> (1996), 83-92.","DOI":"10.1016\/0012-365X(94)00264-J"},{"key":"key-10.3934\/mfc.2021041-9","doi-asserted-by":"publisher","unstructured":"Z. Heng, D. Li, J. Du, F. Chen.A family of projective two-weight linear codes, Des. Codes Cryptogr.<\/i>, 89<\/b> (2021), 1993-2007.","DOI":"10.1007\/s10623-021-00896-2"},{"key":"key-10.3934\/mfc.2021041-10","doi-asserted-by":"publisher","unstructured":"Z. Heng, Q. Yue, C. Li.Three classes of linear codes with two or three weights, Discrete Math.<\/i>, 339<\/b> (2016), 2832-2847.","DOI":"10.1016\/j.disc.2016.05.033"},{"key":"key-10.3934\/mfc.2021041-11","doi-asserted-by":"publisher","unstructured":"W. C. Huffman, V. Pless., Fundamentals of Error-Correcting Codes<\/i>, ${ref.volume}<\/b> (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"key-10.3934\/mfc.2021041-12","doi-asserted-by":"publisher","unstructured":"G. Jian, Z. Lin, R. Feng.Two-weight and three-weight linear codes based on Weil sums, Finite Fields Appl.<\/i>, 57<\/b> (2019), 92-107.","DOI":"10.1016\/j.ffa.2019.02.001"},{"key":"key-10.3934\/mfc.2021041-13","doi-asserted-by":"publisher","unstructured":"X. Kong, S. Yang.Complete weight enumerators of a class of linear codes with two or three weights, Discrete Math.<\/i>, 342<\/b> (2019), 3166-3176.","DOI":"10.1016\/j.disc.2019.06.025"},{"key":"key-10.3934\/mfc.2021041-14","doi-asserted-by":"publisher","unstructured":"C. Li, Q. Yue, F. Fu.A construction of several classes of two-weight and three-weight linear codes, Appl. Algebra Engrg. Comm. Comput.<\/i>, 28<\/b> (2017), 11-30.","DOI":"10.1007\/s00200-016-0297-4"},{"key":"key-10.3934\/mfc.2021041-15","doi-asserted-by":"crossref","unstructured":"R. Lidl, H. Niederreiter., Finite Fields<\/i>, ${ref.volume}<\/b> (1997).","DOI":"10.1017\/CBO9780511525926"},{"key":"key-10.3934\/mfc.2021041-16","doi-asserted-by":"publisher","unstructured":"Y. Liu, Q. Zhao.E-voting scheme using secret sharing and K-anonymity, World Wide Web<\/i>, 22<\/b> (2019), 1657-1667.","DOI":"10.1007\/s11280-018-0575-0"},{"key":"key-10.3934\/mfc.2021041-17","doi-asserted-by":"publisher","unstructured":"H. Lu, S. Yang.Two classes of linear codes from Weil sums, IEEE Access<\/i>, 8<\/b> (2020), 180471-180480.","DOI":"10.1109\/ACCESS.2020.3028141"},{"key":"key-10.3934\/mfc.2021041-18","doi-asserted-by":"publisher","unstructured":"S. Mesnager, Y. Qi, H. Ru, C. Tang.Minimal linear codes from characteristic functions, IEEE Trans. Inform. Theory<\/i>, 66<\/b> (2020), 5404-5413.","DOI":"10.1109\/TIT.2020.2978387"},{"key":"key-10.3934\/mfc.2021041-19","doi-asserted-by":"publisher","unstructured":"B. Mounits, T. Etzion, S. Litsyn.New upper bounds on codes via association schemes and linear programming, Adv. Math. Commun.<\/i>, 1<\/b> (2007), 173-195.","DOI":"10.3934\/amc.2007.1.173"},{"key":"key-10.3934\/mfc.2021041-20","doi-asserted-by":"publisher","unstructured":"A. Shamir.How to share a secret, Comm. ACM<\/i>, 22<\/b> (1979), 612-613.","DOI":"10.1145\/359168.359176"},{"key":"key-10.3934\/mfc.2021041-21","doi-asserted-by":"publisher","unstructured":"S. Yang.Complete weight enumerators of linear codes based on Weil sums, IEEE Communications Letters<\/i>, 25<\/b> (2021), 346-350.","DOI":"10.1109\/LCOMM.2020.3027754"},{"key":"key-10.3934\/mfc.2021041-22","doi-asserted-by":"publisher","unstructured":"S. Yang, Z. Yao.Complete weight enumerators of a class of linear codes, Discrete Math.<\/i>, 340<\/b> (2017), 729-739.","DOI":"10.1016\/j.disc.2016.11.029"},{"key":"key-10.3934\/mfc.2021041-23","doi-asserted-by":"publisher","unstructured":"D. Zheng, Q. Zhao, X. Wang, Y. Zhang.A class of two or three weights linear codes and their complete weight enumerators, Discrete Math.<\/i>, 344<\/b> (2021), 112355.","DOI":"10.1016\/j.disc.2021.112355"}],"container-title":["Mathematical Foundations of Computing"],"original-title":[],"deposited":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:43:05Z","timestamp":1646181785000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/mfc.2021041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022]]}},"alternative-id":["2577-8838_2022_2_129"],"URL":"https:\/\/doi.org\/10.3934\/mfc.2021041","relation":{},"ISSN":["2577-8838"],"issn-type":[{"value":"2577-8838","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}