default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPinhui Ke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Feifei Yan, Pinhui Ke, Zuling Chang:
Trace Representation of Balanced Quaternary Generalized Cyclotomic Sequences of Period pn. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(10): 1637-1640 (2024)- [j29]Feifei Yan, Pinhui Ke, Zuling Chang:
The autocorrelation of a class of quaternary sequences of length pq with high complexity. Inf. Process. Lett. 186: 106494 (2024) - [i7]Feifei Yan, Pinhui Ke, Lingmei Xiao:
The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity. CoRR abs/2401.03204 (2024) - 2023
- [j28]Zhiyao Yang
, Pinhui Ke, Zhixiong Chen, Chenhuang Wu:
Results on the Gowers U2 Norm of Generalized Boolean Functions. Int. J. Found. Comput. Sci. 34(4): 373-393 (2023) - [j27]Jian Ding, Pinhui Ke, Changlu Lin, Huaxiong Wang:
Ramp Scheme Based on CRT for Polynomial Ring over Finite Field. J. Syst. Sci. Complex. 36(1): 129-150 (2023) - 2022
- [j26]Pinhui Ke, Panpan Qiao, Yang Yang:
On the equivalence of several classes of quaternary sequences with optimal autocorrelation and length 2p. Adv. Math. Commun. 16(2): 285-302 (2022) - [j25]Zhiyao Yang, Pinhui Ke, Zhixiong Chen:
Characterization and Construction of Generalized Bent Functions with Flexible Coefficients. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(5): 887-891 (2022) - [j24]Linyan Yu, Pinhui Ke, Zuling Chang:
New Family of Polyphase Sequences with Low Correlation from Galois Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(10): 1425-1428 (2022) - [j23]Jian Ding, Pinhui Ke, Changlu Lin, Huaxiong Wang:
Bivariate polynomial-based secret sharing schemes with secure secret reconstruction. Inf. Sci. 593: 398-414 (2022) - [c6]Pinhui Ke, Zhixiong Chen:
Boolean Functions with Few Walsh Transform Values. IWSDA 2022: 1-5 - 2020
- [j22]Pinhui Ke, Yan Zhong, Shengyuan Zhang:
Linear Complexity of a New Class of Quaternary Generalized Cyclotomic Sequence with Period 2pm. Complex. 2020: 6538970:1-6538970:7 (2020)
2010 – 2019
- 2019
- [j21]Zhifan Ye, Pinhui Ke, Chenhuang Wu:
A further study of the linear complexity of new binary cyclotomic sequence of length pr. Appl. Algebra Eng. Commun. Comput. 30(3): 217-231 (2019) - [j20]Chenhuang Wu, Chunxiang Xu, Zhixiong Chen, Pinhui Ke:
On error linear complexity of new generalized cyclotomic binary sequences of period p2. Inf. Process. Lett. 144: 9-15 (2019) - [i6]Zuling Chang, Martianus Frederic Ezerman, Pinhui Ke, Qiang Wang:
General Criteria for Successor Rules to Efficiently Generate Binary de Bruijn Sequences. CoRR abs/1911.06670 (2019) - 2018
- [j19]Pinhui Ke, Yueqin Jiang, Zhixiong Chen:
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation. Adv. Math. Commun. 12(3): 525-539 (2018) - [j18]Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. Adv. Math. Commun. 12(4): 805-816 (2018) - [j17]Zhibao Lin, Zhengqian Li, Pinhui Ke:
New Constructions of Zero-Difference Balanced Functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(10): 1719-1723 (2018) - [j16]Qi Ye, Pinhui Ke, Jian Shen:
Linear complexity of a class of pseudorandom sequences over a general finite field. Soft Comput. 22(13): 4335-4346 (2018) - [i5]Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. CoRR abs/1803.03339 (2018) - 2017
- [j15]Zuling Chang, Pinhui Ke, Yongcheng Zhao:
Some Enumeration Results on Binary 2n-Periodic Sequences. Int. J. Found. Comput. Sci. 28(2): 171-184 (2017) - [j14]Pinhui Ke, Zhifan Ye, Zhengchun Zhou, Jian Shen:
Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence. Int. J. Found. Comput. Sci. 28(4): 391-410 (2017) - [c5]Zhengqian Li, Pinhui Ke, Zhifan Ye:
New Construction of Low-Hit-Zone Frequency Hopping Sequence Sets with Optimal Partial Hamming Correlation. ICCCS (2) 2017: 40-49 - [i4]Chenhuang Wu, Chunxiang Xu, Zhixiong Chen, Pinhui Ke:
On error linear complexity of new generalized cyclotomic binary sequences of period p2. CoRR abs/1711.06063 (2017) - [i3]Zhifan Ye, Pinhui Ke, Chenhuang Wu:
A note on a conjecture of new binary cyclotomic sequences of length pn. CoRR abs/1712.08886 (2017) - 2015
- [j13]Zhifan Ye, Pinhui Ke, Shengyuan Zhang, Zuling Chang:
Some Notes on Pseudorandom Binary Sequences Derived from Fermat-Euler Quotients. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2199-2202 (2015) - [j12]Zhifan Ye, Pinhui Ke, Shengyuan Zhang, Zuling Chang:
Zero-Difference Balanced Function Derived from Fermat Quotients and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(11): 2336-2340 (2015) - [j11]Pinhui Ke, Zhengchun Zhou:
A Generic Construction of Z-Periodic Complementary Sequence Sets with Flexible Flock Size and Zero Correlation Zone Length. IEEE Signal Process. Lett. 22(9): 1462-1466 (2015) - [c4]Zhifan Ye, Pinhui Ke, Zhixiong Chen:
Further results on pseudorandom binary sequences derived from Fermat-Euler Quotients. ICICS 2015: 1-4 - 2014
- [j10]Changlu Lin, Fei Tang, Pinhui Ke, Lein Harn, Shengyuan Zhang:
Secure universal designated verifier identity-based signcryption. Secur. Commun. Networks 7(2): 434-444 (2014) - 2013
- [j9]Pinhui Ke, Jie Zhang, Shengyuan Zhang:
On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p m. Des. Codes Cryptogr. 67(3): 325-339 (2013) - [j8]Pinhui Ke, Wanghong Yu, Zuling Chang:
A note on binary sequence pairs with two-level correlation. Inf. Process. Lett. 113(19-21): 811-814 (2013) - 2012
- [j7]Pinhui Ke, Shengyuan Zhang:
New classes of quaternary cyclotomic sequence of length 2pm with high linear complexity. Inf. Process. Lett. 112(16): 646-650 (2012) - [j6]Pinhui Ke, Shengyuan Zhang, Fuchun Lin:
Constructions of binary array set with zero-correlation zone. Inf. Sci. 197: 197-206 (2012) - [c3]Fei Tang, Changlu Lin, Pinhui Ke:
Universal Designated Verifier Signcryption. NSS 2012: 126-134 - 2011
- [j5]Zheng Yang, Pinhui Ke:
Construction of quaternary sequences of length pq with low autocorrelation. Cryptogr. Commun. 3(2): 55-64 (2011) - [j4]Zheng Yang, Pinhui Ke:
On Generalized Cyclotomic Sequence of Order d and Period pq. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(1): 443-447 (2011) - [j3]Pinhui Ke, Zhihua Wang, Zheng Yang:
New Constructions of Frequency-Hopping Sequences from Power-Residue Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(3): 1029-1033 (2011) - [j2]Pinhui Ke, Zheng Yang, Jie Zhang:
On the Autocorrelation and Linear Complexity of Some 2p Periodic Quaternary Cyclotomic Sequences over F4. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2472-2477 (2011)
2000 – 2009
- 2009
- [j1]Pinhui Ke, Liuling Huang, Shengyuan Zhang:
Improved lower bound on the number of balanced symmetric functions over GF. Inf. Sci. 179(5): 682-687 (2009) - 2008
- [i2]Pinhui Ke:
Improved lower bound on the number of balanced symmetric functions over GF(p). IACR Cryptol. ePrint Arch. 2008: 165 (2008) - 2006
- [c2]Pinhui Ke, Jie Zhang, Qiaoyan Wen:
Results on Almost Resilient Functions. ACNS 2006: 421-432 - 2005
- [c1]Pinhui Ke, Tailin Liu, Qiao-Yan Wen:
Constructions of Almost Resilient Functions. CANS 2005: 236-246 - [i1]Pinhui Ke, Jie Zhang, Qiaoyan Wen:
Further Constructions of Almost Resilient Functions. IACR Cryptol. ePrint Arch. 2005: 453 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
