User-detectable sequences for the collision channel without feedback
暂无分享,去创建一个
[1] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[2] James L. Massey,et al. The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.
[3] Solomon W. Golomb,et al. A new recursive construction for optical orthogonal codes , 2003, IEEE Trans. Inf. Theory.
[4] Fan Chung Graham,et al. Optical orthogonal codes: Design, analysis, and applications , 1989, IEEE Trans. Inf. Theory.
[5] Kenneth W. Shum,et al. User-Irrepressible Sequences , 2010, SETA.
[6] W. S. Wong. New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.
[7] Michael Rosen,et al. A classical introduction to modern number theory , 1982, Graduate texts in mathematics.
[8] Kenneth W. Shum,et al. Design and construction of protocol sequences: Shift invariance and user irrepressibility , 2009, 2009 IEEE International Symposium on Information Theory.
[9] Sándor Györi,et al. Coding for a multiple access OR channel: A survey , 2005, Discret. Appl. Math..
[10] Sándor Gyri,et al. Coding for a multiple access OR channel: A survey , 2008 .
[11] László Györfi,et al. Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.
[12] László Györfi,et al. Constructions of protocol sequences for multiple access collision channel without feedback , 1993, IEEE Trans. Inf. Theory.