期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

重量为4的强避免冲突等差码的容量上限

Strongly Conflict-Avoiding Equi-difference Codes with Weight Four
下载PDF
导出
摘要 强避免冲突码适用于无反馈异步多址冲突信道,码中所包含的码字的个数称为码的容量,它是系统中所支持的潜在用户的个数.通过对码字的分类给出了重量为4的强避免冲突等差码的容量上限.进一步通过直接构造,证明了某些码类的容量能达到上限. Strongly conflict-avoiding codes were used in the asynchronous multiple-access collision channel without feedback. The number of codewords in a strongly conflict-avoiding code was the number of potential users that could be supported in the system. In this paper, an upper bound on the size of strongly conflict-avoiding equi-difference codes was proved by classifying codewords. This bound was further demonstrated to be tight for some cases by direct constructions.
作者 于志华 张胜杰
机构地区 南通大学理学院
出处 《南通大学学报（自然科学版）》 CAS 2015年第4期88-94,共7页 Journal of Nantong University(Natural Science Edition)　
基金 南通大学自然科学基金项目(13Z024)
关键词 避免冲突码 强避免冲突码 等差码 无反馈冲突信道 conflict-avoiding codes strongly conflict-avoiding codes equi-difference codes col-lision channel with-out feedback
分类号 O157.2 [理学—基础数学]
  • 相关文献

参考文献8

  • 1ZHANG Y J, SHUM K W, WONG W S. Strongly conflict- avoiding codes[J]. SIAM J Discrete Math, 2011, 25(3) : 1035-1053.
  • 2TSYBAKOV B S, LIKHANOV N B. Packet switching in a channel without feed back[J]. Probl Peredachi Inform, 1983, 19(2) :69-84.
  • 3MASSEY J L, MATHYS P. The collision channel without feedback [J]. IEEE Trans Inf Theory, 1985, 31(2) : 192- 204.
  • 4MATHYS P. A class of codes for a T active users out of Nmultiple-access communication system[J]. IEEE Trans Inf Theory, 1990, 36(6) : 1206-1219.
  • 5FUJI-HARA R, MIAO Y. Optical orthogonal codes:their bounds and new optimal constructions [J]. IEEE Trans Inf Theory, 2000, 46(7) :2396-2406.
  • 6于志华,王金华.重量为3的强避免冲突中心码容量上限[J].南通大学学报（自然科学版）,2012,11(2):62-67. 被引量：2
  • 7YU Z H, WANG J H. Strongly conflict-avoiding codes withweight three [J ]. Wireless Per Commun, 2015, 84(1 ) : 153- 165.
  • 8MOMIHARA K, BURATrI M. Bounds and constructions of optimal(n, 4, 2, 1) optical orthogonal codes[J]. IEEE Trans Inf Theory, 2009, 55(2):514-523.

二级参考文献14

  • 1Tsybakov B S, Likhanov N B. Packet communication on a channel without feedback [J ]. Problemy Peredachi Informat- sii, 1983, 19(2):69-84.
  • 2Massey J L, Mathys P. The collision channel without feed- back[J]. IEEE Trans Inf Theory, 1985, 31(2) : 192-204.
  • 3Mathys P. A class of codes for a T active users out of N mulitiple-access communication system[J]. IEEE Trans Inf Theory, 1990, 36(6) :1206-1219.
  • 4Levenshtei V I, Tonchev V D. Optimal conflict-avoiding codes for three active users[C]//Proc IEEE Int Symp Inform Theory, Adelaide, Australia, Sept, 2005:535-537.
  • 5Levenshtein V I. Conflict-avoiding codes for three active users and cyclic triple systems [ J ]. Probl Inf Trans, 2007, 43(3) : 199-212.
  • 6Momihara K. Necessary and sufficient conditions for tight e- qui-difference conflict-avoiding codes of weight three [J] Des Codes Cryptogr, 2007, 45(3):379-390.
  • 7Momihara K, Muller M, Satoh J, et al. Constant weight conflict-avoiding codes[J]. SIAM J Discrete Math, 2007, 21:959-979.
  • 8Jimbo M, Mishima M, Janiszewski S, et al. On conflictavoiding codes of length n = 4m for three active users [J]. IEEE Trans Inf Theory, 2007, 53 (8) : 2732-2742.
  • 9Mishima M, Fu H L, Uruno S. Optimal conflict-avoiding codes of length n = 0 (mod 16) and weight 3[J]. Des Codes Cryptogr, 2009, 52(3):275-291.
  • 10Shum K W, Wong W S, Chen C S. A general upper bound on the size of constant-weight conflict-avoiding codes [J]. IEEE Trans Inf Theory, 2010, 56(7):3256-3276.

共引文献1

南通大学学报（自然科学版）
2015年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部