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