Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Wensong Chu"'
Autor:
Wensong Chu1 Wensong.Chu@asu.edu, Colbourn, Charles J.1 Charles.Colbourn@asu.edu, Golomb, Solomon W.2
Publikováno v:
SIAM Journal on Discrete Mathematics. 2005, Vol. 18 Issue 4, p741. 8p.
Autor:
John Liu, Wensong Chu
Publikováno v:
IEEE Transactions on Aerospace and Electronic Systems. 47:26-36
Constructing long multiple level sequences using much shorter component codes is proposed. Correlation properties and constructions of multiple level sequences are studied. Upper bounds and lower bounds are derived for autocorrelation functions and c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42db0a4f244605c6cb731b0e6daf58b8
https://doi.org/10.1109/taes.2011.5705657
https://doi.org/10.1109/taes.2011.5705657
Publikováno v:
Wireless Networks. 12:681-690
Topology-transparent scheduling is an attractive medium access control technique for mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The transmission schedule for each node is fixed and guarantees a bounded delay independent of w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::503c9cfc6d40e44754d83aa40d184b42
https://doi.org/10.1007/s11276-006-6528-z
https://doi.org/10.1007/s11276-006-6528-z
Publikováno v:
Discrete Applied Mathematics. 154:912-929
A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96e9d38fdf908ab3c6401c9e648ccd03
https://doi.org/10.1016/j.dam.2005.09.009
https://doi.org/10.1016/j.dam.2005.09.009
Publikováno v:
Computer Communications. 29:421-428
We propose a slot synchronized topology-transparent medium access control (MAC) protocol for sensor networks. Most of the earlier scheduled approaches require a stronger form of synchronization where nodes are synchronized on frame boundaries. Synchr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69079e00cb96f78def7b1db2877e4ddd
https://doi.org/10.1016/j.comcom.2004.12.026
https://doi.org/10.1016/j.comcom.2004.12.026
Publikováno v:
SIAM Journal on Discrete Mathematics. 18:741-748
A difference triangle set (D$\Delta$S) is a collection of sets of integers having the property that every integer can be written in at most one way as the difference of two elements within a set of the collection. The standard objective is to minimiz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d89997f73aedbd4bdcee6cc99249d1a
https://doi.org/10.1137/s0895480103436761
https://doi.org/10.1137/s0895480103436761
Autor:
Charles J. Colbourn, Wensong Chu
Publikováno v:
IEEE Transactions on Information Theory. 50:2402-2407
We formulate a combinatorial model of impulse radio sequences (IRSs) to study sequence or signal design for ultra-wideband (UWB) radio with unmodulated time hopping. Using this combinatorial model for IRSs, we develop necessary and sufficient conditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a62404ea11a4b6b9a4e4f59d8bc615b0
https://doi.org/10.1109/tit.2004.834794
https://doi.org/10.1109/tit.2004.834794
Publikováno v:
Designs, Codes and Cryptography. 32:51-64
A permutation array (or code) of length n and distance d is a set Γ of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x, y ∈ Γ is at least d. One motivation for coding with permutations is power
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9ce98ad134d80758e16c02a9bbaa9c6
https://doi.org/10.1023/b:desi.0000029212.52214.71
https://doi.org/10.1023/b:desi.0000029212.52214.71
Autor:
Charles J. Colbourn, Wensong Chu
Publikováno v:
Discrete Mathematics. 279:163-172
In this paper, we introduce an algorithmic scheme to find optimal ( v ,4,2)-OOCs of small orders. We determine the sizes of optimal ( v ,4,2)-OOCs up to v =44, with three possible exceptions. We also develop an algebraic method to generate all differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22a0e86cb5d2ad673a9be400a40ee85c
https://doi.org/10.1016/s0012-365x(03)00266-8
https://doi.org/10.1016/s0012-365x(03)00266-8
Autor:
Wensong Chu, Charles J. Colbourn
Publikováno v:
Journal of Combinatorial Designs. 12:333-345
In [3], a general recursive construction for optical orthogonal codes is presented, that guarantees to approach the optimum asymptotically if the original families are asymptotically optimal. A challenging problem on OOCs is to obtain optimal OOCs, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75a2967c6bef8133933e4a17327bb709
https://doi.org/10.1002/jcd.20003
https://doi.org/10.1002/jcd.20003