Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuying Chao

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

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

Computer networks · 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.

Computer networks
1 paper
Physical-layer communications · 70% Wireless networking · 30%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › spread spectrum › frequency hopping
frequency-hopping multiple access
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Wireless networking
network capacity
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Physical-layer communications
spread spectrum
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Coding theory › error-correcting codes › cyclic codes
BCH codes
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Coding theory
error-correcting codes
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Coding theory › error-correcting codes
reed-solomon codes
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992
Physical-layer communications › information theory
side information
0.011992
Frequency-Hopped Multiple Access Communications with Coding and Side Information · IEEE J. Sel. Areas Commun. 1992

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

error-erasure decoding · 0.0ratio-threshold test · 0.0ratio threshold test · 0.0
YearPublicationVenuePosition
1992 Frequency-Hopped Multiple Access Communications with Coding and Side Information
abstract
The authors consider frequency-hopped spread-spectrum multiple-access communications using M-ary modulation and error-correction coding. The major concerns are multiple-access interference and the network capacity in terms of the number of users that can transmit simultaneously for a given level of codeword error probability. Block coding is studied in detail. The authors first consider the use of Q-ary Reed-Solomon (RS) codes in combination with M-ary modulation with mismatched alphabets so that Q>M. It is shown that the network capacity is drastically reduced in comparison with the system with matched alphabets. As a remedy, the use of matched M-ary BCH codes is proposed as an alternative to mismatched RS codes. It is shown that when the number of users in the system is large, a BCH code outperforms an RS code with a comparable code rate and decoding complexity. The authors consider the use of a robust technique for generation of reliable side information based on a radio-threshold test. They analyze its performance in conjunction with MFSK and error-erasure correction decoding. It is shown that this nonideal ratio-threshold method can increase the network capacity in comparison with the system with perfect side information.>
Yuying Chao
IEEE J. Sel. Areas Commun.2