{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:35:18Z","timestamp":1725579318734},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"JSPS","award":["(C)25400200"]},{"name":"JSPS","award":["(B)22340016","22654031"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Finite Fields and Their Applications"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1016\/j.ffa.2013.11.001","type":"journal-article","created":{"date-parts":[[2013,11,28]],"date-time":"2013-11-28T22:31:12Z","timestamp":1385677872000},"page":"49-68","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["Optimal equi-difference conflict-avoiding codes of odd length and weight three"],"prefix":"10.1016","volume":"26","author":[{"given":"Yiling","family":"Lin","sequence":"first","affiliation":[]},{"given":"Miwako","family":"Mishima","sequence":"additional","affiliation":[]},{"given":"Junya","family":"Satoh","sequence":"additional","affiliation":[]},{"given":"Masakazu","family":"Jimbo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ffa.2013.11.001_br0010","first-page":"92","article-title":"Limited multiple-access of a nonsynchronous channel","volume":"19","author":"Bassalygo","year":"1983","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/j.ffa.2013.11.001_br0020","series-title":"History of the Theory of Numbers, vol. I: Divisibility and Primality","author":"Dickson","year":"1919"},{"key":"10.1016\/j.ffa.2013.11.001_br0030","article-title":"A Wieferich prime search up to 6.7\u00d71015","volume":"14","author":"Dorais","year":"2011","journal-title":"J. Integer Seq."},{"issue":"11","key":"10.1016\/j.ffa.2013.11.001_br0040","doi-asserted-by":"crossref","first-page":"5747","DOI":"10.1109\/TIT.2010.2069270","article-title":"Optimal conflict-avoiding codes of even length and weight 3","volume":"56","author":"Fu","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2013.11.001_br0050","article-title":"Optimal conflict-avoiding codes of odd length and weight three","author":"Fu","year":"2012","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"10.1016\/j.ffa.2013.11.001_br0060","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1109\/18.259673","article-title":"Constructions of protocol sequences for multiple access collision channel without feedback","volume":"39","author":"Gy\u00f6rfi","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2013.11.001_br0070","author":"Gallot"},{"issue":"8","key":"10.1016\/j.ffa.2013.11.001_br0080","doi-asserted-by":"crossref","first-page":"2732","DOI":"10.1109\/TIT.2007.901233","article-title":"On conflict-avoiding codes of length n=4m for three active users","volume":"53","author":"Jimbo","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.ffa.2013.11.001_br0090","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1134\/S0032946007030039","article-title":"Conflict-avoiding codes and cyclic triple systems","volume":"43","author":"Levenshtein","year":"2007","journal-title":"Probl. Inf. Transm."},{"key":"10.1016\/j.ffa.2013.11.001_br0100","series-title":"Proc. IEEE Int. Symp. Inform. Theory","first-page":"535","article-title":"Optimal conflict-avoiding codes for three active users","author":"Levenshtein","year":"2005"},{"key":"10.1016\/j.ffa.2013.11.001_br0110","article-title":"New optimal constructions of conflict-avoiding codes of odd length and weight 3","author":"Ma","year":"2013","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"10.1016\/j.ffa.2013.11.001_br0120","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TIT.1985.1057010","article-title":"The collision channel without feedback","volume":"31","author":"Massey","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.ffa.2013.11.001_br0130","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1109\/18.59923","article-title":"A class of codes for a T active users out of N multiple-access communication system","volume":"36","author":"Mathys","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.ffa.2013.11.001_br0140","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10623-009-9282-2","article-title":"Optimal conflict-avoiding codes of length n\u22610(mod16) and weight 3","volume":"52","author":"Mishima","year":"2009","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10.1016\/j.ffa.2013.11.001_br0150","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10623-007-9139-5","article-title":"Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three","volume":"45","author":"Momihara","year":"2007","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"10.1016\/j.ffa.2013.11.001_br0160","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/06067852X","article-title":"Constant weight conflict-avoiding codes","volume":"21","author":"Momihara","year":"2007","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.ffa.2013.11.001_br0170","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1109\/18.135636","article-title":"Constructions of binary constant-weight cyclic codes and cyclically permutable codes","volume":"38","author":"Nguyen","year":"1992","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2013.11.001_br0180","unstructured":"N.J.A. Sloane, Seq. No. A001220, The On-line Encyclopedia of Integer Sequences, The OEIS Foundation Inc., http:\/\/oeis.org\/."},{"key":"10.1016\/j.ffa.2013.11.001_br0190","unstructured":"N.J.A. Sloane, Seq. No. A135304, The On-line Encyclopedia of Integer Sequences, The OEIS Foundation Inc., http:\/\/oeis.org\/."},{"issue":"4","key":"10.1016\/j.ffa.2013.11.001_br0200","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1023\/A:1022045812079","article-title":"Some constructions of conflict-avoiding codes","volume":"38","author":"Tsybakov","year":"2002","journal-title":"Probl. Inf. Transm."},{"issue":"6","key":"10.1016\/j.ffa.2013.11.001_br0210","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jcd.21332","article-title":"Optimal tight equi-difference conflict-avoiding codes of length n=2k\u00b11 and weight three","volume":"21","author":"Wu","year":"2013","journal-title":"J. Des. Comb."}],"container-title":["Finite Fields and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579713001160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579713001160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T16:50:56Z","timestamp":1539017456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579713001160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":21,"alternative-id":["S1071579713001160"],"URL":"https:\/\/doi.org\/10.1016\/j.ffa.2013.11.001","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1016%2FJ.FFA.2013.11.001', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid126' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:126', '*');; return false;" style='text-decoration: none; '>USERS </a> <a style='color: white;' href='#diffid126'><sup>3</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>