{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:04:46Z","timestamp":1775016286152,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1134\/s0032946017010033","type":"journal-article","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T01:07:34Z","timestamp":1492823254000},"page":"42-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal conflict-avoiding codes for 3, 4 and 5 active users"],"prefix":"10.1134","volume":"53","author":[{"given":"T.","family":"Baicheva","sequence":"first","affiliation":[]},{"given":"S.","family":"Topalova","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"issue":"3","key":"4284_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Salehi, J.A., and Wei, V.K., Optical Orthogonal Codes: Design, Analysis, and Applications, IEEE Trans. Inform. Theory, 1989, vol. 35, no. 3, pp. 595\u2013604.","journal-title":"Analysis, and Applications, IEEE Trans. Inform. Theory"},{"key":"4284_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/ISIT.2005.1523392","volume-title":"Proc. 2005 IEEE Int. Sympos. on Information Theory (ISIT\u20192005), Adelaide, Australia, Sept. 4\u20139","author":"V.I. Levenshtein","year":"2005","unstructured":"Levenshtein, V.I. and Tonchev, V.D., Optimal Conflict-Avoiding Codes for Three Active Users, in Proc. 2005 IEEE Int. Sympos. on Information Theory (ISIT\u20192005), Adelaide, Australia, Sept. 4\u20139, 2005, pp. 535\u2013537."},{"issue":"3","key":"4284_CR3","first-page":"39","volume":"43","author":"V.I. Levenshtein","year":"2007","unstructured":"Levenshtein, V.I., Conflict-Avoiding Codes and Cyclic Triple Systems, Probl. Peredachi Inf., 2007, vol. 43, no. 3, pp. 39\u201353 [Probl. Inf. Trans. (Engl. Transl.), 2007, vol. 43, no. 3, pp. 199\u2013212].","journal-title":"Probl. Peredachi Inf."},{"issue":"8","key":"4284_CR4","doi-asserted-by":"publisher","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., and Tonchev, V.D., On Conflict-Avoiding Codes of Length n = 4m for Three Active Users, IEEE Trans. Inform. Theory, 2007, vol. 53, no. 8, pp. 2732\u20132742.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"4284_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10623-009-9282-2","volume":"52","author":"M. Mishima","year":"2009","unstructured":"Mishima, M., Fu, H.-L., and Uruno, S., Optimal Conflict-Avoiding Codes of Length n = 0 (mod 16) and Weight 3, Des. Codes Cryptogr., 2009, vol. 52, no. 3, pp. 275\u2013291.","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"4284_CR6","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.-Y., and Mishima, M., Optimal Conflict-Avoiding Codes of Even Length and Weight 3, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 11, pp. 5747\u20135756.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"4284_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jcd.21332","volume":"21","author":"S.-L. Wu","year":"2013","unstructured":"Wu, S.-L. and Fu, H.-L., Optimal Tight Equi-difference Conflict-Avoiding Codes of Length n = 2k \u00b1 1 and Weight 3, J. Combin. Des., 2013, vol. 21, no. 6, pp. 223\u2013231.","journal-title":"J. Combin. Des."},{"issue":"3","key":"4284_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10623-007-9139-5","volume":"45","author":"K. Momihara","year":"2007","unstructured":"Momihara, K., Necessary and Sufficient Conditions for Tight Equi-difference Conflict-Avoiding Codes of Weight Three, Des. Codes Cryptogr., 2007, vol. 45, no. 3, pp. 379\u2013390.","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"4284_CR9","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/06067852X","volume":"21","author":"K. Momihara","year":"2007","unstructured":"Momihara, K., M\u00fcler, M., Satoh, J., and Jimbo, M., Constant Weight Conflict-Avoiding Codes, SIAM J. Discrete Math., 2007, vol. 21, no. 4, pp. 959\u2013979.","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"4284_CR10","doi-asserted-by":"publisher","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., and Shum, K.W., Optimal Conflict-Avoiding Codes of Odd Length and Weight Three, Des. Codes Cryptogr., 2014, vol. 72, no. 2, pp. 289\u2013309.","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"4284_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-009-9345-4","volume":"57","author":"K.W. Shum","year":"2010","unstructured":"Shum, K.W. and Wong, W.S., A Tight Asymptotic Bound on the Size of Constant-Weight Conflict-Avoiding Codes, Des., Codes Cryptogr., 2010, vol. 57, no. 1, pp. 1\u201314.","journal-title":"Des., Codes Cryptogr."},{"issue":"7","key":"4284_CR12","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2010.2048508","volume":"56","author":"K.W. Shum","year":"2010","unstructured":"Shum, K.W., Wong, W.S., and Chen, C.S., A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 7, pp. 3265\u20133276.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4284_CR13","unstructured":"Tonchev, V.D., Tables of Conflict-Avoiding Codes. Available online at http:\/\/www.math.mtu.edu\/~tonchev\/CAC.html."},{"issue":"4","key":"4284_CR14","first-page":"92","volume":"19","author":"L.A. Bassalygo","year":"1983","unstructured":"Bassalygo, L.A. and Pinsker, M.S., Restricted Asynchronous Multiple Access, Probl. Peredachi Inf., 1983, vol. 19, no. 4, pp. 92\u201396.","journal-title":"Probl. Peredachi Inf."},{"key":"4284_CR15","volume-title":"Proc. 14th Int. Conf. on Problems of Theoretical Cybernetics, Penza, Russia, May 23\u201328","author":"V.I. Levenshtein","year":"2005","unstructured":"Levenshtein, V.I., Conflict-Avoiding Codes for Many Active Users, in Proc. 14th Int. Conf. on Problems of Theoretical Cybernetics, Penza, Russia, May 23\u201328, 2005, Moscow: Izd. Mekh.-Mat. MGU, 2005, p.86."},{"key":"4284_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ffa.2013.11.001","volume":"26","author":"Y. Lin","year":"2014","unstructured":"Lin, Y., Mishima, M., Satoh, J., and Jimbo, M., Optimal Equi-difference Conflict-Avoiding Codes of Odd Length and Weight Three, Finite Fields Appl., 2014, vol. 26, pp. 49\u201368.","journal-title":"Finite Fields Appl."},{"issue":"3","key":"4284_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10623-013-9827-2","volume":"73","author":"W. Ma","year":"2014","unstructured":"Ma, W., Zhao, C., and Shen, D., New Optimal Constructions of Conflict-Avoiding Codes of Odd Length and Weight 3, Des. Codes Cryptogr., 2014, vol. 73, no. 3, pp. 791\u2013804.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"4284_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/jcd.20296","volume":"20","author":"T. Baicheva","year":"2012","unstructured":"Baicheva, T. and Topalova, S., Optimal (v, 4, 2, 1) Optical Orthogonal Codes with Small Parameters, J. Combin. Des., 2012, vol. 20, no. 2, pp. 142\u2013160.","journal-title":"J. Combin. Des."},{"issue":"3","key":"4284_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00200-013-0192-1","volume":"24","author":"T. Baicheva","year":"2013","unstructured":"Baicheva, T. and Topalova, S., Optimal (v, 5, 2, 1) Optical Orthogonal Codes of Small v, Appl. Algebra Engrg. Comm. Comput., 2013, vol. 24, no. 3, pp. 165\u2013177.","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"1","key":"4284_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.55630\/sjc.2015.9.83-92","volume":"9","author":"T. Baicheva","year":"2015","unstructured":"Baicheva, T. and Topalova, S., Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths, Serdica J. Comput., 2015, vol. 9, no. 1, pp. 83\u201392.","journal-title":"Serdica J. Comput."},{"key":"4284_CR21","first-page":"80","volume-title":"Proc. Int. Sci. Jubilee Conf. \u201c25 Years Faculty of Mathematics and Informatics,\u201d Veliko Tarnovo, Bulgaria, Nov. 27\u201328","author":"T. Baicheva","year":"2015","unstructured":"Baicheva, T. and Topalova, S., Maximal (v, 4, 3, 1) Optical Orthogonal Codes for Asynchronous Transmission, in Proc. Int. Sci. Jubilee Conf. \u201c25 Years Faculty of Mathematics and Informatics,\u201d Veliko Tarnovo, Bulgaria, Nov. 27\u201328, 2015, pp. 80\u201385."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946017010033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946017010033","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946017010033.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:35:33Z","timestamp":1775010933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946017010033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["4284"],"URL":"https:\/\/doi.org\/10.1134\/s0032946017010033","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"9 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}