default search action
Junru Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Wenhao Li, Bingbo Wang, Junru Zheng:
Disease Treatment Key Genes Identification In Heterogeneous Interaction Networks. BIBM 2023: 3642-3649
2010 – 2019
- 2017
- [c13]Junru Zheng, Takayasu Kaida:
On the consecutive sets of defining sequence for lower bounds on cyclic codes. IWSDA 2017: 178-181 - 2015
- [j6]Junru Zheng, Takayasu Kaida:
On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(12): 2476-2479 (2015) - [c12]Takayasu Kaida, Junru Zheng:
On linear complexity of periodic sequences over extension fields from cyclic difference sets. IWSDA 2015: 15-18 - [c11]Junru Zheng, Takayasu Kaida:
The computational complexity of some algorithms for the rank bounded distance on cyclic codes. IWSDA 2015: 38-41 - 2014
- [c10]Takayasu Kaida, Junru Zheng, Keiichi Takahashi:
On generalized constant-weight codes over GF(q) from a cyclic difference set and their properties. ISITA 2014: 722-726 - 2013
- [j5]Takayasu Kaida, Junru Zheng:
On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(1): 171-176 (2013) - [c9]Takayasu Kaida, Junru Zheng:
On some algorithms on the proposed lower bound of the designed minimum distance for cyclic codes. APCC 2013: 520-524 - [c8]Junru Zheng, Takayasu Kaida:
On relationship between proposed lower bound and well-known bounds for cyclic codes. IWSDA 2013: 32-35 - [c7]Takayasu Kaida, Junru Zheng:
On correlation properties of 4-phase with zero points from constant-weight sequences over GF(5). IWSDA 2013: 36-39 - 2012
- [j4]Junru Zheng, Takayasu Kaida:
Construction of Independent Set and Its Application for Designed Minimum Distance. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(12): 2107-2112 (2012) - [c6]Junru Zheng, Takayasu Kaida:
The designed minimum distance of medium lengths for binary cyclic codes. ISITA 2012: 441-445 - [c5]Takayasu Kaida, Junru Zheng:
On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes. ISITA 2012: 446-449 - 2011
- [c4]Junru Zheng, Takayasu Kaida:
On relationship between proposed lower bound and shift bound for cyclic codes. IWSDA 2011: 13-16 - [c3]Takayasu Kaida, Junru Zheng:
On q-ary constant weight sequences from cyclic difference sets. IWSDA 2011: 126-129 - 2010
- [j3]Junru Zheng, Takayasu Kaida:
A Note on the Shift Bound for Cyclic Codes by the DFT. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(11): 1918-1922 (2010) - [c2]Takayasu Kaida, Junru Zheng:
Hamming distance correlation for q-ary constant weight codes. ISITA 2010: 842-845 - [c1]Junru Zheng, Takayasu Kaida:
An algorithm for new lower bound of minimum distance by DFT for cyclic codes. ISITA 2010: 846-849
2000 – 2009
- 2009
- [j2]Junru Zheng, Takayasu Kaida:
On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(10): 2484-2486 (2009) - 2006
- [j1]Junru Zheng, Takayasu Kaida:
On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(9): 2337-2340 (2006)
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-04-25 05:53 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: