{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:28:48Z","timestamp":1778902128331,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1023\/a:1024741108241","type":"journal-article","created":{"date-parts":[[2003,9,15]],"date-time":"2003-09-15T17:50:13Z","timestamp":1063648213000},"page":"5-19","source":"Crossref","is-referenced-by-count":16,"title":["A Representation of a Family of Secret Sharing Matroids"],"prefix":"10.1007","volume":"30","author":[{"given":"Siaw-Lynn","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5138853_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 4 (1991) pp. 123\u2013134.","journal-title":"J. Cryptology"},{"key":"5138853_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1006\/aama.1998.0600","volume":"21","author":"J. Geelen","year":"1998","unstructured":"J. Geelen, J. Oxley, D. Vertigan and G. Whittle, Weak maps and stabilizers of classes of matroids, Advances in Applied Mathematics, Vol. 21 (1998) pp. 305\u2013341.","journal-title":"Advances in Applied Mathematics"},{"key":"5138853_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries over Finite Fields","author":"J. W. P. Hirschfeld","year":"1998","unstructured":"J. W. P. Hirschfeld, Projective Geometries over Finite Fields, Oxford University Press, Oxford, second edition (1998).","edition":"second edition"},{"key":"5138853_CR4","volume-title":"General Galois Geometries","author":"J. W. P. Hirschfeld","year":"1991","unstructured":"J. W. P. Hirschfeld and J. A. Thas, General Galois Geometries, Oxford University Press, Oxford (1991)."},{"key":"5138853_CR5","unstructured":"K. M. Martin, Discrete Structure in the Theory of Secret Sharing, Ph.D. Thesis, University of London (1991)."},{"key":"5138853_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1011225330458","volume":"24","author":"S.-L. Ng","year":"2001","unstructured":"S.-L. Ng and M. Walker, On the composition of matroids and ideal secret sharing schemes, Des. Codes. Cryptogr. Vol. 24 (2001) pp. 49\u201367.","journal-title":"Des. Codes. Cryptogr."},{"key":"5138853_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0095-8956(92)90007-K","volume":"56","author":"P. D. Seymour","year":"1992","unstructured":"P. D. Seymour, On secret-sharing matroids, Journal of Combin. Theory B, Vol. 56, (1992) pp. 69\u201373.","journal-title":"Journal of Combin. Theory B"},{"key":"5138853_CR8","first-page":"441","volume-title":"Contemporary Cryptology, The Science of Information Integrity","author":"G. J. Simmons","year":"1991","unstructured":"G. J. Simmons, An introduction to shared secret and\/or shared control schemes and their application, In (G. J. Simmons, ed.) Contemporary Cryptology, The Science of Information Integrity, IEEE Press, New York (1991) pp. 441\u2013497."},{"key":"5138853_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1008244215660","volume":"14","author":"J. Simonis","year":"1998","unstructured":"J. Simonis and A. Ashikhmin. Almost affine codes, Des. Codes. Cryptogr., Vol. 14 (1998) pp. 179\u2013197.","journal-title":"Des. Codes. Cryptogr."},{"key":"5138853_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, An Explication of secret sharing schemes, Des. Codes. Cryptogr., Vol. 2 (1992) pp. 357\u2013390.","journal-title":"Des. Codes. Cryptogr."},{"key":"5138853_CR11","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh, Matroid Theory, Academic Press, London (1976)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024741108241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024741108241\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024741108241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:40:34Z","timestamp":1753756834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024741108241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["5138853"],"URL":"https:\/\/doi.org\/10.1023\/a:1024741108241","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}