{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:57Z","timestamp":1725564417293},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206637"},{"type":"electronic","value":"9783540409748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40974-8_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:06:11Z","timestamp":1283713571000},"page":"52-65","source":"Crossref","is-referenced-by-count":1,"title":["Separating and Intersecting Properties of BCH and Kasami Codes"],"prefix":"10.1007","author":[{"given":"Hans Georg","family":"Schaathun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tor","family":"Helleseth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(86)90161-5","volume":"58","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Explicit construction of exponential sized families of k-independent sets. Discrete Math.\u00a058(2), 191\u2013193 (1986)","journal-title":"Discrete Math."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TIT.2003.809570","volume":"49","author":"A. Barg","year":"2003","unstructured":"Barg, A., Blakley, G.R., Kabatiansky, G.A.: Digital fingerprinting codes: Problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory\u00a049(4), 852\u2013865 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/S0895480100376848","volume":"14","author":"A. Barg","year":"2001","unstructured":"Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Z\u00e9mor, G.: A hypergraph approach to the identifying parent property. SIAM J. Disc. Math.\u00a014(3), 423\u2013431 (2001)","journal-title":"SIAM J. Disc. Math."},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory\u00a044(5), 1897\u20131905 (1998); Presented in part 1995, see Springer LNCS","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TC.1980.1675640","volume":"29","author":"B. Bose","year":"1980","unstructured":"Bose, B., Rao, T.R.N.: Separating and completely separating systems and linear codes. IEEE Trans. Comput.\u00a029(7), 665\u2013668 (1980)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/18.841169","volume":"46","author":"B. Chor","year":"2000","unstructured":"Chor, B., Fiat, A., Naor, M., Pinkas, B.: Tracing traitors. IEEE Trans. Inform. Theory\u00a046(3), 893\u2013910 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"40","author":"G.D. Cohen","year":"1994","unstructured":"Cohen, G.D., Z\u00e9mor, G.: Intersecting codes and independent families. IEEE Trans. Inform. Theory\u00a040, 1872\u20131881 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, G.D., Encheva, S.B.: Efficient constructions of frameproof codes. Electronics Letters\u00a036(22) (2000)","DOI":"10.1049\/el:20001324"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, G.D., Encheva, S.B., Litsyn, S., Schaathun, H.G.: Erratum to \u2019intersecting codes and separating codes\u2019. Discrete Applied Mathematics (2003) (Submitted)","DOI":"10.1016\/S0166-218X(03)00504-3"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(02)00437-7","volume":"128","author":"G.D. Cohen","year":"2003","unstructured":"Cohen, G.D., Encheva, S.B., Litsyn, S., Schaathun, H.G.: Intersecting codes and separating codes. Discrete Applied Mathematics\u00a0128(1), 75\u201383 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR12","unstructured":"Cohen, G.D., Encheva, S.B., Schaathun, H.G.: On separating codes. Technical report, Ecole Nationale Sup rieure des T l communications (2001)"},{"key":"5_CR13","unstructured":"Cohen, G.D., Schaathun, H.G.: Asymptotic overview on separating codes (May 2003) Available at, \n                    \n                      http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/index.shtml"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0019-9958(69)90411-2","volume":"15","author":"P. Delsarte","year":"1969","unstructured":"Delsarte, P., Goethals, J.-M.: Tri-weight codes and generalized Hadamard matrices. Information and Control\u00a015, 196\u2013206 (1969)","journal-title":"Information and Control"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/T-C.1969.222707","volume":"18","author":"A.D. Friedman","year":"1969","unstructured":"Friedman, A.D., Graham, R.L., Ullman, J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput.\u00a018, 541\u2013547 (1969)","journal-title":"IEEE Trans. Comput."},{"issue":"1-3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(94)00030-M","volume":"145","author":"T. Helleseth","year":"1995","unstructured":"Helleseth, T., Kumar, P.V.: The weight hierarchy of the Kasami codes. Discrete Math.\u00a0145(1-3), 133\u2013143 (1995)","journal-title":"Discrete Math."},{"key":"5_CR17","first-page":"335","volume-title":"Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967)","author":"T. Kasami","year":"1969","unstructured":"Kasami, T.: Weight distributions of Bose-Chaudhuri-Hocquenghem codes. In: Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967), pp. 335\u2013357. Univ. North Carolina Press, Chapel Hill (1969)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0401035","volume":"1","author":"J. K\u00f6rner","year":"1988","unstructured":"K\u00f6rner, J., Simonyi, G.: Separating partition systems and locally different sequences. SIAM J. Discrete Math.\u00a01, 355\u2013359 (1988)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0097-3165(95)90019-5","volume":"71","author":"J. K\u00f6rner","year":"1995","unstructured":"K\u00f6rner, J.: On the extremal combinatorics of the Hamming space. J. Combin. Theory Ser. A\u00a071(1), 112\u2013126 (1995)","journal-title":"J. Combin. Theory Ser. A"},{"key":"5_CR20","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)"},{"issue":"2","key":"5_CR21","first-page":"105","volume":"30","author":"Y..L. Sagalovich","year":"1994","unstructured":"Sagalovich, Y.L.: Separating systems. Problems of Information Transmission\u00a030(2), 105\u2013123 (1994)","journal-title":"Problems of Information Transmission"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44828-4_9","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"H.G. Schaathun","year":"2003","unstructured":"Schaathun, H.G.: Fighting two pirates. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol.\u00a02643, pp. 71\u201378. Springer, Heidelberg (2003)"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/18.915661","volume":"47","author":"J.N. Staddon","year":"2001","unstructured":"Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory\u00a047(3), 1042\u20131049 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895480196304246","volume":"11","author":"D.R. Stinson","year":"1998","unstructured":"Stinson, D.R., Wei, R.: Combinatorial properties and constructions of trace-ability schemes and frameproof codes. SIAM J. Discrete Math.\u00a011(1), 41\u201353 (1998) (electronic)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R., Van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Planning and Inference\u00a086(2), 595\u2013617 (2000)","journal-title":"J. Stat. Planning and Inference"},{"issue":"1-3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0166-218X(91)90120-L","volume":"33","author":"M.A. Tsfasman","year":"1991","unstructured":"Tsfasman, M.A.: Algebraic-geometric codes and asymptotic problems. Discrete Appl. Math.\u00a033(1-3), 241\u2013256 (1991); Applied algebra, algebraic algorithms, and error-correcting codes (Toulouse, 1989)","journal-title":"Discrete Appl. Math."},{"key":"5_CR27","volume-title":"Asynchronous Sequential Switching Circuits","author":"S.H. Unger","year":"1969","unstructured":"Unger, S.H.: Asynchronous Sequential Switching Circuits. Wiley, Chichester (1969)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40974-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T22:00:58Z","timestamp":1553032858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40974-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206637","9783540409748"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40974-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}