{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T06:40:30Z","timestamp":1721889630894},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,12,21]],"date-time":"2014-12-21T00:00:00Z","timestamp":1419120000000},"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,3]]},"DOI":"10.1007\/s10623-014-0030-x","type":"journal-article","created":{"date-parts":[[2014,12,20]],"date-time":"2014-12-20T07:06:30Z","timestamp":1419059190000},"page":"747-776","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal equi-difference conflict-avoiding codes of weight four"],"prefix":"10.1007","volume":"78","author":[{"given":"Yiling","family":"Lin","sequence":"first","affiliation":[]},{"given":"Miwako","family":"Mishima","sequence":"additional","affiliation":[]},{"given":"Masakazu","family":"Jimbo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,21]]},"reference":[{"key":"30_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":"30_CR2","doi-asserted-by":"crossref","unstructured":"Fu H.-L., Lo Y.-H., Shum S.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":"30_CR3","doi-asserted-by":"crossref","unstructured":"Jimbo M., Mishima M., Janiszewski S., Teymorian A.Y., Tonchev V.D.: On conflict-avoiding codes of length $$n=4m$$ n = 4 m for three active users. IEEE Trans. Inf. Theory 53(8), 2732\u20132742 (2007).","DOI":"10.1109\/TIT.2007.901233"},{"key":"30_CR4","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, pp. 535\u2013537 (2005).","DOI":"10.1109\/ISIT.2005.1523392"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I., Han Vinck A.J.: Perfect (d, k)-codes capable of correcting single peak-shifts. IEEE Trans. Inf. Theory 39(2), 656\u2013662 (1993).","DOI":"10.1109\/18.212300"},{"key":"30_CR6","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":"30_CR7","doi-asserted-by":"crossref","unstructured":"Lo Y.-H., Fu H.-L., Lin Y.-H.: Weighted maximum matchings and optimal equ-difference conflict-avoiding codes. Des. Codes Cryptogr. (2014). doi: 10.1007\/s10623-014-9961-5 .","DOI":"10.1007\/s10623-014-9961-5"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Ma W., Zhao C., Shen D.: New optimal constructions of conflict-avoiding codes of odd length and weight 3. Des. Codes Cryptogr. (2014). doi: 10.1007\/s10623-013-9827-2 .","DOI":"10.1007\/s10623-013-9827-2"},{"key":"30_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":"30_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":"30_CR11","doi-asserted-by":"crossref","unstructured":"Mishima M., Fu H.-L., Uruno S.: Optimal conflict-avoiding codes of length $$n \\equiv 0 ~(mod 16)$$ n \u2261 0 ( m o d 16 ) and weight 3. Des. Codes Cryptogr. 52, 275\u2013291 (2009).","DOI":"10.1007\/s10623-009-9282-2"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Munemasa A.: On perfect t-shift codes in Abelian groups. Des. Codes Cryptogr. 5(3), 253\u2013259 (1995).","DOI":"10.1007\/BF01388387"},{"key":"30_CR13","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":"30_CR14","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 three. J. Des. Comb. 21(6), 223\u2013231 (2013).","DOI":"10.1002\/jcd.21332"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0030-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-0030-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0030-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:38Z","timestamp":1559246318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-0030-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,21]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-0030-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,21]]}}}