| 2007 |
|---|
| 62 | EE | Kenji Yasunaga,
Toru Fujiwara,
Tadao Kasami:
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code.
IEICE Transactions 90-A(3): 698-701 (2007) |
| 2006 |
|---|
| 61 | EE | Hitoshi Tokushige,
Ippei Hisadomi,
Tadao Kasami:
Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes.
IEICE Transactions 89-A(11): 3355-3359 (2006) |
| 2005 |
|---|
| 60 | EE | Yuki Kato,
Hiroyuki Seki,
Tadao Kasami:
On the Generative Power of Grammars for RNA Secondary Structure.
IEICE Transactions 88-D(1): 53-64 (2005) |
| 2002 |
|---|
| 59 | | Yuansheng Tang,
Toru Fujiwara,
Tadao Kasami:
Asymptotic optimality of the GMD and chase decoding algorithms.
IEEE Transactions on Information Theory 48(8): 2401-2405 (2002) |
| 2001 |
|---|
| 58 | EE | Tadao Kasami,
Hitoshi Tokushige,
Yuichi Kaji:
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms.
AAECC 2001: 333-342 |
| 1999 |
|---|
| 57 | | Yuansheng Tang,
Tadao Kasami,
Toru Fujiwara:
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity.
AAECC 1999: 201-210 |
| 56 | | Tadao Kasami:
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms.
AAECC 1999: 43-54 |
| 55 | | Robert Morelos-Zaragoza,
Toru Fujiwara,
Tadao Kasami,
Shu Lin:
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity.
IEEE Transactions on Information Theory 45(2): 725-731 (1999) |
| 54 | | Takuya Koumoto,
Toyoo Takata,
Tadao Kasami,
Shu Lin:
A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes.
IEEE Transactions on Information Theory 45(2): 731-741 (1999) |
| 1998 |
|---|
| 53 | | Toru Fujiwara,
Hiroshi Yamamoto,
Tadao Kasami,
Shu Lin:
A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes.
IEEE Transactions on Information Theory 44(2): 714-729 (1998) |
| 1997 |
|---|
| 52 | | Tadao Kasami,
Tsukasa Sugita,
Toru Fujiwara:
The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin.
AAECC 1997: 197-211 |
| 51 | | Hajime Watanabe,
Tadao Kasami:
A secure code for recipient watermarking against conspiracy attacks by all users.
ICICS 1997: 414-423 |
| 50 | | H. T. Moorthy,
Shu Lin,
Tadao Kasami:
Soft-decision decoding of binary linear block codes based on an iterative search algorithm.
IEEE Transactions on Information Theory 43(3): 1030-1040 (1997) |
| 49 | | Y. Desaki,
Toru Fujiwara,
Tadao Kasami:
The weight distributions of extended binary primitive BCH codes of length 128.
IEEE Transactions on Information Theory 43(4): 1364-1371 (1997) |
| 48 | | Yuichi Kaji,
Toru Fujiwara,
Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
J. Symb. Comput. 23(1): 79-117 (1997) |
| 1996 |
|---|
| 47 | | Tsukasa Sugita,
Tadao Kasami,
Toru Fujiwara:
The weight distribution of the third-order Reed-Muller code of length 512.
IEEE Transactions on Information Theory 42(5): 1622-1625 (1996) |
| 1995 |
|---|
| 46 | | Shou-ping Feng,
Toru Fujiwara,
Tadao Kasami,
Kazuhiko Iwasaki:
On the Maximum Value of Aliasing Probabilities for Single Input Signature Registers.
IEEE Trans. Computers 44(11): 1265-1274 (1995) |
| 1994 |
|---|
| 45 | | Yuichi Kaji,
Toru Fujiwara,
Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
FSTTCS 1994: 276-287 |
| 44 | | Yuichi Kaji,
Ryuchi Nakanishi,
Hiroyuki Seki,
Tadao Kasami:
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
Computational Intelligence 10: 440-452 (1994) |
| 43 | | Toyoo Takata,
Y. Yamashita,
Toru Fujiwara,
Tadao Kasami,
Shu Lin:
Suboptimum decoding of decomposable block codes.
IEEE Transactions on Information Theory 40(5): 1392-1405 (1994) |
| 1993 |
|---|
| 42 | | Hiroyuki Seki,
Ryuichi Nakanishi,
Yuichi Kaji,
Sachiko Ando,
Tadao Kasami:
Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars.
ACL 1993: 130-139 |
| 41 | | Tadao Kasami,
Toyoo Takata,
Toru Fujiwara,
Shu Lin:
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes.
IEEE Transactions on Information Theory 39(1): 242- (1993) |
| 40 | | Tadao Kasami,
Toyoo Takata,
Toru Fujiwara,
Shu Lin:
On complexity of trellis structure of linear block codes.
IEEE Transactions on Information Theory 39(3): 1057- (1993) |
| 39 | | Toyoo Takata,
Satoshi Ujita,
Tadao Kasami,
Shu Lin:
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis.
IEEE Transactions on Information Theory 39(4): 1204-1218 (1993) |
| 1992 |
|---|
| 38 | | Masahiro Higuchi,
Osamu Shirakawa,
Hiroyuki Seki,
Mamoru Fujii,
Tadao Kasami:
A Verification Procedure via Invariant for Extended Communicating Finite-State Machines.
CAV 1992: 384-395 |
| 1991 |
|---|
| 37 | | Tadao Kasami,
Toyoo Takata,
Toru Fujiwara,
Shu Lin:
On linear structure and phase rotation invariant properties of block M-PSK modulation codes.
IEEE Transactions on Information Theory 37(1): 164- (1991) |
| 36 | | Toru Fujiwara,
Minoru Ito,
Tadao Kasami,
Mitsuteru Kataoka,
Jun Okui:
Performance analysis of disk allocation method using error-correcting codes.
IEEE Transactions on Information Theory 37(2): 379- (1991) |
| 35 | | Tadao Kasami,
Toyoo Takata,
Toru Fujiwara,
Shu Lin:
On multilevel block modulation codes.
IEEE Transactions on Information Theory 37(4): 965-975 (1991) |
| 34 | | Toru Fujiwara,
Tadao Kasami,
Shou-ping Feng:
On the monotonic property of the probability of undetected error for a shortened code.
IEEE Transactions on Information Theory 37(5): 1409- (1991) |
| 33 | | Hiroyuki Seki,
T. Matsumura,
Mamoru Fujii,
Tadao Kasami:
On Multiple Context-Free Grammars.
Theor. Comput. Sci. 88(2): 191-229 (1991) |
| 1988 |
|---|
| 32 | | Tadao Kasami,
Toru Fujiwara,
Toyoo Takata,
Shu Lin:
A cascaded coding scheme for error control and its performance analysis.
IEEE Transactions on Information Theory 34(3): 448-462 (1988) |
| 1987 |
|---|
| 31 | | Koji Torii,
Yuji Sugiyama,
Mamoru Fujii,
Tadao Kasami,
Yoshitomi Morisawa:
Logical Programming for the Telegram Analysis Problem.
Comput. Lang. 12(1): 9-20 (1987) |
| 1986 |
|---|
| 30 | | Toru Fujiwara,
Toyoo Takata,
Tadao Kasami,
Shu Lin:
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11.
IEEE Transactions on Information Theory 32(5): 706- (1986) |
| 29 | | Katsuro Inoue,
Hiroyuki Seki,
Kenichi Taniguchi,
Tadao Kasami:
Compiling and Optimizing Methods for the Functional Language ASL/F.
Sci. Comput. Program. 7(3): 297-312 (1986) |
| 28 | | Ichiro Suzuki,
Y. Motohashi,
Kenichi Taniguchi,
Tadao Kasami,
Tatsuaki Okamoto:
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
Theor. Comput. Sci. 43: 277-291 (1986) |
| 1985 |
|---|
| 27 | EE | Ichiro Suzuki,
Tadao Kasami:
A Distributed Mutual Exclusion Algorithm
ACM Trans. Comput. Syst. 3(4): 344-349 (1985) |
| 26 | | Tadao Kasami,
Shu Lin,
Victor K.-W. Wei,
Saburo Yamamura:
Coding for the binary symmetric broadcast channel with two receivers.
IEEE Transactions on Information Theory 31(5): 616-625 (1985) |
| 25 | | Tadao Kasami,
Toru Fujiwara,
Shu Lin:
An approximation to the weight distribution of binary linear codes.
IEEE Transactions on Information Theory 31(6): 769-780 (1985) |
| 24 | | Minoru Ito,
Motoaki Iwasaki,
Tadao Kasami:
Some Results on the Representative Instance in Relational Databases.
SIAM J. Comput. 14(2): 334-354 (1985) |
| 1984 |
|---|
| 23 | | Koji Torii,
Yoshitomi Morisawa,
Yuji Sugiyama,
Tadao Kasami:
Functional Programming and Logical Programming for the Telegram Analysis Problem.
ICSE 1984: 463-472 |
| 22 | | Teruo Higashino,
Masaaki Mori,
Yuji Sugiyama,
Kenichi Taniguchi,
Tadao Kasami:
An Algebraic Specification of HDLC Procedures and Its Verification.
IEEE Trans. Software Eng. 10(6): 825-836 (1984) |
| 21 | | Minoru Ito,
Motoaki Iwasaki,
Kenichi Taniguchi,
Tadao Kasami:
Membership Problems for Data Dependencies in Relational Expressions.
Theor. Comput. Sci. 34: 315-335 (1984) |
| 1983 |
|---|
| 20 | | Ichiro Suzuki,
Tadao Kasami:
Three Measures for Synchronic Dependence in Petri Nets.
Acta Inf. 19: 325-338 (1983) |
| 19 | | Tadao Kasami,
Shu Lin,
Victor K.-W. Wei,
Saburo Yamamura:
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel.
IEEE Transactions on Information Theory 29(1): 114-130 (1983) |
| 18 | | Tadao Kasami,
Torleiv Kløve,
Shu Lin:
Linear block codes for error detection.
IEEE Transactions on Information Theory 29(1): 131- (1983) |
| 17 | | Minoru Ito,
Kenichi Taniguchi,
Tadao Kasami:
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions.
Theor. Comput. Sci. 22: 175-194 (1983) |
| 1981 |
|---|
| 16 | | Tadao Kasami:
Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey.
IEEE Transactions on Information Theory 27(6): 812 (1981) |
| 1979 |
|---|
| 15 | | Kenichi Taniguchi,
Toshio Matsuura,
Yuji Sugiyama,
Tadao Kasami:
On equivalence of safe Petri nets.
FCT 1979: 430-436 |
| 14 | | Kenichi Hagihara,
Minoru Ito,
Kenichi Taniguchi,
Tadao Kasami:
Decision Problems for Multivalued Dependencies in Relational Databases.
SIAM J. Comput. 8(2): 247-264 (1979) |
| 1977 |
|---|
| 13 | | Toshiro Araki,
Tadao Kasami:
Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets.
Theor. Comput. Sci. 4(1): 99-119 (1977) |
| 1976 |
|---|
| 12 | | Kenichi Taniguchi,
Tadao Kasami:
An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts.
Acta Inf. 6: 361-364 (1976) |
| 11 | | Tadao Kasami,
Nobuki Tokura,
Saburo Azumi:
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes
Information and Control 30(4): 380-395 (1976) |
| 10 | | Kenichi Taniguchi,
Tadao Kasami:
A Result on the Equivalence Problem for Deterministic Pushdown Automata.
J. Comput. Syst. Sci. 13(1): 38-50 (1976) |
| 9 | | Toshiro Araki,
Tadao Kasami:
Some Decision Problems Related to the Reachability Problem for Petri Nets.
Theor. Comput. Sci. 3(1): 85-104 (1976) |
| 1974 |
|---|
| 8 | | Nobuki Tokura,
Tadao Kasami,
Shukichi Furuta:
Ianov Schemas Augmented by a Pushdown Memory
FOCS 1974: 84-94 |
| 1973 |
|---|
| 7 | | W. W. Peterson,
Tadao Kasami,
Nobuki Tokura:
On the Capabilities of While, Repeat, and Exit Statements.
Commun. ACM 16(8): 503-512 (1973) |
| 1971 |
|---|
| 6 | | Tadao Kasami:
The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes
Information and Control 18(4): 369-394 (1971) |
| 1970 |
|---|
| 5 | | Kenichi Taniguchi,
Tadao Kasami:
Reduction of Context-Free Grammars
Information and Control 17(1): 92-108 (1970) |
| 1969 |
|---|
| 4 | | Kenichi Taniguchi,
Tadao Kasami:
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine
Information and Control 14(3): 278-284 (1969) |
| 3 | EE | Tadao Kasami,
Koji Torii:
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars.
J. ACM 16(3): 423-431 (1969) |
| 1967 |
|---|
| 2 | | Tadao Kasami:
A Note on Computing Time for Recognition of Languages Generated by Linear Grammars
Information and Control 10(2): 209-214 (1967) |
| 1 | | Tadao Kasami,
S. Lin,
W. W. Peterson:
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application
Information and Control 11(5/6): 475-496 (1967) |
