Title

On conflict-avoiding codes of length n=4m for the active users

Authors

Masakazu Jimbo, Nagoya University
Miwako Mishima, Gifu University
Susan Janiszewski
Amin Teymorian, The George Washington University
Vladimir Tonchev, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

8-2007

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.

Publisher's Statement

© 2007 IEEE. Publisher’s version of record: https://dx.doi.org/10.1109/TIT.2007.901233

Publication Title

IEEE Transactions on Information Theory

Recommended Citation

Jimbo, M., Mishima, M., Janiszewski, S., Teymorian, A., & Tonchev, V. (2007). On conflict-avoiding codes of length n=4m for the active users. IEEE Transactions on Information Theory, 53(8), 2732-2742. http://doi.org/10.1109/TIT.2007.901233
Retrieved from: https://digitalcommons.mtu.edu/math-fp/113