Strongly Conflict-Avoiding Codes

Strongly conflict-avoiding codes (SCACs) are used in the slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed period of time. The number of codewords in an SCAC is the number of potential users that can be supported. In this paper, a general upper bound on the size of SCAC is derived. We further improve the upper bound if the code has some special structure, called equi-difference, and we show this bound is asymptotically tight.

[1]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[2]  M. Kneser,et al.  Abschätzung der asymptotischen Dichte von Summenmengen , 1953 .

[3]  W. S. Wong.  New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.

[4]  Kenneth W. Shum,et al.  Design and construction of protocol sequences: Shift invariance and user irrepressibility , 2009, 2009 IEEE International Symposium on Information Theory.

[5]  Meinard Müller,et al.  Constant Weight Conflict-Avoiding Codes , 2007, SIAM J. Discret. Math..

[6]  Koji Momihara,et al.  Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three , 2007, Des. Codes Cryptogr..

[7]  Hung-Lin Fu,et al.  Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3 , 2009, Des. Codes Cryptogr..

[8]  Melvyn B. Nathanson,et al.  Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[9]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[10]  Vladimir I. Levenshtein,et al.  Conflict-avoiding codes and cyclic triple systems , 2007, Probl. Inf. Transm..

[11]  Henry B. Mann,et al.  Addition Theorems: The Addition Theorems of Group Theory and Number Theory , 1976 .

[12]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[13]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[14]  Vladimir D. Tonchev,et al.  On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users , 2007, IEEE Transactions on Information Theory.

[15]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[16]  Kenneth W. Shum,et al.  A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes , 2010, IEEE Transactions on Information Theory.

[17]  Kenneth W. Shum,et al.  A tight asymptotic bound on the size of constant-weight conflict-avoiding codes , 2010, Des. Codes Cryptogr..

[18]  Vladimir D. Tonchev,et al.  Optimal conflict-avoiding codes for three active users , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[19]  Ryoh Fuji-Hara,et al.  Optical orthogonal codes: Their bounds and new optimal constructions , 2000, IEEE Trans. Inf. Theory.

[20]  Boris Tsybakov,et al.  Some Constructions of Conflict-Avoiding Codes , 2002, Probl. Inf. Transm..