{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T23:05:37Z","timestamp":1774047937426,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T00:00:00Z","timestamp":1234483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10623-009-9272-4","type":"journal-article","created":{"date-parts":[[2009,2,12]],"date-time":"2009-02-12T14:45:27Z","timestamp":1234449927000},"page":"129-154","source":"Crossref","is-referenced-by-count":5,"title":["On proper secrets, (t, k)-bases and linear codes"],"prefix":"10.1007","volume":"52","author":[{"given":"Tamir","family":"Tassa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge L.","family":"Villar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,13]]},"reference":[{"key":"9272_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inform. Theory IT- 46, 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inform. Theory IT-"},{"key":"9272_CR2","unstructured":"Ben Yaakov J., Tassa T.: Oblivious evaluation of multivariate polynomials (submitted)."},{"key":"9272_CR3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/jath.2000.3473","volume":"105","author":"C. Boor de","year":"2000","unstructured":"de Boor C., Dyn N., Ron A.: Polynomial interpolation to data on flats in $${\\mathbb{R}^d}$$ . J. Approx. Theory 105, 313\u2013343 (2000)","journal-title":"J. Approx. Theory"},{"key":"9272_CR4","first-page":"107","volume":"8","author":"R.C. Bose","year":"1947","unstructured":"Bose R.C.: Mathematical theorey of the symmetrical factorial design. Sankhy\u0101 8, 107\u2013166 (1947)","journal-title":"Sankhy\u0101"},{"key":"9272_CR5","first-page":"257","volume":"38","author":"R.C. Bose","year":"1961","unstructured":"Bose R.C.: On some connections between the design of experiments and information theory. Bull. Inst. Int. Stat. 38, 257\u2013271 (1961)","journal-title":"Bull. Inst. Int. Stat."},{"key":"9272_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"K.A. Bush","year":"1952","unstructured":"Bush K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"key":"9272_CR7","first-page":"13","volume":"46","author":"L.R.A. Casse","year":"1969","unstructured":"Casse L.R.A.: A solution to Beniamino Segre\u2019s \u2018Problem I r,q \u2019 for q even. Atti. Accad. Naz. Lincei Rend. 46, 13\u201320 (1969)","journal-title":"Atti. Accad. Naz. Lincei Rend."},{"key":"9272_CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00605-003-0044-3","volume":"141","author":"S.B. Damelin","year":"2004","unstructured":"Damelin S.B., Michalski G., Mullen G.L., Stone D.: The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes. Monatsh. Math. 141, 277\u2013288 (2004)","journal-title":"Monatsh. Math."},{"key":"9272_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00605-006-0440-6","volume":"150","author":"S.B. Damelin","year":"2007","unstructured":"Damelin S.B., Michalski G., Mullen G.L.: The cardinality of sets of k-independent vectors over finite fields. Monatsh. Math. 150, 289\u2013295 (2007)","journal-title":"Monatsh. Math."},{"key":"9272_CR10","doi-asserted-by":"crossref","unstructured":"Dodis Y.: Space-time tradeoffs for graph properties. Master thesis, MIT. http:\/\/theory.lcs.mit.edu\/yevgen\/ps\/thesis.ps (1998).","DOI":"10.1007\/3-540-48523-6_26"},{"key":"9272_CR11","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF02479251","volume":"23","author":"B.R. Gulati","year":"1971","unstructured":"Gulati B.R.: On maximal (k, t)-sets. Ann. Inst. Stat. Math. 23, 527\u2013529 (1971)","journal-title":"Ann. Inst. Stat. Math."},{"key":"9272_CR12","volume-title":"A First Course in Coding Theory, Oxford Applied Mathematics and Computing Science Series","author":"R. Hill","year":"2002","unstructured":"Hill R.: A First Course in Coding Theory, Oxford Applied Mathematics and Computing Science Series. Clarendon Press, Oxford (2002)"},{"key":"9272_CR13","unstructured":"Hirschfeld J.W.P.: Maximum Sets in Finite Projective Spaces, Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol. 82, pp. 55\u201376. Cambridge University Press, Cambridge (1983)."},{"key":"9272_CR14","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0378-3758(98)00043-3","volume":"72","author":"J.W.P. Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces. J. Stat. Plan. Inference 72, 355\u2013380 (1998)","journal-title":"J. Stat. Plan. Inference"},{"key":"9272_CR15","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P., Storme L.: The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001, in Finite Geometries, Developments in Mathematics, pp. 201\u2013246. Kluwer, Boston (2001).","DOI":"10.1007\/978-1-4613-0283-4_13"},{"key":"9272_CR16","volume-title":"General Galois Geometries","author":"J.W.P. Hirschfeld","year":"1991","unstructured":"Hirschfeld J.W.P., Thas T.A.: General Galois Geometries. Oxford University Press, Oxford (1991)"},{"key":"9272_CR17","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1109\/TIT.2005.847712","volume":"51","author":"S. Jaggi","year":"2005","unstructured":"Jaggi S., Sanders P., Chou P.A., Effros M., Egner S., Jain K., Tolhuizen L.M.G.M.: Polynomial time algorithms for multicast network code construction. IEEE Trans. Inform. Theory 51, 1973\u20131982 (2005)","journal-title":"Inform. Theory"},{"key":"9272_CR18","unstructured":"Jurick R.R.: An algorithm for determining the largest maximally independent set of vectors from an r-dimensional space over a Galois field of n elements. Technical Report ASD-TR-68-40. Air Force Systems Command. Wright-Patterson Air Force Base, Ohio."},{"key":"9272_CR19","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/1187441.1187444","volume":"9","author":"N. Kogan","year":"2006","unstructured":"Kogan N., Tassa T.: Improved efficiency for revocation schemes via Newton interpolation. ACM Trans. Inf. Syst. Secur. 9, 461\u2013486 (2006)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"9272_CR20","doi-asserted-by":"crossref","unstructured":"Macdonald I.G.: Symmetric Functions and Hall Polynomials. Oxford (1995).","DOI":"10.1093\/oso\/9780198534891.001.0001"},{"key":"9272_CR21","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library 16 (1977)."},{"key":"9272_CR22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0021-8693(66)90024-X","volume":"4","author":"C. Maneri","year":"1966","unstructured":"Maneri C., Silverman R.: A vector space packing problem. J. Algebra 4, 321\u2013330 (1966)","journal-title":"J. Algebra"},{"key":"9272_CR23","unstructured":"Qvist B.: Some remarks concerning curves of the second degree in a finite plane. Ann. Acad. Sci. Fenn. Ser. A 134 (1952)."},{"key":"9272_CR24","unstructured":"Rao C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. J. R. Stat. Soc. 9, 128\u2013139 (1947) (supplement)."},{"key":"9272_CR25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02410779","volume":"39","author":"B. Segre","year":"1955","unstructured":"Segre B.: Curve razionali normali e k-archi negli spazi finiti. Ann. Mat. Pura Appl. 39, 357\u2013379 (1955)","journal-title":"Ann. Mat. Pura Appl."},{"key":"9272_CR26","volume-title":"Lectures on Modern Geometry","author":"B. Segre","year":"1961","unstructured":"Segre B.: Lectures on Modern Geometry. Cremonese, Rome (1961)"},{"key":"9272_CR27","doi-asserted-by":"crossref","unstructured":"Seiden E.: A theorem in finite projective geometry and an application to statistics. Proc. Am. Math. Soc. 1 282\u2013286 (1950).","DOI":"10.1090\/S0002-9939-1950-0035032-7"},{"key":"9272_CR28","doi-asserted-by":"crossref","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22 612\u2013613 (1979).","DOI":"10.1145\/359168.359176"},{"key":"9272_CR29","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R.C. Singleton","year":"1964","unstructured":"Singleton R.C.: Maximum distance q-ary codes. IEEE Trans. Inform. Theory 10, 16\u2013118 (1964)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9272_CR30","first-page":"104","volume-title":"Algebraic Number Theory","author":"I.N. Stewart","year":"1987","unstructured":"Stewart I.N., Tall D.O.: Algebraic Number Theory, 2nd edn, pp. 104\u2013107. Chapman and Hall, New York (1987)","edition":"2"},{"key":"9272_CR31","first-page":"379","volume":"19","author":"G. Tallini","year":"1960","unstructured":"Tallini G.: Le geometrie di Galois e le loro applicazioni alla statistica e alla teoria delle informazioni. Rend. Mat. e Appl. 19, 379\u2013400 (1960)","journal-title":"Rend. Mat. e Appl."},{"key":"9272_CR32","first-page":"331","volume":"1","author":"J.A. Thas","year":"1968","unstructured":"Thas J.A.: Normal rational curves and k-arcs in Galois spaces. Rend. Mat. 1, 331\u2013334 (1968)","journal-title":"Rend. Mat."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9272-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9272-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9272-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,10]],"date-time":"2024-03-10T13:53:28Z","timestamp":1710078808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9272-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,13]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9272"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9272-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,13]]}}}