DocumentCode :
1061864
Title :
On Conflict-Avoiding Codes of Length n=4m for Three Active Users
Author :
Jimbo, Masakazu ; Mishima, Miwako ; Janiszewski, Susan ; Teymorian, Amin Y. ; Tonchev, Vladimir D.
Author_Institution :
Nagoya Univ., Nagoya
Volume :
53
Issue :
8
fYear :
2007
Firstpage :
2732
Lastpage :
2742
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.
Keywords :
cyclic codes; arbitrary conflict-avoiding code; cyclic design; optimal conflict-avoiding code; three active user; Australia; Binary sequences; Combinatorial mathematics; Computer science; Graph theory; Information science; Optical design; Optical feedback; Optical receivers; Protocols; Centered codes; conflict-avoiding codes; cyclic designs; double-free sets; optical orthogonal codes; optimal codes; symmetric codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2007.901233
Filename :
4276923
Link To Document :
بازگشت