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

Young-Ky Kim

dblp:26/5784 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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 · 62% Information theory · 38%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory › multiuser communication
code-division multiple access
0.012000
Quasi-orthogonal sequences for code-division multiple-access systems · IEEE Trans. Inf. Theory 2000
Coding theory › sequences › sequence design
spreading sequences
0.012000
Quasi-orthogonal sequences for code-division multiple-access systems · IEEE Trans. Inf. Theory 2000
Coding theory › boolean functions
bent functions
0.012000
Quasi-orthogonal sequences for code-division multiple-access systems · IEEE Trans. Inf. Theory 2000
Coding theory › sequences › sequence design
correlation properties
0.012000
Quasi-orthogonal sequences for code-division multiple-access systems · IEEE Trans. Inf. Theory 2000

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

sequence construction · 0.0correlation analysis · 0.0
YearPublicationVenuePosition
2000 Quasi-orthogonal sequences for code-division multiple-access systems
abstract
The notion of quasi-orthogonal sequence (QOS) as a means of increasing the number of channels in synchronous code-division multiple-access (CDMA) systems that employ Walsh sequences for spreading information signals and separating channels is introduced. It is shown that a QOS sequence may be regarded as a class of Bent (almost Bent) functions possessing, in addition, a certain window property. Such sequences while increasing the system capacity, minimize interference to the existing set of Walsh sequences. The window property gives the system the ability to handle variable data rates. A general procedure of constructing QOSs from well-known families of binary sequences with good correlation, including the Kasami and Gold (1967) sequence families, as well as from the binary Kerdock code is provided. Examples of QOSs are presented for small lengths. Some examples of quaternary QOSs drawn from Family A are also included.
Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar
IEEE Trans. Inf. Theory2