login
Maximal size of conflict-avoiding code of length 2n+1.
2

%I #39 Jun 28 2023 14:45:14

%S 1,1,1,2,2,3,4,4,4,5,5,6,6,7,7,8,8,9,10,10,10,11,11,11,13,13,13,14,14,

%T 15,15,16,16,17,17,17,19,18,19,19,20,21,22,21,22,23,23,24,24,25,25,26,

%U 26,27,28,28,28,29,29,29,31,31,30,31,32,32,33,34,34,35,35,36,36,37,36,38,38,39,40

%N Maximal size of conflict-avoiding code of length 2n+1.

%C This sequence is not monotonically increasing. - _Kenneth Shum_, Jul 08 2014

%H Kenneth Shum, <a href="/A135304/b135304.txt">Table of n, a(n) for n = 1..259</a>

%H Hung-Lin Fu, Yuan-Hsun Lo and Kenneth W. Shum, <a href="http://dx.doi.org/10.1007/s10623-012-9764-5">Optimal conflict-avoiding codes of odd length and weight three</a>, Design Codes Cryptography, 72, (2014), 289-309.

%H V. I. Levenshtein, <a href="https://www.mathnet.ru/eng/ppi17">Conflict-avoiding codes and cyclic triple systems</a> [in Russian], Problemy Peredachi Informatsii, 43 (No. 3, 2007), 39-53.

%H V. I. Levenshtein, <a href="http://dx.doi.org/10.1134/S0032946007030039">Conflict-avoiding codes and cyclic triple systems</a>, Problems of Information Transmission, September 2007, Volume 43, Issue 3, pp 199-212.

%H K. W. Shum, <a href="http://dx.doi.org/10.1109/IWSDA.2011.6159407">On Conflict-Avoiding Codes of Weight Three and Odd Length</a>, Signal Design and its Applications in Communications (IWSDA), 2011 Fifth International Workshop.

%K nonn

%O 1,4

%A _N. J. A. Sloane_, Dec 05 2007

%E Terms corrected and more terms added, _Kenneth Shum_, Jul 08 2014