{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:04:53Z","timestamp":1725552293758},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540302766"},{"type":"electronic","value":"9783540324188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11586821_5","type":"book-chapter","created":{"date-parts":[[2005,11,3]],"date-time":"2005-11-03T09:48:40Z","timestamp":1131011320000},"page":"59-67","source":"Crossref","is-referenced-by-count":2,"title":["A Trellis-Based Bound on (2,1)-Separating Codes"],"prefix":"10.1007","author":[{"given":"Hans Georg","family":"Schaathun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard D.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Bassalygo, L.A.: Supports of a code. In: Giusti, M., Cohen, G., Mora, T. (eds.) AAECC 1995. LNCS, vol.\u00a0948. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-60114-7_1"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480101384633","volume":"16","author":"S.R. Blackburn","year":"2003","unstructured":"Blackburn, S.R.: Frameproof codes. SIAM J. Discrete Math.\u00a016(3), 499\u2013510 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. CRYPTO 1995\u00a044(5), 1897\u20131905 (1998), Presented in part at CRYPTO 1995 (1995)","DOI":"10.1109\/18.705568"},{"issue":"6","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1109\/18.340487","volume":"40","author":"G. Cohen","year":"1994","unstructured":"Cohen, G., Litsyn, S., Z\u00e9mor, G.: Upper bounds on generalized distances. IEEE Trans. Inform. Theory\u00a040(6), 2090\u20132092 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/18.340462","volume":"40","author":"G. Cohen","year":"1994","unstructured":"Cohen, G., Z\u00e9mor, G.: Intersecting codes and independent families. IEEE Trans. Inform. Theory\u00a040, 1872\u20131881 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5_CR6","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"},{"issue":"9","key":"5_CR7","doi-asserted-by":"publisher","first-page":"2606","DOI":"10.1109\/TIT.2002.801479","volume":"48","author":"G.D. Cohen","year":"2002","unstructured":"Cohen, G.D., Encheva, S.B., Schaathun, H.G.: More on (2,2)-separating codes. IEEE Trans. Inform. Theory\u00a048(9), 2606\u20132609 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR8","unstructured":"Cohen, G.D., Schaathun, H.G.: Asymptotic overview on separating codes. Technical Report 248, Dept. of Informatics, University of Bergen (May 2003), Available at http:\/\/www.ii.uib.no\/publikasjoner\/texrap\/index.shtml"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(77)90078-4","volume":"18","author":"T. Helleseth","year":"1977","unstructured":"Helleseth, T., Kl\u00f8ve, T., Mykkeltveit, J.: The weight distribution of irreducible cyclic codes with block lengths n_1((q l \u2009\u2212\u20091)\/n). Discrete Math.\u00a018, 179\u2013211 (1977)","journal-title":"Discrete Math."},{"issue":"1","key":"5_CR10","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_CR11","unstructured":"Krasnopeev, A., Sagalovich, Y.L.: The Kerdock codes and separating systems. In: Eight International Workshop on Algebraic and Combinatorial Coding Theory (2002)"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"IT-23","author":"R.J. McEliece","year":"1977","unstructured":"McEliece, R.J., Rodemich, E.R., Rumsey, H., Rumsey Jr., H., Welch, L.R.: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Trans. Inform. Theory\u00a0IT-23(2), 157\u2013166 (1977)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/18.661506","volume":"44","author":"I. Reuven","year":"1998","unstructured":"Reuven, I., Be\u2019ery, Y.: Entropy\/length profiles, bounds on the minimal covering of bipartite graphs, and the trellis complexity of nonlinear codes. IEEE Trans. Inform. Theory\u00a044(2), 580\u2013598 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1109\/18.749020","volume":"45","author":"I. Reuven","year":"1999","unstructured":"Reuven, I., Be\u2019ery, Y.: Generalized Hamming weights of nonlinear codes and the relation to the Z 4-linear representation. IEEE Trans. Inform. Theory\u00a045(2), 713\u2013720 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"5_CR15","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"},{"issue":"3","key":"5_CR16","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":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V.K. Wei","year":"1991","unstructured":"Wei, V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory\u00a037(5), 1412\u20131418 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"11","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2002.804111","volume":"40","author":"C. Xing","year":"2002","unstructured":"Xing, C.: Asymptotic bounds on frameproof codes. IEEE Trans. Inform. Theory\u00a040(11), 2991\u20132995 (2002)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11586821_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:01:27Z","timestamp":1605643287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11586821_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540302766","9783540324188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11586821_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}