Kyoki Imamura

According to our database1, Kyoki Imamura authored at least 18 papers between 1980 and 2004.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences.
IEEE Trans. Inf. Theory, 2004

Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences.
Proceedings of the Sequences and Their Applications, 2004

Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Linear Complexities of Periodic Sequences Obtained from Sequences over <i>Z</i><sub>4</sub> and <i>Z</i><sub>8</sub> by One-Symbol Substitution.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2001
Characteristic Polynomials of Binary Kronecker Sequences.
Proceedings of the Sequences and their Applications, 2001

On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 2001

2000
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q).
IEEE Trans. Inf. Theory, 2000

A spread-spectrum communication system protecting information data from interception.
IEEE Trans. Inf. Theory, 2000

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, 2000

1999
An Algorithm for thek-Error Linear Complexity of Sequences over GF(p<sup>m</sup>) with Period p<sup>n</sup>, pa Prime.
Inf. Comput., 1999

1998
Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q).
IEEE Trans. Inf. Theory, 1998

A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 1998

1996
Computation of the k-Error Linear Complexity of Binary Sequences with Period 2<sup>n</sup>.
Proceedings of the Concurrency and Parallelism, 1996

1995
Balanced nonbinary sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences.
IEEE Trans. Inf. Theory, 1995

1993
Balanced quadriphase sequences with optimal periodic correlation properties constructed by real-valued bent functions.
IEEE Trans. Inf. Theory, 1993

1990
Real-Valued Bent Function and Its Application to the Design of Balanced Quadriphase Sequences with Optimal Correlation Properties.
Proceedings of the Applied Algebra, 1990

1987
A simple derivation of the Berlekamp- Massey algorithm and some applications.
IEEE Trans. Inf. Theory, 1987

1980
A method for computing addition tables in GF(p<sup>n)</sup> (Corresp.).
IEEE Trans. Inf. Theory, 1980


  Loading...