IEICE Trans

Satoshi OKAWA

A Ternary Zero-Correlation Zone Sequence Set Having Wide Inter-Subset Zero-Correlation Zone Takafumi HAYASHI Takao MAEDA Shinya MATSUFUJI Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/11/01 Vol. E94-A No. 11 pp. 2230-2235 Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications) Category: Sequence Keyword: ternary sequence, zero-correlation zone, Hadamard matrix, inter-subset correlation, inter-cell, mutually orthogonal complementary sets,
	Summary \| Full Text:PDF

A Generalized Construction of Zero-Correlation Zone Sequence Set with Sequence Subsets Takafumi HAYASHI Takao MAEDA Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/07/01 Vol. E94-A No. 7 pp. 1597-1602 Type of Manuscript: LETTER Category: Spread Spectrum Technologies and Applications Keyword: finite-length sequence, sequence subsets, inter-subset zero-correlation, zero-correlation zone, aperiodic correlation function, periodic correlation function,
	Summary \| Full Text:PDF

The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages Satoshi OKAWA Sadaki HIROSE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/10/01 Vol. E89-D No. 10 pp. 2591-2599 Type of Manuscript: PAPER Category: Automata and Formal Language Theory Keyword: DNA computer, Watson-Crick automata, formal languages, language family,
	Summary \| Full Text:PDF

On Computational Power of Insertion-Deletion Systems without Using Contexts Sadaki HIROSE Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2005/08/01 Vol. E88-D No. 8 pp. 1993-1995 Type of Manuscript: LETTER Category: Automata and Formal Language Theory Keyword: Insertion-Deletion system, DNA computing, formal language, automaton,
	Summary \| Full Text:PDF

Upper Bounds of the Correlation Functions of a Class of Binary Zero-Correlation-Zone Sequences Takafumi HAYASHI Takao MAEDA Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/03/01 Vol. E88-A No. 3 pp. 791-794 Type of Manuscript: LETTER Category: Coding Theory Keyword: zero-correlation, binary sequence, upper bounds,
	Summary \| Full Text:PDF

A Class of Ternary Sequence Sets with a Zero-Correlation Zone Takafumi HAYASHI Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/06/01 Vol. E87-A No. 6 pp. 1591-1598 Type of Manuscript: PAPER Category: Coding Theory Keyword: ternary sequence, finite-length sequence, zero-correlation zone, even correlation function, odd correlation function,
	Summary \| Full Text:PDF

Correction to the Diameter of Trivalent Cayley Graphs Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/05/01 Vol. E84-A No. 5 pp. 1269-1272 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: network topology, trivalent Cayley graph, diameter,
	Summary \| Full Text:PDF

Dyck Reductions are More Powerful Than Homomorphic Characterizations Sadaki HIROSE Satoshi OKAWA Haruhiko KIMURA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/09/25 Vol. E80-D No. 9 pp. 958-961 Type of Manuscript: LETTER Category: Automata,Languages and Theory of Computing Keyword: Dyck language, Dyck reduction, homomorphic characterization,
	Summary \| Full Text:PDF

Homomorphic Characterizations Are More Powerful Than Dyck Reductions Sadaki HIROSE Satoshi OKAWA Haruhiko KIMURA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/03/25 Vol. E80-D No. 3 pp. 390-392 Type of Manuscript: LETTER Category: Automata,Languages and Theory of Computing Keyword: Dyck language, Dyck reduction, homomorphic characterization,
	Summary \| Full Text:PDF

Set-To-Set Fault Tolerant Routing in Hypercudes* Qian Ping GU Satoshi OKAWA Shietung PENG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/25 Vol. E79-A No. 4 pp. 483-488 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithms, interconnection networks, node disjoint path, fault tolerant routing,
	Summary \| Full Text:PDF

Dyck Reductions of Minimal Linear Languages Yield the Full Class of Recursively Enumerable Languages Sadaki HIROSE Satoshi OKAWA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/02/25 Vol. E79-D No. 2 pp. 161-164 Type of Manuscript: LETTER Category: Automata,Languages and Theory of Computing Keyword: Dyck language, Dyck reduction, recursively enumerable language, minimal linear language,
	Summary \| Full Text:PDF