{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:31:20Z","timestamp":1782322280916,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405054","type":"print"},{"value":"9783540450665","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_2","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"11-25","source":"Crossref","is-referenced-by-count":83,"title":["Covering and Secret Sharing with Linear Codes"],"prefix":"10.1007","author":[{"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"R.J. Anderson","year":"1998","unstructured":"R.J. Anderson, C. Ding, T. Helleseth, and T. Kl\u00f8ve, How to build robust shared control systems, Designs, Codes and Cryptography 15 (1998), pp.111\u2013124.","journal-title":"Designs, Codes and Cryptography"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, Variations on minimal codewords in linear codes, Proc.A AECC, 1995, pp. 96\u2013105.","DOI":"10.1007\/3-540-60114-7_7"},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A. Ashikhmin","year":"1998","unstructured":"A. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Trans. Inf. Theory 44(5) (1998), pp.2010\u20132017.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0022-314X(82)90058-0","volume":"14","author":"L.D. Baumert","year":"1982","unstructured":"L.D. Baumert and W.H. Mills Uniform cyclotomy, Journal of Number Theory 14 (1982), pp.67\u201382.","journal-title":"Journal of Number Theory"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S0019-9958(72)90354-3","volume":"20","author":"L.D. Baumert","year":"1972","unstructured":"L.D. Baumert and R.J. McEliece, Weights of irreducible cyclic codes, Information and Control 20(2) (1972), pp.158\u2013175.","journal-title":"Information and Control"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"G.R. Blakley, Safeguarding cryptographic keys, Proc. NCC AFIPS, 1979, pp.313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR7","unstructured":"C. Ding and X. Wang, A coding theory construction of new Cartesian authentication codes, preprint, 2003."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511525926"},{"key":"2_CR9","unstructured":"J.L. Massey, Minimal codewords and secret sharing, Proc. 6th Joint Swedish-Russian Workshop on Information Theory, August 22\u201327, 1993, pp.276\u2013279."},{"key":"2_CR10","first-page":"33","volume-title":"Codes and Ciphers: Cryptography and Coding IV","author":"J.L. Massey","year":"1995","unstructured":"J.L. Massey, Some applications of coding theory in cryptography, Codes and Ciphers: Cryptography and Coding IV, Formara Ltd, Esses, England, 1995, pp.33\u201347."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"R.J. McEliece and D.V. Sarwate, On sharing secrets and Reed-Solomon codes, Comm. ACM 24 (1981), pp.583\u2013584.","journal-title":"Comm. ACM"},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0023288","volume-title":"Information Security and Privacy","author":"A. Renvall","year":"1996","unstructured":"A. Renvall and C. Ding, The access structure of some secret-sharing schemes, Information Security and Privacy, Lecture Notes in Computer Science, vol.1172, pp.67\u201378, 1996, Springer-Verlag."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Comm. ACM 22 (1979), pp.612\u2013613.","journal-title":"Comm. ACM"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"J. Yuan and C. Ding, Secret sharing schemes from two-weight codes, The Bose Centenary Symposium on Discrete Mathematics and Applications, Kolkata, Dec 2002.","DOI":"10.1016\/S1571-0653(04)00592-X"}],"container-title":["Lecture Notes in Computer Science","Discrete Mathematics and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T07:48:52Z","timestamp":1587368932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45066-1_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}