default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyoki Imamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j11]Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences. IEEE Trans. Inf. Theory 50(11): 2911-2915 (2004)- [c7]Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences. ISIT 2004: 123 - [c6]Zongduo Dai, Kyoki Imamura, Junhui Yang:
Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences. SETA 2004: 129-142 - 2003
- [j10]Tsutomu Moriuchi, Satoshi Uehara, Takayasu Kaida, Kyoki Imamura:
Linear Complexities of Periodic Sequences Obtained from Sequences over Z4 and Z8 by One-Symbol Substitution. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1285-1293 (2003) - 2001
- [c5]Takayasu Kaida, Satoshi Uehara, Kyoki Imamura:
On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n. SETA 2001: 218-227 - [c4]Satoshi Uehara, Kyoki Imamura:
Characteristic Polynomials of Binary Kronecker Sequences. SETA 2001: 310-318 - 2000
- [j9]Shaoquan Jiang, Zongduo Dai, Kyoki Imamura:
Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period. IEEE Trans. Inf. Theory 46(3): 1174-1177 (2000) - [j8]Shinya Matsufuji, Kyoki Imamura:
A spread-spectrum communication system protecting information data from interception. IEEE Trans. Inf. Theory 46(4): 1691-1695 (2000) - [j7]Guozhen Xiao, Shimin Wei, Kwok-Yan Lam, Kyoki Imamura:
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q). IEEE Trans. Inf. Theory 46(6): 2203-2206 (2000)
1990 – 1999
- 1999
- [j6]Takayasu Kaida, Satoshi Uehara, Kyoki Imamura:
An Algorithm for thek-Error Linear Complexity of Sequences over GF(pm) with Period pn, pa Prime. Inf. Comput. 151(1-2): 134-147 (1999) - 1998
- [j5]Zong-Duo Dai, Kyoki Imamura:
Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q). IEEE Trans. Inf. Theory 44(3): 1328-1331 (1998) - [c3]Takayasu Kaida, Satoshi Uehara, Kyoki Imamura:
A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n. SETA 1998: 284-296 - 1996
- [c2]Takayasu Kaida, Satoshi Uehara, Kyoki Imamura:
Computation of the k-Error Linear Complexity of Binary Sequences with Period 2n. ASIAN 1996: 182-191 - 1995
- [j4]Tsutomu Moriuchi, Kyoki Imamura:
Balanced nonbinary sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences. IEEE Trans. Inf. Theory 41(2): 572-576 (1995) - 1993
- [j3]Shinya Matsufuji, Kyoki Imamura:
Balanced quadriphase sequences with optimal periodic correlation properties constructed by real-valued bent functions. IEEE Trans. Inf. Theory 39(1): 305-310 (1993) - 1990
- [c1]Shinya Matsufuji, Kyoki Imamura:
Real-Valued Bent Function and Its Application to the Design of Balanced Quadriphase Sequences with Optimal Correlation Properties. AAECC 1990: 113-121
1980 – 1989
- 1987
- [j2]Kyoki Imamura, Wataru Yoshida:
A simple derivation of the Berlekamp- Massey algorithm and some applications. IEEE Trans. Inf. Theory 33(1): 146-150 (1987) - 1980
- [j1]Kyoki Imamura:
A method for computing addition tables in GF(pn) (Corresp.). IEEE Trans. Inf. Theory 26(3): 367-369 (1980)
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-04-25 05:44 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:
