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.

Wei Su 0013

dblp:50/4091-13 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0002-2308-3334ORCID · verified

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

Theory of computation · 3 · 2 first-authorSecurity and privacy · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Coding theory · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design › polyphase sequences
quaternary sequence
0.312018
New quaternary sequences of even length with optimal auto-correlation · Sci. China Inf. Sci. 2018
Coding theory › sequences
sequence design
0.312018
New quaternary sequences of even length with optimal auto-correlation · Sci. China Inf. Sci. 2018
Cryptographic primitives and cryptanalysis › boolean functions
algebraic degree
0.212013
A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2013
Cryptographic primitives and cryptanalysis
boolean functions
0.212013
A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2013
Cryptographic primitives and cryptanalysis › boolean functions
symmetric boolean functions
0.212013
A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions · IEEE Trans. Inf. Theory 2013
Coding theory
boolean functions
0.212013
Characterization of Negabent Functions and Construction of Bent-Negabent Functions With Maximum Algebraic Degree · IEEE Trans. Inf. Theory 2013
Coding theory › sequences › pseudorandom sequences
autocorrelation
0.112018
New quaternary sequences of even length with optimal auto-correlation · Sci. China Inf. Sci. 2018
Coding theory › sequences › sequence design
correlation properties
0.112018
New quaternary sequences of even length with optimal auto-correlation · Sci. China Inf. Sci. 2018
Coding theory › boolean functions
bent functions
0.012013
Characterization of Negabent Functions and Construction of Bent-Negabent Functions With Maximum Algebraic Degree · IEEE Trans. Inf. Theory 2013

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

sequence construction · 0.3weight analysis · 0.2nega spectrum analysis · 0.2algebraic degree analysis · 0.2
YearPublicationVenuePosition
2018 New quaternary sequences of even length with optimal auto-correlation
Wei Su 0013, Yang Yang 0005, Zhengchun Zhou, Xiaohu Tang 0004
Sci. China Inf. Sci.1
2018 New optimal binary sequences with period 4p via interleaving Ding-Helleseth-Lam sequences
Wei Su 0013, Yang Yang 0005, Cuiling Fan
Des. Codes Cryptogr.1
2013 Characterization of Negabent Functions and Construction of Bent-Negabent Functions With Maximum Algebraic Degree
abstract
We present necessary and sufficient conditions for a Boolean function to be a negabent function for both an even and an odd number of variables, which demonstrates the relationship between negabent functions and bent functions. By using these necessary and sufficient conditions for Boolean functions to be negabent, we obtain that the nega spectrum of a negabent function has at most four values. We determine the nega spectrum distribution of negabent functions. Further, we provide a method to construct bent-negabent functions innvariables (neven) of algebraic degree ranging from 2 to [(n)/2], which implies that the maximum algebraic degree of ann-variable bent-negabent function is equal to [(n)/2]. Thus, we answer two open problems proposed by Parker and Pott and by Stănică et al.
Wei Su 0013, Alexander Pott, Xiaohu Tang 0004
IEEE Trans. Inf. Theory1
2013 A Note on a Conjecture for Balanced Elementary Symmetric Boolean Functions
abstract
In 2008, Cusick et al conjectured that certain elementary symmetric Boolean functions of the form σ(2t+1)l-1, (2t) are the only nonlinear balanced ones, wheret,lare any positive integers, and σn,d=⊕1≤( i1)d≤ n xi1xi2⋯xid) for positive integersn, 1 ≤d≤n. In this paper, by analyzing the weight of σn,(2t) and σn, d, we prove that wt σn,dn-1holds in most cases, and so does the conjecture. According to the remainder modulo 4, we also consider the weight of σn, dfrom two aspects: n ≠ 3(mod 4) and n not ≡ 3(mod 4). In particular, our results not only cover the most known results, but also contain some new cases. Thus, we can reduce the conjecture to few remaining cases. We do not fully solve the conjecture, but we also consider the weight of σn, (2t+2s) and also give some experimental results on it.
Wei Su 0013, Xiaohu Tang 0004, Alexander Pott
IEEE Trans. Inf. Theory1
2010 Clock-Controlled FCSR Sequence with Large Linear Complexity
Zhen Pan, Wei Su 0013, Xiaohu Tang 0004
SETA2