Design and construction of protocol sequences: Shift invariance and user irrepressibility
暂无分享,去创建一个
[1] László Györfi,et al. Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.
[2] Henry B. Mann,et al. Addition Theorems: The Addition Theorems of Group Theory and Number Theory , 1976 .
[3] Meinard Müller,et al. Constant Weight Conflict-Avoiding Codes , 2007, SIAM J. Discret. Math..
[4] V. C. da Rocha. Protocol sequences for collision channel without feedback , 2000 .
[5] W. S. Wong. New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.
[6] Vladimir D. Tonchev,et al. On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users , 2007, IEEE Transactions on Information Theory.
[7] Cormac J. Sreenan,et al. f-MAC: A Deterministic Media Access Control Protocol Without Time Synchronization , 2006, EWSN.
[8] Chung Shue Chen,et al. Constructions of Robust Protocol Sequences for Wireless Sensor and Ad hoc Networks , 2008, IEEE Transactions on Vehicular Technology.
[9] M. Kneser,et al. Abschätzung der asymptotischen Dichte von Summenmengen , 1953 .
[10] Kenneth W. Shum,et al. Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback , 2009, IEEE Transactions on Information Theory.
[11] Yijin Zhang. Protocol sequences for the collision channel without feedback , 2010 .
[12] A. A. Shaar,et al. Prime sequences: quasi-optimal sequences for OR channel code division multiplexing , 1983 .
[13] Michael Rosen,et al. A classical introduction to modern number theory , 1982, Graduate texts in mathematics.
[14] Fan Chung Graham,et al. Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.
[15] James L. Massey,et al. The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.