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.

Anchung Chang

dblp:49/3984 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Theory of computation · 2 · 2 first-authorSecurity and privacy · 1 · 1 first-author

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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
cyclic codes
0.012000
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › error detection and correction › multiple error correction
triple-error-correcting codes
0.012000
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code · IEEE Trans. Inf. Theory 2000
Coding theory › sequences › sequence design › low-correlation sequence
perfect sequences
0.012000
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code · IEEE Trans. Inf. Theory 2000
Coding theory
sequences
0.012000
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code · IEEE Trans. Inf. Theory 2000

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

trace description · 0.0BCH codes · 0.0
YearPublicationVenuePosition
2000 On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code
abstract
In a previous paper, No, Golomb, Gong, Lee and Gaal (see ibid., vol.44, p.814-17, 1998) conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present paper it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error correcting code having the same weight distribution as the triple-error correcting Bose-Chaudhuri-Hocquenghem (BCH) code. This cyclic code also contains a cyclic subcode that yields a new family of sequences having the same size and correlation parameters as does the family of Gold sequences.
Anchung Chang, Peter Gaal, Solomon W. Golomb, Guang Gong, Tor Helleseth, P. Vijay Kumar
IEEE Trans. Inf. Theory1
1998 On Ideal Autocorrelation Sequences Arising from Hyperovals
Anchung Chang, Solomon W. Golomb, Guang Gong, P. Vijay Kumar
SETA1