Shujuan Dang

dblp:194/6762 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Optical networks · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
code construction
0.312018
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs · IEEE Trans. Inf. Theory 2018
Coding theory › sequences › sequence design
optical orthogonal codes
0.312018
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs · IEEE Trans. Inf. Theory 2018
Coding theory › sequences › sequence design › optical orthogonal codes
variable-weight optical orthogonal code
0.312018
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs · IEEE Trans. Inf. Theory 2018
Optical networks
optical code-division multiple access
0.112018
Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs · IEEE Trans. Inf. Theory 2018

Methods — techniques the papers use, named apart from their topics

combinatorial construction · 0.7
YearPublicationVenuePosition
2018 Bounds and Constructions for Optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs
abstract
Let W = {w1, . . . , wr} be a set of positive integers, λca positive integer, Λa= (λa(1), . . . λa(r)) an r-tuple of positive integers, and Q = (q1, . . . qr) an r-tuple of positive rational numbers whose sum is 1. In 1996, Yang introduced variable-weight optical orthogonal code, (n, W, Λa, λc, Q)-OOC, for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. Some work had been done on the constructions of optimal (n, W, Λa, 1, Q)-OOCs with unequal auto-correlation constraints for W = {3, 4} and {3, 5}, while little is known on optimal (n, W, Λa, 1, Q)-OOCs for |W| ≥ 3. In this paper, we focus our main attentions on (n, {3, 4, 5}, Λa, 1, Q)-OOCs with Λa∈ {(2, 1, 1), (2, 1, 2), (2, 2, 1), (2, 2, 2)}. Tight upper bounds on the maximum code size of (n, {3, 4, 5}, Λa, 1, Q)-OOCs are obtained, and infinite classes of optimal (n, {3, 4, 5}, Λa, 1, Q)-OOCs are constructed.
Huangsheng Yu, Shujuan Dang, Dianhua Wu
IEEE Trans. Inf. Theory2