{"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":1772349694524,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,11]],"date-time":"2007-10-11T00:00:00Z","timestamp":1192060800000},"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":[[2007,10,17]]},"DOI":"10.1007\/s10623-007-9139-5","type":"journal-article","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T19:25:16Z","timestamp":1192044316000},"page":"379-390","source":"Crossref","is-referenced-by-count":31,"title":["Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three"],"prefix":"10.1007","volume":"45","author":[{"given":"Koji","family":"Momihara","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,11]]},"reference":[{"key":"9139_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0022-314X(79)90008-8","volume":"11","author":"B.C. Berndt","year":"1979","unstructured":"Berndt B.C., Evans R.J. (1979). Sums of Gauss, Jacobi, and Jacobsthal. J. Number Theory 11: 71\u201380","journal-title":"J. Number Theory"},{"issue":"1","key":"9139_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01388501","volume":"5","author":"M. Buratti","year":"1995","unstructured":"Buratti M. (1995). A powerful method for constructing difference families and optimal optical orthogonal codes. Des. Codes Cryptogr. 5(1): 13\u201325","journal-title":"Des. Codes Cryptogr."},{"key":"9139_CR3","unstructured":"Colbourn C.J., Dinitz J.H., Stinson D.R.: Surveys in combinatorics. In: Lamb, J.D., Preece, D.A., (eds.) pp. 37\u2013100. Applications to communications, cryptography, and Networking. London Math. Soc. Lecture Note, ser. 267, Cambridge Univ. Press (1999)."},{"issue":"3","key":"9139_CR4","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1109\/18.30982","volume":"35","author":"F.R.K. Chung","year":"1989","unstructured":"Chung F.R.K., Salehi J., Wei V.K. (1989). Optical orthogonal codes: Design, analysis, and applications. IEEE Trans. Inform. Theory 35(3): 595\u2013604","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9139_CR5","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/18.53748","volume":"36","author":"H. Chung","year":"1990","unstructured":"Chung H., Kumar P.V. (1990). Optical orthogonal codes\u2014New bounds and an optimal construction. IEEE Trans. Inform. Theory 36: 866\u2013873","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9139_CR6","first-page":"174","volume":"315","author":"R.J. Evans","year":"1980","unstructured":"Evans R.J. (1980). The 2 r -th power character of 2. J. Reine Angew. Math. 315: 174\u2013189","journal-title":"J. Reine Angew. Math."},{"key":"9139_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4064\/aa-39-3-281-294","volume":"39","author":"R.J. Evans","year":"1981","unstructured":"Evans R.J. (1981). Rational reciprocity laws. Acta Arith. 39: 281\u2013294","journal-title":"Acta Arith."},{"issue":"5","key":"9139_CR8","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/18.259673","volume":"39","author":"L. Gy\u00f6rfi","year":"1993","unstructured":"Gy\u00f6rfi L., Vajda I. (1993). Constructions of protocol sequences for multiple access collision channel without feedback. IEEE Trans. Inform. Theory 39(5): 1762\u20131765","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9139_CR9","first-page":"355","volume-title":"Mathmatische Abhandlungen Band 1","author":"H. Hasse","year":"1975","unstructured":"Hasse H. (1975). Mathmatische Abhandlungen Band 1. Walter de Gruyter, Berlin, pp. 355\u2013413."},{"key":"9139_CR10","doi-asserted-by":"crossref","unstructured":"Jimbo M., Mishima M., Janiszewski S., Teymorian A.Y., Tonchev V.: On conflict-avoiding codes of length n\u00a0=\u00a04m for three active users. IEEE Trans. Inform. Theory (to appear).","DOI":"10.1109\/TIT.2007.901233"},{"key":"9139_CR11","unstructured":"Levenshtein V.I.: Conflict-avoiding codes for three active users and cyclic triple systems. preprint."},{"key":"9139_CR12","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I., Tonchev V.D.: Optimal conflict-avoiding codes for three active users. In: 2005 IEEE International Symposium on Information Theory, pp. 535\u2013537, Adelaide, Australia, (2005).","DOI":"10.1109\/ISIT.2005.1523392"},{"issue":"2","key":"9139_CR13","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","volume":"31","author":"J.L. Massey","year":"1985","unstructured":"Massey J.L., Mathys P. (1985). The collision channel without feedback. IEEE Trans. Inform. Theory 31(2): 192\u2013204","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"9139_CR14","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 active users out of N multiple-access. IEEE Trans. Inform. Theory 36(6): 1206\u20131219","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9139_CR15","doi-asserted-by":"crossref","unstructured":"Momihara K., M\u00fcller M., Satoh J., Jimbo M.: Constant weight conflict-avoiding codes. SIAM J. Discr. Math. (to appear).","DOI":"10.1137\/06067852X"},{"issue":"3","key":"9139_CR16","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1109\/18.135636","volume":"38","author":"Q.A. 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 Trans. Inform. Theory 38(3): 940\u2013949","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9139_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21690-4","volume-title":"Classical theory of algebraic numbers","author":"P. Ribenboim","year":"2001","unstructured":"Ribenboim P. (2001). Classical theory of algebraic numbers. Springer-Verlag, New York"},{"issue":"4","key":"9139_CR18","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1023\/A:1022045812079","volume":"38","author":"B.S. Tsybakov","year":"2002","unstructured":"Tsybakov B.S., Rubinov A.R. (2002). Some constructions of conflict-avoiding codes. Prob. Inf. Trans. 38(4): 268\u2013279","journal-title":"Prob. Inf. Trans."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9139-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9139-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9139-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:09Z","timestamp":1559245809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9139-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,17]]}},"alternative-id":["9139"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9139-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,11]]}}}