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

Kayo Yoshida

dblp:13/1691 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Security and privacy · 2Human-computer interaction and ubiquitous computing · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 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%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
binary sequences
0.112006
The peak sidelobe level of families of binary sequences · IEEE Trans. Inf. Theory 2006
Coding theory › sequences › binary sequences
merit factor
0.112006
The peak sidelobe level of families of binary sequences · IEEE Trans. Inf. Theory 2006
Coding theory › sequences › sequence design › correlation properties
peak sidelobe level
0.112006
The peak sidelobe level of families of binary sequences · IEEE Trans. Inf. Theory 2006
Coding theory › sequences
sequence design
0.112006
The peak sidelobe level of families of binary sequences · IEEE Trans. Inf. Theory 2006

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

numerical investigation · 0.1
YearPublicationVenuePosition
2009 Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
David Jao, Kayo Yoshida
Pairing2
2008 A user study of off-the-record messaging
abstract
Instant messaging is a prevalent form of communication across the Internet, yet most instant messaging services provide little security against eavesdroppers or impersonators. There are a variety of existing systems that aim to solve this problem, but the one that provides the highest level of privacy is Off-the-Record Messaging (OTR), which aims to give instant messaging conversations the level of privacy available in a face-to-face conversation. In the most recent redesign of OTR, as well as increasing the security of the protocol, one of the goals of the designers was to make OTR easier to use, without users needing to understand details of computer security such as keys or fingerprints.
Ryan Stedman, Kayo Yoshida, Ian Goldberg 0001
SOUPS2
2006 The Peak Sidelobe Level of Families of Binary Sequences
abstract
A numerical investigation is presented for the peak sidelobe level (PSL) of Legendre sequences and maximal length shift register sequences (m-sequences). The PSL gives an alternative to the merit factor for measuring the collective smallness of the aperiodic autocorrelations of a binary sequence. The growth of the PSL of these infinite families of binary sequences is tested against the desired growth rate o(radic(n ln n)) for sequence length n. The claim that the PSL of m-sequences grows like O(radicn), which appears frequently in the radar literature, is concluded to be unproven and not currently supported by data. Notable similarities are uncovered between the PSL and merit factor behaviour under cyclic rotations of the sequences
Jonathan Jedwab, Kayo Yoshida
ISIT2
2006 The peak sidelobe level of families of binary sequences
abstract
A numerical investigation is presented for the peak sidelobe level (PSL) of Legendre sequences, maximal length shift register sequences (m-sequences), and Rudin-Shapiro sequences. The PSL gives an alternative to the merit factor for measuring the collective smallness of the aperiodic autocorrelations of a binary sequence. The growth of the PSL of these infinite families of binary sequences is tested against the desired growth rate o(/spl radic/nlnn) for sequence length n. The claim that the PSL of m-sequences grows like O(/spl radic/n), which appears frequently in the radar literature, is concluded to be unproven and not currently supported by data. Notable similarities are uncovered between the PSL and merit factor behavior under cyclic rotations of the sequences.
Jonathan Jedwab, Kayo Yoshida
IEEE Trans. Inf. Theory2