{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T01:14:46Z","timestamp":1715562886857},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,27]],"date-time":"2013-06-27T00:00:00Z","timestamp":1372291200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10623-013-9849-9","type":"journal-article","created":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T03:12:43Z","timestamp":1372216363000},"page":"31-40","source":"Crossref","is-referenced-by-count":15,"title":["New bounds on $$\\bar{2}$$ 2 \u00af -separable codes of length 2"],"prefix":"10.1007","volume":"74","author":[{"given":"Minquan","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yuan-Hsun","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,27]]},"reference":[{"key":"9849_CR1","unstructured":"Benson C.T.: Minimal regular graphs of girths eight and twelve. Can. J. Math. 18, 1091\u20131094 (1966)."},{"key":"9849_CR2","unstructured":"Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16, 499\u2013510 (2003)."},{"key":"9849_CR3","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B.: Extremal Graph Theory. Academic Press, New York (1978).","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"9849_CR4","unstructured":"Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897\u20131905 (1998)."},{"key":"9849_CR5","unstructured":"Bryant D.E., Fu H.L.: $$C_4$$ C 4 -saturated bipartite graphs. Discret. Math. 259, 263\u2013268 (2002)."},{"key":"9849_CR6","unstructured":"Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57, 4843\u20134851 (2011)."},{"key":"9849_CR7","unstructured":"Cheng M., Ji L., Miao Y.: Separable codes. IEEE Trans. Inf. Theory 58, 1791\u20131803 (2012)."},{"key":"9849_CR8","unstructured":"Dam\u00e1sdi G., H\u00e9ger H., Sz\u00f6nyi T.: Cages, geometries and Zarankiewicz\u2019 problem. Ann. Univ. E\u0151tv\u0151s Lor\u00e1nd (2013)."},{"key":"9849_CR9","unstructured":"de Caen D., Sz\u00e9kely L.A.: On dense bipartite graphs of girth eight and upper bounds for certain configurations in planar point\u2013line systems. J. Comb. Theory Ser. A 77, 268\u2013278 (1997)."},{"key":"9849_CR10","unstructured":"Erd\u0151s P., S\u00e1rk\u0151zy A., S\u00f3s V.T.: On product representations of powers. I. Eur. J. Comb. 16, 567\u2013588 (1995)."},{"key":"9849_CR11","unstructured":"Garc\u00eda-V\u00e1zquez P., Balbuena C., Marcote X., Valenzuela J.C.: On extremal bipartite graphs with high girth. Electron. Notes Discret. Math. 26, 67\u201373 (2006)."},{"key":"9849_CR12","unstructured":"Goddard W., Henning M.A., Oellermann O.R.: Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219, 85\u201395 (2000)."},{"key":"9849_CR13","unstructured":"Gy\u00f6ri E.: $$C_6$$ C 6 -free bipartite graphs and product representations of squares. Discret. Math. 165(166), 371\u2013375 (1997)."},{"key":"9849_CR14","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P.: Projective Geometries over Finite Fields, 2nd edn. Oxford Science, Oxford (1998).","DOI":"10.1093\/oso\/9780198502951.001.0001"},{"key":"9849_CR15","unstructured":"Hollmann H.D.L., van Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory Ser. A 82, 121\u2013133 (1998)."},{"key":"9849_CR16","unstructured":"Hoory S.: The size of bipartite graphs with a given girth. J. Comb. Theory Ser. B 86, 215\u2013220 (2002)."},{"key":"9849_CR17","doi-asserted-by":"crossref","unstructured":"Lam T.: Graphs without cycles of even length. Bull. Australas. Math. Soc. 63, 435\u2013440 (2001).","DOI":"10.1017\/S0004972700019511"},{"key":"9849_CR18","unstructured":"Lam T.: A result on $$2k$$ 2 k -cycle-free bipartite graphs. Australas. J. Comb. 32, 163\u2013170 (2005)."},{"key":"9849_CR19","doi-asserted-by":"crossref","unstructured":"Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing. Hindawi Publishing Corporation, New York (2005).","DOI":"10.1155\/9789775945181"},{"key":"9849_CR20","doi-asserted-by":"crossref","unstructured":"Mehlhorn K.: Data Structures and Algorithms 1. Springer, Berlin (1984).","DOI":"10.1007\/978-3-642-69672-5"},{"key":"9849_CR21","unstructured":"Naor A., Verstra\u00ebthe J.: A note on bipartite graphs without $$2k$$ 2 k -cycles. Comb. Probab. Comput. 14, 845\u2013849 (2005)."},{"key":"9849_CR22","unstructured":"Neuwirth S.: The size of bipartite graphs with girth eight, arXiv:math\/0102210 (2001)."},{"key":"9849_CR23","unstructured":"Singer J.: A theorem in finite projective geometry and some applications to number theory. Trans. Am. Math. Soc. 43, 377\u2013385 (1938)."},{"key":"9849_CR24","unstructured":"Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47, 1042\u20131049 (2001)."},{"key":"9849_CR25","unstructured":"Stinson D.R., van Trung, T., Wei R.: Secure frameproof codes, key distribution pattern, group testing algorithms and related structures. J. Stat. Plan. Inference 86, 595\u2013617 (2000)."},{"key":"9849_CR26","unstructured":"Wenger R.: Extremal graphs with no $$C^4$$ C 4 \u2019s, $$C^6$$ C 6 \u2019s, or $$C^{10}$$ C 10 \u2019s. J. Comb. Theory Ser. B 52, 113\u2013116 (1991)."},{"key":"9849_CR27","unstructured":"Zarankiewicz K.: Problem P101. Colloquium Math. 2, 301 (1951)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9849-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9849-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9849-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:30:17Z","timestamp":1715560217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9849-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,27]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9849"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9849-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,27]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-013-9849-9', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>2</sup></a></div><div><a href='#diffid115' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:115', '*');; return false;" style='text-decoration: none; '>Project </a> <a style='color: white;' href='#diffid115'><sup>2</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>