Details of Research Outputs

TitleMultichannel Conflict-Avoiding Codes of Weights Three and Four
Author (Name in English or Pinyin)
Lo, Yuan-Hsun1; Shum, Kenneth W.2; Wong, Wing Shing3; Zhang, Yijin4
Date Issued2021-06-01
Source PublicationIEEE TRANSACTIONS ON INFORMATION THEORY
ISSN0018-9448
DOI10.1109/TIT.2020.3025773
Indexed BySCIE
Firstlevel Discipline计算机科学技术
Education discipline科技类
Published range国外学术期刊
Volume Issue Pages卷: 67 期: 6 页: 3557-3568
References
[1] B. S. Tsybakov and N. Likhanov, "Packet switching in a channel without feedback," Problemy Peredachi Inf., vol. 19, no. 2, pp. 69-84, 1983.
[2] J. Massey and P. Mathys, "The collision channel without feedback," IEEE Trans. Inf. Theory, vol. 31, no. 2, pp. 192-204, Mar. 1985.
[3] N. Abramson, "Packet switching with satellites," in Proc. AFIPS Conf. Nat. Computer, vol. 42, Jun. 1973, pp. 695-702.
[4] V. I. Levenshtein and V. D. Tonchev, "Optimal conflict-avoiding codes for three active users," in Proc. Int. Symp. Inf. Theory (ISIT), Sep. 2005, pp. 535-537.
[5] V. I. Levenshtein, "Conflict-avoiding codes and cyclic triple systems," Problemy Peredachi Inf., vol. 43, no. 3, pp. 39-53, 2007.
[6] M. Jimbo, M. Mishima, S. Janiszewski, A. Y. Teymorian, and V. D. Tonchev, "On conflict-avoiding codes of length n = 4m for three active users," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2732-2742, Aug. 2007.
[7] M. Mishima, H.-L. Fu, and S. Uruno, "Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3," Des., Codes Cryptogr., vol. 52, no. 3, pp. 275-291, 2009.
[8] H.-L. Fu, Y.-H. Lin, and M. Mishima, "Optimal conflict-avoiding codes of even length and weight 3," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5747-5756, Nov. 2010.
[9] K. Momihara, "Necessary and sufficient conditions for tight equidifference conflict-avoiding codes of weight three," Designs, Codes Cryptogr., vol. 45, no. 3, pp. 379-390, Oct. 2007.
[10] H.-L. Fu, Y.-H. Lo, and K. W. Shum, "Optimal conflict-avoiding codes of odd length and weight three," Des., Codes Cryptogr., vol. 72, no. 2, pp. 289-309, Aug. 2014.
[11] W. Ma, C.-E. Zhao, and D. Shen, "New optimal constructions of conflictavoiding codes of odd length and weight 3," Des., Codes Cryptogr., vol. 73, no. 3, pp. 791-804, Dec. 2014.
[12] S.-L. Wu and H.-L. Fu, "Optimal tight equi-difference conflict-avoiding codes of lengthn n = 2k ±1 and weight 3," J. Combinat. Des., vol. 21, no. 6, pp. 223-231, Jun. 2013.
[13] M. Mishima and K. Momihara, "A new series of optimal tight conflict-avoiding codes of weight 3," Discrete Math., vol. 340, no. 4, pp. 617-629, Apr. 2017.
[14] Y.-H. Lo, H.-L. Fu, and Y.-H. Lin, "Weighted maximum matchings and optimal equi-difference conflict-avoiding codes," Designs, Codes Cryptogr., vol. 76, no. 2, pp. 361-372, Aug. 2015.
[15] Y. Lin, M. Mishima, and M. Jimbo, "Optimal equi-difference conflictavoiding codes of weight four," Des., Codes Cryptogr., vol. 78, no. 3, pp. 747-776, Mar. 2016.
[16] T. Baicheva and S. Topalova, "Optimal conflict-avoiding codes for 3, 4 and 5 active users," Problemy Peredachi Inf., vol. 53, no. 1, pp. 47-55, 2017.
[17] T. Baicheva and S. Topalova, "Classification of optimal conflict-avoiding codes of weights 6 and 7," Electron. Notes Discrete Math., vol. 57, pp. 9-14, Mar. 2017.
[18] K. Momihara, M. Müller, J. Satoh, and M. Jimbo, "Constant weight conflict-avoiding codes," SIAM J. Discrete Math., vol. 21, no. 4, pp. 959-979, Jan. 2008.
[19] K. W. Shum and W. S. Wong, "A tight asymptotic bound on the size of constant-weight conflict-avoiding codes," Des., Codes Cryptogr., vol. 57, no. 1, pp. 1-14, Oct. 2010.
[20] K. W. Shum, W. S. Wong, and C. S. Chen, "A general upper bound on the size of constant-weight conflict-avoiding codes," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3265-3276, Jul. 2010.
[21] Y. Cassuto, M. Schwartz, V. Bohossian, and J. Bruck, "Codes for asymmetric limited-magnitude errors with application to multilevel flash memories," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1582-1595, Apr. 2010.
[22] T. Klove, B. Bose, and N. Elarief, "Systematic, single limited magnitude error correcting codes for flash memories," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4477-4487, Jul. 2011.
[23] C.-S. Chang, D.-S. Lee, and C. Wang, "Asynchronous grant-free uplink transmissions in multichannel wireless networks with heterogeneous QoS guarantees," IEEE/ACM Trans. Netw., vol. 27, no. 4, pp. 1584-1597, Aug. 2019.
[24] E. S. Shivaleela, A. Selvarajan, and T. Srinivas, "Two-dimensional optical orthogonal codes for fiber-optic CDMA networks," J. Lightw. Technol., vol. 23, no. 2, pp. 647-654, Feb. 2005.
[25] W. C. Kwong, G.-C. Yang, V. Baby, C.-S. Bres, and P. R. Prucnal, "Multiple-wavelength optical orthogonal codes under prime-sequence permutations for optical CDMA," IEEE Trans. Commun., vol. 53, no. 1, pp. 117-123, Jan. 2005.
[26] Y. Zhang, K. W. Shum, and W. S. Wong, "Strongly conflict-avoiding codes," SIAM J. Discrete Math., vol. 25, no. 3, pp. 1035-1053, Jan. 2011.
[27] R. C. Bose and K. A. Bush, "Orthogonal arrays of strength two and three," Ann. Math. Statist., vol. 23, no. 4, pp. 508-524, Dec. 1952.
[28] A. B. Evans, "On orthogonal orthomorphisms of cyclic and non-Abelian groups," Discrete Math., vol. 243, nos. 1-3, pp. 229-233, Jan. 2002.
[29] G. Ge, "On (g, 4; 1)-difference matrices," Discrete Math., vol. 301, pp. 164-174, 2005.
[30] G. Ge, M. Greig, J. Seberry, and R. Seberry, "Generalized Bhaskar Rao designs with block size 3 over finite Abelian groups," Graphs Combinatorics, vol. 23, no. 3, pp. 271-290, Jun. 2007.
[31] OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences. Accessed: 2019. [Online]. Available: http://oeis.org/A002326
[32] OEIS Foundation Inc. The On-Line Encyclopedia of Integer Sequences. Accessed: 2019. [Online]. Available: http://oeis.org/A000041
[33] F. Liu, K. W. Shum, and W. S. Wong, "Sequence-based unicast in wireless sensor networks," IEEE Trans. Commun., vol. 68, no. 1, pp. 429-444, Jan. 2020.
Citation statistics
Cited Times [WOS]:0   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
Identifierhttps://irepository.cuhk.edu.cn/handle/3EPUXD0A/2189
CollectionSchool of Science and Engineering
Corresponding AuthorShum, Kenneth W.
Affiliation
1.Natl Pingtung Univ, Dept Appl Math, Pingtung 90003, Taiwan
2.Chinese Univ Hong Kong Shenzhen , Sch Sci & Engn, Shenzhen 518100, Peoples R China
3.Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Peoples R China
4.Nanjing Univ Sci & Technol, Sch Elect & Opt Engn, Nanjing 210094, Peoples R China
Corresponding Author AffilicationThe Chinese University of HongKong,Shenzhen
Recommended Citation
GB/T 7714
Lo, Yuan-Hsun,Shum, Kenneth W.,Wong, Wing Shinget al. Multichannel Conflict-Avoiding Codes of Weights Three and Four[J]. IEEE TRANSACTIONS ON INFORMATION THEORY,2021.
APA Lo, Yuan-Hsun, Shum, Kenneth W., Wong, Wing Shing, & Zhang, Yijin. (2021). Multichannel Conflict-Avoiding Codes of Weights Three and Four. IEEE TRANSACTIONS ON INFORMATION THEORY.
MLA Lo, Yuan-Hsun,et al."Multichannel Conflict-Avoiding Codes of Weights Three and Four".IEEE TRANSACTIONS ON INFORMATION THEORY (2021).
Files in This Item:
There are no files associated with this item.
Related Services
Usage statistics
Google Scholar
Similar articles in Google Scholar
[Lo, Yuan-Hsun]'s Articles
[Shum, Kenneth W.]'s Articles
[Wong, Wing Shing]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lo, Yuan-Hsun]'s Articles
[Shum, Kenneth W.]'s Articles
[Wong, Wing Shing]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lo, Yuan-Hsun]'s Articles
[Shum, Kenneth W.]'s Articles
[Wong, Wing Shing]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.