{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T11:38:43Z","timestamp":1715341123567},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2017\/000358"],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10623-021-00889-1","type":"journal-article","created":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T12:02:50Z","timestamp":1621857770000},"page":"1787-1837","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hamming weight distributions of multi-twisted codes over finite fields"],"prefix":"10.1007","volume":"89","author":[{"given":"Varsha","family":"Chauhan","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0133-8658","authenticated-orcid":false,"given":"Anuradha","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Sandeep","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Monika","family":"Yadav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,24]]},"reference":[{"issue":"5","key":"889_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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"889_CR2","series-title":"Lecture Notes in Computer Science 948, AAECC-11","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-60114-7_7","volume-title":"Variations on minimal codewords in linear codes","author":"A Ashikhmin","year":"1995","unstructured":"Ashikhmin A., Barg A., Cohen G., Huguet L.: Variations on minimal codewords in linear codes, pp. 96\u2013105. Lecture Notes in Computer Science 948, AAECC-11Springer, Berlin (1995)."},{"key":"889_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ffa.2016.12.002","volume":"45","author":"N Aydin","year":"2017","unstructured":"Aydin N., Haliovi\u0107 A.: A generalization of quasi-twisted codes: Multi-twisted codes. Finite Fields Appl. 45, 96\u2013106 (2017).","journal-title":"Finite Fields Appl."},{"key":"889_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1134\/S0032946020030023","volume":"56","author":"L Bassalygo","year":"2020","unstructured":"Bassalygo L., Zinoviev V., Lebedev V.: Symmetric block designs and optimal equidistant codes. Probl. Inf. Transm. 56, 245\u2013252 (2020).","journal-title":"Probl. Inf. Transm."},{"key":"889_CR5","volume-title":"Gauss and Jacobi sums","author":"BC Berndt","year":"1997","unstructured":"Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi sums. Wiley, New York (1997)."},{"key":"889_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800467","volume-title":"Algebraic Codes for Data Transmission","author":"RE Blahut","year":"2003","unstructured":"Blahut R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)."},{"key":"889_CR7","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Combin. 18, 181\u2013186 (1984).","journal-title":"Ars Combin."},{"issue":"6","key":"889_CR8","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(6), 2089\u20132102 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"889_CR9","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(10), 2167\u20132181 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"889_CR10","unstructured":"Chauhan, V., Sharma, A.: A generalization of multi-twisted codes over finite fields, their Galois duals and Type II codes (submitted)."},{"key":"889_CR11","doi-asserted-by":"crossref","unstructured":"Cohen, G. D., Mesnager, S. and Patey, A.: On minimal and quasi-minimal linear codes, Lecture Notes in Computer Science 8308, IMACC 2013, Springer, Heidelberg, pp. 85-98, 2013.","DOI":"10.1007\/978-3-642-45239-0_6"},{"issue":"7","key":"889_CR12","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/26.701302","volume":"46","author":"AGA Daraiseh","year":"1998","unstructured":"Daraiseh A.G.A., Baum C.W.: Decoder error and failure probabilities for Reed-Solomon codes: decodable vectors method. IEEE Trans. Commun. 46(7), 857\u2013859 (1998).","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"889_CR13","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1109\/TIT.2008.2011511","volume":"55","author":"C Ding","year":"2009","unstructured":"Ding C.: The weight distribution of some irreducible cyclic codes. IEEE Trans. Inf. Theory 55(3), 955\u2013960 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"889_CR14","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(11), 5835\u20135842 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"889_CR15","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. Theoret. Comput. Sci. 330(1), 81\u201399 (2005).","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"889_CR16","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(10), 6536\u20136545 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"889_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-015-0156-5","volume":"78","author":"T Etzion","year":"2016","unstructured":"Etzion T., Storme L.: Galois geometries and coding theory. Des. Codes Cryptogr. 78, 311\u2013350 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"889_CR18","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes, Online available at http:\/\/www.codetables.de, accessed 16 Jan 2021"},{"issue":"8","key":"889_CR19","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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"889_CR20","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 Fields Appl. 54, 176\u2013196 (2018).","journal-title":"Finite Fields Appl."},{"key":"889_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamental of Error-correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamental of Error-correcting Codes. Cambridge University Press, New York (2003)."},{"key":"889_CR22","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ffa.2019.02.001","volume":"57","author":"G Jian","year":"2019","unstructured":"Jian G., Lin Z., Feng R.: Two-weight and three-weight linear codes based on Weil sums. Finite Fields Appl. 57, 92\u2013107 (2019).","journal-title":"Finite Fields Appl."},{"key":"889_CR23","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11859-013-0949-1","volume":"18","author":"Z Li","year":"2013","unstructured":"Li Z., Sun J., Li J.: A novel secret sharing scheme based on minimal linear codes. Wuhan Univ. J. Natural Sci. 18, 407\u2013412 (2013).","journal-title":"Wuhan Univ. J. Natural Sci."},{"key":"889_CR24","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., Li F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Appl. 28, 94\u2013114 (2014).","journal-title":"Finite Fields Appl."},{"key":"889_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ffa.2016.12.004","volume":"45","author":"F Li","year":"2017","unstructured":"Li F., Yue Q., Liu F.: The weight distribution of a class of cyclic codes containing a subclass with optimal parameters. Finite Fields Appl. 45, 183\u2013202 (2017).","journal-title":"Finite Fields Appl."},{"key":"889_CR26","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"issue":"12","key":"889_CR27","doi-asserted-by":"publisher","first-page":"5332","DOI":"10.1109\/TIT.2008.2006424","volume":"54","author":"J Luo","year":"2008","unstructured":"Luo J., Feng K.: On the weight distributions of two classes of cyclic codes. IEEE Trans. Inf. Theory 54(12), 5332\u20135344 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"889_CR28","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1109\/TIT.1981.1056420","volume":"27","author":"FJ MacWilliams","year":"1981","unstructured":"MacWilliams F.J., Seery J.: The weight distributions of some minimal cyclic codes. IEEE Trans. Inf. Theory 27(6), 796\u2013806 (1981).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"889_CR29","unstructured":"Massey, J. L.: Minimal codewords and secret sharing, Proc. 6th Joint Swedish\u2013Russian Int. Workshop on Info. Theory, pp. 276-279, (1993)."},{"issue":"4","key":"889_CR30","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1109\/TIT.2019.2956130","volume":"66","author":"S Mesnager","year":"2020","unstructured":"Mesnager S., Sinak A.: Several classes of minimal linear codes with few weights from weakly regular Plateaued functions. IEEE Trans. Inf. Theory 66(4), 2296\u20132310 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"889_CR31","doi-asserted-by":"publisher","DOI":"10.1002\/0470035706","volume-title":"The Art of Error Correcting Coding","author":"RH Morelos-Zaragoza","year":"2006","unstructured":"Morelos-Zaragoza R.H.: The Art of Error Correcting Coding. Wiley, Hoboken (2006)."},{"key":"889_CR32","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ffa.2019.06.005","volume":"59","author":"A Sharma","year":"2019","unstructured":"Sharma A., Chauhan V.: Skew multi-twisted codes over finite fields and their Galois duals. Finite Fields Appl. 59, 297\u2013334 (2019).","journal-title":"Finite Fields Appl."},{"key":"889_CR33","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ffa.2018.01.012","volume":"51","author":"A Sharma","year":"2018","unstructured":"Sharma A., Chauhan V., Singh H.: Multi-twisted codes over finite fields and their dual codes. Finite Fields Appl. 51, 270\u2013297 (2018).","journal-title":"Finite Fields Appl."},{"key":"889_CR34","first-page":"1","volume":"13","author":"DH Smith","year":"2006","unstructured":"Smith D.H., Hughes L.A., Perkins S.: A new table of constant weight codes of length greater than 28. Electr. J. Combin. 13, 1\u201318 (2006).","journal-title":"Electr. J. Combin."},{"issue":"4","key":"889_CR35","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579148","volume":"4","author":"DR Stinson","year":"1984","unstructured":"Stinson D.R., Rees G.H.J.V.: The equivalence of certain equidistant binary codes and symmetric BIBDS. Combinatorica 4(4), 357\u2013362 (1984).","journal-title":"Combinatorica"},{"key":"889_CR36","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. Finite Fields Appl. 42, 23\u201338 (2016).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"889_CR37","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).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00889-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00889-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00889-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:19:23Z","timestamp":1627496363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00889-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":37,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["889"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00889-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"30 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}