{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:18:40Z","timestamp":1649096320135},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T00:00:00Z","timestamp":1426032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10623-015-0057-7","type":"journal-article","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T13:14:10Z","timestamp":1425993250000},"page":"367-382","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal strongly conflict-avoiding codes of even length and weight three"],"prefix":"10.1007","volume":"79","author":[{"given":"Yijin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yuan-Hsun","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Wing Shing","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Fu H.-L., Lin Y.-H., Mishima, M.: Optimal conflict-avoiding codes of even length and weight 3. IEEE Trans. Inf. Theory 56(11), 5747\u20135756 (2010).","DOI":"10.1109\/TIT.2010.2069270"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Fu H.-L., Lo Y.-H., Shum K.W.: Optimal conflict-avoiding codes of odd length and weight three. Des. Codes Cryptogr. 72(2), 289\u2013309 (2014).","DOI":"10.1007\/s10623-012-9764-5"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Gy\u00f6fi L., Vajda I.: Construction of protocol sequences for multiple-access collision channel without feedback. IEEE Trans. Inf. Theory 39(5), 1762\u20131765 (1993).","DOI":"10.1109\/18.259673"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Jimbo M., Mishima M., Janiszewski S.: Teymorian A.Y., Tonchev V.D.: On conflict-avoiding codes of length n = 4 m for three active users. IEEE Trans. Inf. Theory 53(8), 2732\u20132742 (2007).","DOI":"10.1109\/TIT.2007.901233"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I.: Conflict-avoiding codes and cyclic triple systems. Probl. Inf. Transm. 43(3), 199\u2013212 (2007).","DOI":"10.1134\/S0032946007030039"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I., Tonchev V.D.: Optimal conflict-avoiding codes for three active users. In: IEEE International Symposium on Information Theory, Adelaide, Australia pp. 535\u2013537 (2005).","DOI":"10.1109\/ISIT.2005.1523392"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Lin Y., Mishima M., Satoh J., Jimbo M.: Optimal equi-difference conflict-avoiding codes of odd length and weight three. Finite Fields Appl. 26, 49\u201368 (2014).","DOI":"10.1016\/j.ffa.2013.11.001"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Massey J.L., Mathys P.: The collision channel without feedback. IEEE Trans. Inf. Theory 31(2), 192\u2013204 (1985).","DOI":"10.1109\/TIT.1985.1057010"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Momihara K.: Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three. Des. Codes Cryptogr. 45(3), 379\u2013390 (2007).","DOI":"10.1007\/s10623-007-9139-5"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Momihara K., M\u00fcller M., Satoh J., Jimbo M.: Constant weight conflict-avoiding codes. SIAM J. Discret. Math. 21(4), 959\u2013979 (2007).","DOI":"10.1137\/06067852X"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Mishima M., Fu H.-L., Uruno S.: Optimal conflict-avoiding codes of length $$n\\equiv 0$$ n \u2261 0 (mod 16) and weight 3. Des. Codes Cryptogr. 52, 275\u2013291 (2009).","DOI":"10.1007\/s10623-009-9282-2"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen Q.A., Gy\u00f6rfi L., Massey J.L.: Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38(3), 940\u2013949 (1992).","DOI":"10.1109\/18.135636"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Shum K.W., Wong W.S.: A tight asymptotic bound on the size of constant-weight conflict-avoiding codes. Des. Codes Cryptogr. 57(1), 1\u201314 (2010).","DOI":"10.1007\/s10623-009-9345-4"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Shum K.W., Wong W.S.: Construction and applications of CRT sequences. IEEE Trans. Inf. Theory 56(11), 5780\u20135795 (2010).","DOI":"10.1109\/TIT.2010.2070550"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Shum K.W., Chen C.S., Sung C.W., Wong W.S.: Shift-invariant protocol sequences for the collision channel without feedback. IEEE Trans. Inf. Theory 55(7), 3312\u20133322 (2009).","DOI":"10.1109\/TIT.2009.2021335"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Shum K.W., Wong W.S., Chen C.S.: A general upper bound on the size of constant-weight conflict-avoiding codes. IEEE Trans. Inf. Theory 56(7), 3265\u20133276 (2010).","DOI":"10.1109\/TIT.2010.2048508"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Wong W.S.: New protocol sequences for random access channels without feedback. IEEE Trans. Inf. Theory 53(6), 2060\u20132071 (2007).","DOI":"10.1109\/TIT.2007.896867"},{"key":"57_CR18","doi-asserted-by":"crossref","unstructured":"Wu S.-L., Fu H.-L.: Optimal tight equi-difference conflict-avoiding codes of length $$n=2^k\\pm 1$$ n = 2 k \u00b1 1 and weight 3. J. Comb. Des. 21, 223\u2013231 (2013).","DOI":"10.1002\/jcd.21332"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Zhang Y., Shum K.W., Wong W.S.: Completely irrepressible sequences for the asynchronous collision channel without feedback. IEEE Trans. Veh. Technol. 60(4), 1859\u20131866 (2011).","DOI":"10.1109\/TVT.2011.2120636"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Zhang Y., Shum K.W., Wong W.S.: Strongly conflict-avoiding codes. SIAM J. Discret. Math. 25(3), 1035\u20131053 (2011).","DOI":"10.1137\/100800804"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0057-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0057-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0057-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:39Z","timestamp":1559246319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0057-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,11]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["57"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0057-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,11]]}}}