{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T07:21:34Z","timestamp":1772349694529,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,5,5]],"date-time":"2013-05-05T00:00:00Z","timestamp":1367712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10623-013-9827-2","type":"journal-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T23:39:28Z","timestamp":1367624368000},"page":"791-804","source":"Crossref","is-referenced-by-count":14,"title":["New optimal constructions of conflict-avoiding codes of odd length and weight 3"],"prefix":"10.1007","volume":"73","author":[{"given":"Wenping","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-e","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongsu","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,5]]},"reference":[{"key":"9827_CR1","unstructured":"Bassalygo L.A., Pinsker M.S.: Limited multiple-access of a nonsynchronous channel (in Russian). Probl. Inf. Transm. 19, 92\u201396 (1983)."},{"key":"9827_CR2","unstructured":"Fu H.L., Li Y.H., Mishima M.: Optimal conflict avoiding codes of even length and weight 3. IEEE Trans. Inf. Theory 56, 5747\u20135756 (2010)."},{"key":"9827_CR3","unstructured":"Gryorfi N.Q.A.L., Massey J.L.: Constructions of binary constant weight cyclic codes and cyclically permutable codes. IEEE Trans. Inf. Theory 38, 940\u2013949 (1992)."},{"key":"9827_CR4","unstructured":"Gy\u00f6rfil V.I.: Constructions of protocol sequences for multiple access collision channel without feedback. IEEE Trans. Inf. Theory 39, 1762\u20131765 (1993)."},{"key":"9827_CR5","unstructured":"Jimbo M., Mishima M., Janiszewski S., Teymorian A.Y., Tonchev V.D.: On conflict avoiding codes of length n=4m for three active users. IEEE Trans. Inf. Theory 53, 2732\u20132742 (2007)."},{"key":"9827_CR6","unstructured":"Levenshtein V.I., Tonchev V.D.: Optimal conflict-avoiding codes for three active users. In: Proceedings of the IEEE International Symposium on Information Theory, Adelaide 4\u20139 Sept, 535\u2013537 (2005)."},{"key":"9827_CR7","unstructured":"Levenshtein V.I.: Conflict-avoiding codes for three active users and cyclic triple systems. Probl. Inf. Transm. 43, 199\u2013212 (2007)."},{"key":"9827_CR8","unstructured":"Massey J.L., Mathys P.: The collision channel without feedback. IEEE Trans. Inf. Theory 31, 192\u2013204 (1985)."},{"key":"9827_CR9","unstructured":"Mathys P.: A class of codes for a T active users out of N multiple-access communication system. IEEE Trans. Inf. Theory 36, 1206\u20131219 (1990)."},{"key":"9827_CR10","doi-asserted-by":"crossref","unstructured":"Mishima M., Fu H.L., Uruno S.: Optimal conflict avoiding codes of length n=(0 mod16) and weight 3. Des. Codes Cryptogr. 52, 275\u2013291 (2009).","DOI":"10.1007\/s10623-009-9282-2"},{"key":"9827_CR11","unstructured":"Momihara K., Muller M., Satoh J., Jimbo M.: Constant weight conflict avoiding codes. SIAM J. Discret. Math. 21, 959\u2013979 (2007)."},{"key":"9827_CR12","doi-asserted-by":"crossref","unstructured":"Momihara K.: Necessary and sufficient conditions for tight equidifference conflict avoiding codes of weight three. Des. Codes Cryptogr. 45, 379\u2013390 (2007).","DOI":"10.1007\/s10623-007-9139-5"},{"key":"9827_CR13","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, 3265\u20133276 (2010)."},{"key":"9827_CR14","unstructured":"Tsybakov B.S., Rubinov A.R.: Some constructions of conflict-avoiding codes. Probl. Inf. Transm. 38, 268\u2013279 (2002)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9827-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9827-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9827-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:36Z","timestamp":1559231916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9827-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9827"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9827-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,5]]}}}