{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T20:11:48Z","timestamp":1698523908036},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Linear error-correcting codes can be used for constructing secret sharing schemes; however, finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult. Here we investigate the properties of certain algebraic hypersurfaces over finite fields, whose intersection numbers with any hyperplane only takes a few values; these varieties give rise to <jats:italic>q<\/jats:italic>-divisible linear codes with at most 5 weights. Furthermore, for <jats:italic>q<\/jats:italic> odd, these codes turn out to be minimal and we characterize the access structures of the secret sharing schemes based on their dual codes. Indeed, the secret sharing schemes thus obtained are democratic, that is each participant belongs to the same number of minimal access sets and can easily be described.<\/jats:p>","DOI":"10.1007\/s10623-022-01051-1","type":"journal-article","created":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T17:02:32Z","timestamp":1653152552000},"page":"1503-1519","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Some hypersurfaces over finite fields, minimal codes and secret sharing schemes"],"prefix":"10.1007","volume":"90","author":[{"given":"Angela","family":"Aguglia","sequence":"first","affiliation":[]},{"given":"Michela","family":"Ceria","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Giuzzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,21]]},"reference":[{"key":"1051_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/jcd.21317","volume":"20","author":"A Aguglia","year":"2012","unstructured":"Aguglia A., Cossidente A., Korchm\u00e1ros G.: On quasi-hermitian varieties. J. Comb. Des. 20, 433\u2013447 (2012).","journal-title":"J. Comb. Des."},{"key":"1051_CR2","unstructured":"Alfarano G.N., Borello M., Neri A.: A geometric characterization of minimal codes and their asymptotic performance. Adv. Math. Commun. (To appear)."},{"key":"1051_CR3","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":"1051_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12095-021-00474-2","volume":"13","author":"D Bartoli","year":"2021","unstructured":"Bartoli D., Bonini M., G\u00fcne\u015f B.: An inductive construction of minimal code. Cryptogr. Commun. 13, 439\u2013449 (2021).","journal-title":"Cryptogr. Commun."},{"key":"1051_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10801-019-00930-6","volume":"53","author":"M Bonini","year":"2021","unstructured":"Bonini M., Borello M.: Minimal linear codes arising from blocking sets. J. Algebr. Comb. 53, 327\u2013341 (2021).","journal-title":"J. Algebr. Comb."},{"key":"1051_CR6","doi-asserted-by":"crossref","unstructured":"Bonini M., Lia S., Timpanella M.: Minimal linear codes from hermitian varieties and quadrics. Appl. Algebra Eng. Commun. Comput., pp. 1\u201310 (2021).","DOI":"10.1007\/s00200-021-00500-z"},{"key":"1051_CR7","doi-asserted-by":"crossref","unstructured":"Ding C., Yuan J.: Covering and Secret Sharing with Linear Codes, pp. 11\u201325. Discret Mathematics and Theoretical Computer Science, Lecture Notes in Computer Science. Springer, Berlin (2003).","DOI":"10.1007\/3-540-45066-1_2"},{"issue":"Suppl. 51","key":"1051_CR8","first-page":"87","volume":"2","author":"GL Ebert","year":"1998","unstructured":"Ebert G.L.: Hermitian arcs. Rend. Circ. Mat. Palermo 2(Suppl. 51), 87\u2013105 (1998).","journal-title":"Hermitian arcs. Rend. Circ. Mat. Palermo"},{"key":"1051_CR9","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1016\/j.ins.2010.07.029","volume":"180","author":"Z Li","year":"2010","unstructured":"Li Z., Xue T., Lai H.: Secret sharing schemes from binary linear codes. Inf. Sci. 180, 4412\u20134419 (2010).","journal-title":"Inf. Sci."},{"key":"1051_CR10","unstructured":"Massey J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, August 22\u201327, 276\u2013279 (1993)."},{"key":"1051_CR11","doi-asserted-by":"publisher","first-page":"3690","DOI":"10.1109\/TIT.2021.3070377","volume":"67","author":"C Tang","year":"2021","unstructured":"Tang C., Qiu Y., Liao Y., Zhou Z.: Full characterization of minimal linear codes as cutting blocking sets. IEEE Trans. Inf. Theory 67, 3690\u20133700 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1051_CR12","doi-asserted-by":"crossref","unstructured":"Tsfasman M.A., Vl\u0103du\u0163 S.G., Nogin D.: Algebraic geometric codes: basic notions. Mathematical Surveys and Monographs American Mathematical Society, Providence 139 (2007).","DOI":"10.1090\/surv\/139"},{"key":"1051_CR13","first-page":"263","volume":"27","author":"HN Ward","year":"2001","unstructured":"Ward H.N.: Divisible codes-a survey. Serdica Math. J. 27, 263\u2013278 (2001).","journal-title":"Serdica Math. J."},{"key":"1051_CR14","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"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01051-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01051-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01051-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T13:26:19Z","timestamp":1663075579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01051-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1051"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01051-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"26 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2022","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Missing Open Access funding information has been added in the Funding Note.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}