{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:19:56Z","timestamp":1648952396681},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,26]],"date-time":"2015-04-26T00:00:00Z","timestamp":1430006400000},"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":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11277-015-2599-4","type":"journal-article","created":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T11:55:30Z","timestamp":1429962930000},"page":"153-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strongly Conflict-Avoiding Codes with Weight Three"],"prefix":"10.1007","volume":"84","author":[{"given":"Zhihua","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,26]]},"reference":[{"key":"2599_CR1","doi-asserted-by":"crossref","first-page":"5747","DOI":"10.1109\/TIT.2010.2069270","volume":"56","author":"H-L Fu","year":"2010","unstructured":"Fu, H.-L., Lin, Y.-H., & Mishima, M. (2010). Optimal conflict-avoiding codes of even length and weight 3. IEEE Transactions on Information Theory, 56, 5747\u20135756.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10623-012-9764-5","volume":"72","author":"H-L Fu","year":"2014","unstructured":"Fu, H.-L., Lo, Y.-H., & Shum, K. W. (2014). Optimal conflict-avoiding codes of odd length and weight three. Designs, Codes and Cryptography, 72, 289\u2013309.","journal-title":"Designs, Codes and Cryptography"},{"key":"2599_CR3","doi-asserted-by":"crossref","first-page":"2396","DOI":"10.1109\/18.887852","volume":"46","author":"R Fuji-Hara","year":"2000","unstructured":"Fuji-Hara, R., & Miao, Y. (2000). Optical orthgonal codes: Their bounds and new optimal construction. IEEE Transactions on Information Theory, 46, 2396\u20132406.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR4","doi-asserted-by":"crossref","first-page":"2732","DOI":"10.1109\/TIT.2007.901233","volume":"53","author":"M Jimbo","year":"2007","unstructured":"Jimbo, M., Mishima, M., Janiszewski, S., Teymorian, A. Y., & Tonchev, V. D. (2007). On conflict-avoiding codes of length $$n=4m$$ n = 4 m for three active users. IEEE Transactions on Information Theory, 53, 2732\u20132742.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1134\/S0032946007030039","volume":"43","author":"VI Levenshtein","year":"2007","unstructured":"Levenshtein, V. I. (2007). Conflict-avoiding codes for three active users and cyclic triple systems. Problems of Information Transmission, 43, 199\u2013212.","journal-title":"Problems of Information Transmission"},{"key":"2599_CR6","doi-asserted-by":"crossref","unstructured":"Levenshtein, V. I., & Tonchev, V. D. (2005). Optimal conflict-avoiding codes for three active users. In Proceedings IEEE International Symposium Information Theory, Adelaide, Australia (pp. 535\u2013537)","DOI":"10.1109\/ISIT.2005.1523392"},{"key":"2599_CR7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","volume":"31","author":"JL Massey","year":"1985","unstructured":"Massey, J. L., & Mathys, P. (1985). The collision channel without feedback. IEEE Transactions on Information Theory, 31, 192\u2013204.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR8","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1109\/18.59923","volume":"36","author":"P Mathys","year":"1990","unstructured":"Mathys, P. (1990). A class of codes for a $$T$$ T active users out of $$N$$ N mulitiple-access communication system. IEEE Transactions on Information Theory, 36, 1206\u20131219.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2599_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10623-009-9282-2","volume":"52","author":"M Mishima","year":"2009","unstructured":"Mishima, M., Fu, H.-L., & Uruno, S. (2009). Optimal conflict-avoiding codes of length $$n \\equiv 0\\quad (\\hbox{mod}\\,16)$$ n \u2261 0 ( mod 16 ) and weight 3. Designs, Codes and Cryptography, 52(3), 275\u2013291.","journal-title":"Designs, Codes and Cryptography"},{"key":"2599_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10623-007-9139-5","volume":"45","author":"K Momihara","year":"2007","unstructured":"Momihara, K. (2007). Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three. Designs, Codes and Cryptography, 45, 379\u2013390.","journal-title":"Designs, Codes and Cryptography"},{"key":"2599_CR11","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.ffa.2009.02.003","volume":"15","author":"K Momihara","year":"2009","unstructured":"Momihara, K. (2009). On cyclic $$2(k - 1)$$ 2 ( k - 1 ) -support $$(n, k)_{k-1}$$ ( n , k ) k - 1 difference families. Finite Fields and Their Applications, 15, 415\u2013427.","journal-title":"Finite Fields and Their Applications"},{"key":"2599_CR12","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIT.2008.2009852","volume":"55","author":"K Momihara","year":"2009","unstructured":"Momihara, K., & Buratti, M. (2009). Bounds and constructions of optimal $$(n,4,2,1)$$ ( n , 4 , 2 , 1 ) optical orthogonal codes. IEEE Transactions on Information Theory, 55, 514\u2013523.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR13","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/06067852X","volume":"21","author":"K Momihara","year":"2007","unstructured":"Momihara, K., M\u00fcller, M., Satoh, J., & Jimbo, M. (2007). Constant weight conflict-avoiding codes. SIAM Journal on Discrete Mathematics, 21, 959\u2013979.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"2599_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-009-9345-4","volume":"57","author":"KW Shum","year":"2010","unstructured":"Shum, K. W., & Wong, W. S. (2010). A tight asymptotic bound on the size of constant-weight conflict avoiding codes. Designs, Codes and Cryptography, 57(1), 1\u201314.","journal-title":"Designs, Codes and Cryptography"},{"issue":"7","key":"2599_CR15","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1109\/TIT.2010.2048508","volume":"56","author":"KW Shum","year":"2010","unstructured":"Shum, K. W., Wong, W. S., & Chen, C. S. (2010). A general upper bound on the size of constant-weight conflict avoiding codes. IEEE Transactions on Information Theory, 56(7), 3265\u20133276.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2599_CR16","unstructured":"Tsybakov, B.S., & Likhanov, N.B. (1983). Packet communication on a channel without feedback. Problemy peredachi informatsii, 19, 69\u201384. [Problem of Inform. Trans. (English Transl.) pp. 147\u2013161]."},{"issue":"6","key":"2599_CR17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jcd.21332","volume":"21","author":"SL Wu","year":"2013","unstructured":"Wu, S. L., & Fu, H.-L. (2013). Optimal tight equi-difference conflict-avoiding codes of length $$n=2^k\\pm 1$$ n = 2 k \u00b1 1 and weight 3. Journal of Combinatorial Designs, 21(6), 223\u2013231.","journal-title":"Journal of Combinatorial Designs"},{"key":"2599_CR18","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/100800804","volume":"25","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Shum, K. W., & Wong, W. S. (2011). Strongly conflict-avoiding codes. SIAM Journal on Discrete Mathematics, 25, 1035\u20131053.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2599-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-015-2599-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2599-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:18:19Z","timestamp":1559380699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-015-2599-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,26]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["2599"],"URL":"https:\/\/doi.org\/10.1007\/s11277-015-2599-4","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,26]]}}}