{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:51Z","timestamp":1740123831803,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T00:00:00Z","timestamp":1510704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61301107","11601454"],"award-info":[{"award-number":["61301107","11601454"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open research fund of National Mobile Communications Research Laboratory, Southeast University","award":["2017D09"],"award-info":[{"award-number":["2017D09"]}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2016J05021"],"award-info":[{"award-number":["2016J05021"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s11276-017-1623-x","type":"journal-article","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T02:55:49Z","timestamp":1510714549000},"page":"1697-1709","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New CRT sequence sets for a collision channel without feedback"],"prefix":"10.1007","volume":"25","author":[{"given":"Yijin","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5510-8842","authenticated-orcid":false,"given":"Yuan-Hsun","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Kenneth W.","family":"Shum","sequence":"additional","affiliation":[]},{"given":"Wing Shing","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,15]]},"reference":[{"issue":"2","key":"1623_CR1","doi-asserted-by":"publisher","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(2), 192\u2013204.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"1623_CR2","doi-asserted-by":"publisher","first-page":"2060","DOI":"10.1109\/TIT.2007.896867","volume":"53","author":"WS Wong","year":"2007","unstructured":"Wong, W. S. (2007). New protocol sequences for random access channels without feedback. IEEE Transactions on Information Theory, 53(6), 2060\u20132071.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"1623_CR3","doi-asserted-by":"publisher","first-page":"3053","DOI":"10.1109\/TVT.2007.914478","volume":"57","author":"CS Chen","year":"2008","unstructured":"Chen, C. S., Wong, W. S., & Song, Y. Q. (2008). Constructions of robust protocol sequences for wireless sensor and ad hoc networks. IEEE Transactions on Vehicular Technology, 57(5), 3053\u20133063.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"7","key":"1623_CR4","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1109\/TIT.2009.2021335","volume":"55","author":"KW Shum","year":"2009","unstructured":"Shum, K. W., Chen, C. S., Sung, C. W., & Wong, W. S. (2009). Shift-invariant protocol sequences for the collision channel without feedback. IEEE Transactions on Information Theory, 55(7), 3312\u20133322.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1623_CR5","doi-asserted-by":"crossref","unstructured":"Wu, Y., Shum, K. W., Lin, Z., Wong, W. S., & Shen, L. (2013). Protocol sequences for mobile ad hoc networks. In Proceedings of IEEE international conference on communication, Budapest (pp. 1730\u20131735).","DOI":"10.1109\/ICC.2013.6654768"},{"issue":"3","key":"1623_CR6","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1109\/TVT.2013.2279857","volume":"63","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Shum, K. W., Wong, W. S., & Shen, L. (2014). Safety messages broadcast in vehicular ad hoc networks based on protocol sequences. IEEE Transactions on Vehicular Technology, 63(3), 1467\u20131479.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"2","key":"1623_CR7","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TVT.2013.2280996","volume":"63","author":"WS Wong","year":"2014","unstructured":"Wong, W. S. (2014). Transmission sequence design and allocation for wide area ad hoc networks. IEEE Transactions on Vehicular Technology, 63(2), 869\u2013878.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"1623_CR8","doi-asserted-by":"crossref","unstructured":"Mao, Y., & Shen, L. (2016). A framework for protocol sequence allocation in vehicular ad hoc networks. In Proceedings of IEEE vehicular technology conference, Nanjing, China","DOI":"10.1109\/VTCSpring.2016.7504066"},{"issue":"4","key":"1623_CR9","first-page":"74","volume":"37","author":"Z Xu","year":"2016","unstructured":"Xu, Z., Cai, L., & Wu, Y. (2016). Channel access mechanism based on equally allocation of protocol sequence for VANET. Journal on Communication, 37(4), 74\u201386.","journal-title":"Journal on Communication"},{"issue":"10","key":"1623_CR10","doi-asserted-by":"publisher","first-page":"4736","DOI":"10.1109\/TCOMM.2016.2606621","volume":"65","author":"C-C Chen","year":"2016","unstructured":"Chen, C.-C., Yang, G.-C., Chang, M.-K., Lin, J.-S., Wong, W. S., & Kwong, W. C. (2016). Constructions and throughput analyses of protocol sequences with adjustable duty factor for collision channels without Feedback. IEEE Transaction on Communication, 65(10), 4736\u20134748.","journal-title":"IEEE Transaction on Communication"},{"issue":"4","key":"1623_CR11","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1109\/TCOMM.2016.2538259","volume":"64","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Lo, Y. H., Wong, W. S., & Shu, F. (2016). Protocol sequences for the multiple-packet reception channel without feedback. IEEE Transaction on Communication, 64(4), 1687\u20131698.","journal-title":"IEEE Transaction on Communication"},{"key":"1623_CR12","unstructured":"Salaun, L., Chen, C. S., Chen, Y. & Wong, W. S. (2016). Constant delivery delay protocol sequences for the collision channel without feedback. In Proceedings of international symposium on wireless personal multimedia communication, Shenzhen, China."},{"issue":"3","key":"1623_CR13","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/18.135636","volume":"38","author":"QA Nguyen","year":"1992","unstructured":"Nguyen, Q. A., Gy\u00f6rfi, L., & Massey, J. L. (1992). Constructions of binary constant-weight cyclic codes and cyclically permutable codes. IEEE Transactions on Information Theory, 38(3), 940\u2013949.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"1623_CR14","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1109\/18.259673","volume":"39","author":"L Gy\u00f6rfi","year":"1993","unstructured":"Gy\u00f6rfi, L., & Vajda, I. (1993). Construction of protocol sequences for multiple-access collision channel without feedback. IEEE Transactions on Information Theory, 39(5), 1762\u20131765.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"1623_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/18.370117","volume":"41","author":"S Bitan","year":"1995","unstructured":"Bitan, S., & Etzion, T. (1995). Constructions for optimal constant weight cyclically permutable codes and difference families. IEEE Transactions on Information Theory, 41(1), 77\u201387.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"1623_CR16","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1049\/el:19950202","volume":"31","author":"GC Yang","year":"1995","unstructured":"Yang, G. C., & Kwong, W. C. (1995). Performance analysis of optical CDMA with prime codes. IEEE Electron Letters, 31(7), 569\u2013570.","journal-title":"IEEE Electron Letters"},{"key":"1623_CR17","volume-title":"Prime codes with applications to CDMA optical and wireless networks","author":"GC Yang","year":"2002","unstructured":"Yang, G. C., & Kwong, W. C. (2002). Prime codes with applications to CDMA optical and wireless networks. Norwood, MA: Artech House."},{"key":"1623_CR18","doi-asserted-by":"crossref","unstructured":"Shum, K. W., Wong, W. S., Sung, C. W., & Chen, C. S. (2009). Design and construction of protocol sequences: Shift invariance and user irrepressibility. In Proceedings of IEEE international symposium on information theory, Seoul, Korea (pp. 1368\u20131372).","DOI":"10.1109\/ISIT.2009.5205912"},{"issue":"11","key":"1623_CR19","doi-asserted-by":"publisher","first-page":"5780","DOI":"10.1109\/TIT.2010.2070550","volume":"56","author":"KW Shum","year":"2010","unstructured":"Shum, K. W., & Wong, W. S. (2010). Construction and applications of CRT sequences. IEEE Transactions on Information Theory, 56(11), 5780\u20135795.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1623_CR20","doi-asserted-by":"crossref","unstructured":"Shum, K. W., Zhang, Y., & Wong, W. S. (2010). User-irrepressible sequences. In Proceedings of conference on SETA, Paris (pp. 88\u2013101).","DOI":"10.1007\/978-3-642-15874-2_7"},{"key":"1623_CR21","unstructured":"Levenshtein, V. I., & Tonchev, V. D. (2005). Optimal conflict-avoiding codes for three active users. In: Proceedings of IEEE international symposium on information theory, Adelaide (pp. 535\u2013537)."},{"issue":"11","key":"1623_CR22","doi-asserted-by":"publisher","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(11), 5747\u20135756.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"1623_CR23","doi-asserted-by":"publisher","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"},{"issue":"2","key":"1623_CR24","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10623-014-9961-5","volume":"76","author":"Y-H Lo","year":"2015","unstructured":"Lo, Y.-H., Fu, H.-L., & Lin, Y.-H. (2015). Weighted maximum matchings and optimal equi-difference conflict-avoiding codes. Designs, Codes and Cryptography, 76(2), 361\u2013372.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"1623_CR25","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s10623-014-0030-x","volume":"78","author":"Y Lin","year":"2016","unstructured":"Lin, Y., Mishima, M., & Jimbo, M. (2016). Optimal equi-difference conflict-avoiding codes of weight four. Designs, Codes and Cryptography, 78(3), 747\u2013776.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"1623_CR26","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"FRK Chung","year":"1989","unstructured":"Chung, F. R. K., Salehi, J. A., & Wei, V. K. (1989). Optimal optical orthogonal codes: Design, analysis, and applications. IEEE Transactions on Information Theory, 35(3), 595\u2013604.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"1623_CR27","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1109\/TIT.2010.2043772","volume":"56","author":"J Wang","year":"2010","unstructured":"Wang, J., & Yin, J. (2010). Two-dimensional optical orthogonal codes and semicyclic group divisible designs. IEEE Transactions on Information Theory, 56(5), 2177\u20132187.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1623_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/jcd.21554","volume":"25","author":"T Feng","year":"2016","unstructured":"Feng, T., Wang, L., Wang, X., & Zhao, Y. (2016). Optimal two-dimensional optical orthogonal codes with the Best cross-correlation constraint. Journal of Combinatorial Designs, 25, 349\u2013380.","journal-title":"Journal of Combinatorial Designs"},{"issue":"1","key":"1623_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I Chlamtac","year":"1994","unstructured":"Chlamtac, I., & Farag\u00f3, A. (1994). Making transmission schedules immune to topology changes in multihop packet radio networks. IEEE\/ACM Transactions on Networking, 2(1), 23\u201329.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"1623_CR30","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11276-006-6528-z","volume":"12","author":"W Chu","year":"2006","unstructured":"Chu, W., Colbourn, C. J., & Syrotiuk, V. R. (2006). The effects of synchronization on topology-transparent scheduling. Wireless Networks, 12(6), 681\u2013690.","journal-title":"Wireless Networks"},{"issue":"4","key":"1623_CR31","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.comcom.2004.12.026","volume":"29","author":"W Chu","year":"2006","unstructured":"Chu, W., Colbourn, C. J., & Syrotiuk, V. R. (2006). Slot synchronized topology-transparent scheduling for sensor networks. Computer Communications, 29(4), 421\u2013428.","journal-title":"Computer Communications"},{"issue":"11","key":"1623_CR32","doi-asserted-by":"publisher","first-page":"5940","DOI":"10.1109\/TWC.2014.2358644","volume":"13","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Li, V. O. K., Leung, K.-C., & Zhang, L. (2014). Topology-transparent scheduling in mobile ad hoc networks with multiple packet reception capability. IEEE Transactions on Wireless Communications, 13(11), 5940\u20135953.","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"1623_CR33","doi-asserted-by":"crossref","unstructured":"Colbourn, C. J., Dinitz, J. H., & Stinson, D. R. (1999). Applications of combinatorial designs to communications, cryptography, and networking. In J. D. Lamb & D. A. Preece (Eds.) Surveys in combinatorics, ser. Lecture Note Series 267 (pp. 37\u2013100). London: London Math. Soc.","DOI":"10.1017\/CBO9780511721335.004"},{"issue":"4","key":"1623_CR34","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/JSAC.1984.1146089","volume":"2","author":"YN Hui","year":"1984","unstructured":"Hui, Y. N. (1984). Multiple accessing for the collision channel without feedback. IEEE Journal on Selected Areas in Communications, 2(4), 575\u2013582.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"1623_CR35","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1109\/TVT.2011.2120636","volume":"60","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Shum, K. W., & Wong, W. S. (2011). Complete irrepressible sequences for the asynchronous collision channel without feedback. IEEE Transactions on Vehicular Technology, 60(4), 1859\u20131866.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"1623_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A classical introduction to modern number theory","author":"K Ireland","year":"1990","unstructured":"Ireland, K., & Rosen, M. (1990). A classical introduction to modern number theory. New York: Springer."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1623-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-017-1623-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-017-1623-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T00:58:58Z","timestamp":1570323538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-017-1623-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,15]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1623"],"URL":"https:\/\/doi.org\/10.1007\/s11276-017-1623-x","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2017,11,15]]},"assertion":[{"value":"15 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}