最优冲突回避码新的构造方法
New Constructions of Optimal Conflict-Avoiding Codes
DOI: 10.12677/AAM.2022.113122, PDF,    科研立项经费支持
作者: 黄必昌：百色学院，数学与统计学院，广西 百色
关键词: 冲突回避码；二次剩余；欧拉函数；Conflict-Avoiding Code； Quadratic Residue； Euler Function
摘要: 目前，对最优冲突回避码的具体构造取得的结果不多，利用欧拉函数和同余数在整数环的特性给出一种构造的新方法，进一步具体构造码重k = 3，4，5，6时最优冲突回避码的一系列新结果。
Abstract: Previously, there are very few results of explicit constructions of optimal conflict-avoiding code. In this paper, combing new constructions with Euler function and congruent numbers’ properties in integer rings, a new infinite series of optimal conflict-avoiding codes with weight k = 3, 4, 5, 6 are obtained.
文章引用：黄必昌. 最优冲突回避码新的构造方法[J]. 应用数学进展, 2022, 11(3): 1134-1139. https://doi.org/10.12677/AAM.2022.113122

参考文献

[1] Massey, J.L. and Mathys, P. (1985) The Collision Channel without Feedback. IEEE Transactions on Information The-ory, 31, 192-204. [Google Scholar] [CrossRef] 
[2] Gryorfi, N.Q.A.L. and Massey, J.L. (1992) Constructions of Binary Constant Weight Cyclic Codes and Cyclically Permutable Codes. IEEE Transactions on In-formation Theory, 38, 940-949. [Google Scholar] [CrossRef] 
[3] 黄必昌, 朱文兴. 最优冲突回避码的具体构造[J]. 福州大学学报(自然科学版), 2016, 44(3): 390-393.
[4] Momihara, K., Muller, M., Satoh, J., et al. (2008) Constant Weight Conflict-Avoiding Codes. Siam Journal on Discrete Mathematics, 21, 959-979. [Google Scholar] [CrossRef] 
[5] Fu, H.L., Li, Y.H. and Mishima, M. (2011) Errata to “Optimal Con-flict-Avoiding Codes of Even Length and Weight 3”. IEEE Transactions on Information Theory, 57, 5572-5572. [Google Scholar] [CrossRef] 
[6] Jimbo, M., Mishima, M., Janiszewski, S., et al. (2007) On Con-flict-Avoiding Codes of Length n = 4 m for Three Active Users. IEEE Transactions on Information Theory, 53, 2732-2742. [Google Scholar] [CrossRef] 
[7] Levenshtein, V.I. (2007) Conflict-Avoiding Codes and Cyclic Triple Systems. Problems of Information Transmission, 43, 199-212. [Google Scholar] [CrossRef] 
[8] Mishima, M., Fu, H.L. and Uruno, S. (2009) Optimal Conflict Avoiding Codes of Length n = (0 mod16) and Weight 3. Designs, Codes and Cryptography, 52, 275-291. [Google Scholar] [CrossRef] 
[9] Momihara, K. (2007) Necessary and Sufficient Conditions for Tight Equi-Difference Conflict-Avoiding Codes of Weight Three. Designs, Codes and Cryptography, 45, 379-390. [Google Scholar] [CrossRef] 
[10] Ma, W.P., Zhao, C.E. and Shen, D.S. (2014) New Optimal Constructions of Conflict-Avoiding Codes of Odd Length and Weight 3. Designs, Codes and Cryptography, 73, 791-804. [Google Scholar] [CrossRef] 
[11] Shum, K.W., Wong, W.S. and Chen, C.S. (2010) A General Upper Bound on the Size of Constant Weight Conflict Avoiding Codes. IEEE Transactions on Information Theory, 56, 3265-3276. [Google Scholar] [CrossRef] 
[12] Nathanson, M.B. (2000) Elementary Methods in Number Theory. Springer-Verlag, New York.
[13] 蔡天新. 数论: 从同余的观点出发[M]. 北京: 高等数学出版社, 2012.

为你推荐