On Conflict-Avoiding Codes of Length n=4m for Three Active Users

Authors:
M. Jimbo;M. Mishima;S. Janiszewski;A. Y. Teymorian;V. D. Tonchev
Affiliations:
Nagoya Univ., Nagoya;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2007

Citing 0
Cited 8

Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three

Designs, Codes and Cryptography
Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3

Designs, Codes and Cryptography
Design and construction of protocol sequences: shift invariance and user irrepressibility

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes

Designs, Codes and Cryptography
A general upper bound on the size of constant-weight conflict-avoiding codes

IEEE Transactions on Information Theory
User-irrepressible sequences

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Optimal conflict-avoiding codes of even length and weight 3

IEEE Transactions on Information Theory
On cyclic 2(k -1)-support (n,k)k-1 difference families

Finite Fields and Their Applications

Quantified Score

Hi-index	754.96

Visualization

Abstract

New improved upper and lower bounds on the maximum size of a symmetric or arbitrary conflict-avoiding code of length n = 4 m for three active users are proved. Furthermore, direct constructions for optimal conflict-avoiding codes of length n = 4 m and m equiv 2 (mod 4) for three active users are provided.