default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTadao Kasami
Person information
- affiliation: Nara Institute of Science and Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2010
[j103]Hitoshi Tokushige, Marc P. C. Fossorier, Tadao Kasami:
A test pattern selection method for a joint bounded-distance and encoding-based decoding algorithm of binary codes [Transactions Letters]. IEEE Trans. Commun. 58(6): 1601-1604 (2010)
2000 – 2009
- 2009
- [j102]Hitoshi Tokushige, Marc P. C. Fossorier, Tadao Kasami:
A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 671-672 (2009) - 2007
- [j101]Kenji Yasunaga, Toru Fujiwara, Tadao Kasami:
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(3): 698-701 (2007) - [j100]Yuki Kato
, Hiroyuki Seki, Tadao Kasami:
RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar. Inf. Media Technol. 2(1): 79-88 (2007) - 2006
- [j99]Hitoshi Tokushige, Ippei Hisadomi, Tadao Kasami:
Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(11): 3355-3359 (2006) - [c23]Yuki Kato, Hiroyuki Seki, Tadao Kasami:
Stochastic Multiple Context-Free Grammar for RNA Pseudoknot Modeling. TAG 2006: 57-64 - 2005
- [j98]Yuki Kato, Hiroyuki Seki, Tadao Kasami:
On the Generative Power of Grammars for RNA Secondary Structure. IEICE Trans. Inf. Syst. 88-D(1): 53-64 (2005) - 2004
- [j97]Hitoshi Tokushige, Takaaki Tanoue, Tadao Kasami:
On binary images of shortened cyclic (8, 5) codes over GF(28). IEEE Commun. Lett. 8(4): 253-255 (2004) - [c22]Jun Asatani, Takuya Koumoto, Toru Fujiwara, Tadao Kasami:
Soft-input soft-output decoding algorithm of linear block codes based on minimum distance search. ISIT 2004: 345 - [c21]Yuki Kato, Hiroyuki Seki, Tadao Kasami:
Subclasses of Tree Adjoining Grammar for RNA Secondary Structure. TAG+ 2004: 48-55 - 2003
- [j96]Hitoshi Tokushige, Takuya Koumoto, Marc P. C. Fossorier, Tadao Kasami:
Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2445-2451 (2003) - [j95]Jun Asatani, Takuya Koumoto, Kenichi Tomita, Tadao Kasami:
Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(10): 2596-2600 (2003) - 2002
- [j94]Jun Asatani, Kenichi Tomita, Takuya Koumoto, Toyoo Takata, Tadao Kasami:
A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(10): 2220-2228 (2002) - [j93]Yuansheng Tang, Toru Fujiwara, Tadao Kasami:
Asymptotic optimality of the GMD and chase decoding algorithms. IEEE Trans. Inf. Theory 48(8): 2401-2405 (2002) - [c20]Hitoshi Tokushige, Ippei Hisadomi, Tadao Kasami:
On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes. GLOBECOM 2002: 1042-1045 - [c19]Takuya Koumoto, Tadao Kasami:
Top-down recursive maximum likelihood decoding using ordered statistic information. ITW 2002: 202 - 2001
- [c18]Tadao Kasami, Hitoshi Tokushige, Yuichi Kaji:
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms. AAECC 2001: 333-342 - [c17]Hitoshi Tokushige, Takaaki Tanoue, Tadao Kasami:
On the binary images of (8, 5) shortened cyclic codes over GF(28). GLOBECOM 2001: 896-900
1990 – 1999
- 1999
- [j92]Robert Morelos-Zaragoza, Toru Fujiwara, Tadao Kasami, Shu Lin:
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity. IEEE Trans. Inf. Theory 45(2): 725-731 (1999) - [j91]Takuya Koumoto, Toyoo Takata, Tadao Kasami, Shu Lin:
A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes. IEEE Trans. Inf. Theory 45(2): 731-741 (1999) - [c16]Tadao Kasami:
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms. AAECC 1999: 43-54 - [c15]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 - [c14]Morgan Hirosuke Miki, Daisuke Taki, Gen Fujita, Takao Onoye, Isao Shirakawa, Toru Fujiwara, Tadao Kasami:
Recursive maximum likelihood decoder for high-speed satellite communication. ISCAS (4) 1999: 572-575 - 1998
- [j90]Robert Morelos-Zaragoza, Tadao Kasami, Shu Lin, Hideki Imai:
On block-coded modulation using unequal error protection codes over Rayleigh-fading channels. IEEE Trans. Commun. 46(1): 1-4 (1998) - [j89]Toru Fujiwara, Hiroshi Yamamoto, Tadao Kasami, Shu Lin:
A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes. IEEE Trans. Inf. Theory 44(2): 714-729 (1998) - 1997
- [j88]Yuichi Kaji, Toru Fujiwara, Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata. J. Symb. Comput. 23(1): 79-117 (1997) - [j87]Tadao Kasami, Toyoo Takata, Kouichi Yamashita, Toru Fujiwara, Shu Lin:
On bit-error probability of a concatenated coding scheme. IEEE Trans. Commun. 45(5): 536-543 (1997) - [j86]Hari T. Moorthy, Shu Lin, Tadao Kasami:
Soft-decision decoding of binary linear block codes based on an iterative search algorithm. IEEE Trans. Inf. Theory 43(3): 1030-1040 (1997) - [j85]Y. Desaki, Toru Fujiwara, Tadao Kasami:
The weight distributions of extended binary primitive BCH codes of length 128. IEEE Trans. Inf. Theory 43(4): 1364-1371 (1997) - [c13]Tadao Kasami, Tsukasa Sugita, Toru Fujiwara:
The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin. AAECC 1997: 197-211 - [c12]Hajime Watanabe, Tadao Kasami:
A secure code for recipient watermarking against conspiracy attacks by all users. ICICS 1997: 414-423 - 1996
- [j84]Tetsuo Sano, Masahiro Higuchi, Hiroyuki Seki, Tadao Kasami:
A phase connection method for communication protocols. Syst. Comput. Jpn. 27(10): 33-47 (1996) - [j83]Tsukasa Sugita, Tadao Kasami, Toru Fujiwara:
The weight distribution of the third-order Reed-Muller code of length 512. IEEE Trans. Inf. Theory 42(5): 1622-1625 (1996) - 1995
- [j82]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) - [c11]Robert Morelos-Zaragoza, Tadao Kasami, Shu Lin:
Multilevel block coded 8-PSK modulations using unequal error protection codes for the Rayleigh fading channel. PIMRC 1995: 486-490 - 1994
- [j81]Yuichi Kaji, Ryuchi Nakanishi, Hiroyuki Seki, Tadao Kasami:
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars. Comput. Intell. 10: 440-452 (1994) - [j80]Jiantian Wu, Shu Lin, Tadao Kasami, Toru Fujiwara, Toyoo Takata:
An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codes. IEEE Trans. Commun. 42(234): 813-818 (1994) - [j79]Toyoo Takata, Yuji Yamashita, Toru Fujiwara, Tadao Kasami, Shu Lin:
Suboptimum decoding of decomposable block codes. IEEE Trans. Inf. Theory 40(5): 1392-1405 (1994) - [c10]Yuichi Kaji, Toru Fujiwara, Tadao Kasami:
Solving a Unification Problem under Constrained Substitutions Using Tree Automata. FSTTCS 1994: 276-287 - 1993
- [j78]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 Trans. Inf. Theory 39(1): 242-245 (1993) - [j77]Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
On complexity of trellis structure of linear block codes. IEEE Trans. Inf. Theory 39(3): 1057-1064 (1993) - [j76]Toyoo Takata, Satoshi Ujita, Tadao Kasami, Shu Lin:
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis. IEEE Trans. Inf. Theory 39(4): 1204-1218 (1993) - [c9]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 - [c8]Yasunori Ishihara, Hiroyuki Seki, Tadao Kasami:
A translation method from natural language specifications into formal specifications using contextual dependencies. RE 1993: 232-239 - [c7]Shou-ping Feng, Toru Fujiwara, Tadao Kasami, Kazuhiko Iwasaki:
On the maximum value of aliasing probabilities for single input signature registers. VTS 1993: 267-274 - 1992
- [j75]Hiroyuki Seki, Tadao Kasami, Eiji Nabika, Takashi Matsumura:
A method for translating natural language program specifications into algebraic specifications. Syst. Comput. Jpn. 23(11): 1-16 (1992) - [c6]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 - [c5]Kazuhiko Iwasaki, Toru Fujiwara, Tadao Kasami:
A defect-tolerant design for mask ROMs. VTS 1992: 171-175 - 1991
- [j74]Minoru Ito, Tadao Kasami:
Optimizing universal queries in relational databases. Syst. Comput. Jpn. 22(3): 19-30 (1991) - [j73]Takashi Matsumura, Hiroyuki Seki, Mamoru Fujii, Tadao Kasami:
The generative power of multiple context-free grammars and head grammars. Syst. Comput. Jpn. 22(4): 41-56 (1991) - [j72]Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, Tadao Kasami:
On Multiple Context-Free Grammars. Theor. Comput. Sci. 88(2): 191-229 (1991) - [j71]Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
On linear structure and phase rotation invariant properties of block M-PSK modulation codes. IEEE Trans. Inf. Theory 37(1): 164-167 (1991) - [j70]Toru Fujiwara, Minoru Ito, Tadao Kasami, Mitsuteru Kataoka, Jun Okui:
Performance analysis of disk allocation method using error-correcting codes. IEEE Trans. Inf. Theory 37(2): 379-384 (1991) - [j69]Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
On multilevel block modulation codes. IEEE Trans. Inf. Theory 37(4): 965-975 (1991) - [j68]Toru Fujiwara, Tadao Kasami, Shou-ping Feng:
On the monotonic property of the probability of undetected error for a shortened code. IEEE Trans. Inf. Theory 37(5): 1409-1411 (1991) - [p2]Teruo Higashino, Kenichi Taniguchi, Tadao Kasami, Mamoru Fujii, Masaaki Mori:
An Algebraic Method For Verifying Progress Property of Communication Protocols. Software Science and Engineering 1991: 39-59 - [p1]Hiroyuki Seki, Kenichi Taniguchi, Tadao Kasami:
On Operational Semantics of Congruence Relation Defined in Algebraic Language ASL/. Software Science and Engineering 1991: 60-77 - 1990
- [j67]Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
A concatenated coded modulation scheme for error control. IEEE Trans. Commun. 38(6): 752-763 (1990) - [j66]Toyoo Takata, Toru Fujiwara, Tadao Kasami, Shu Lin:
An error control system with multiple-stage forward error corrections. IEEE Trans. Commun. 38(10): 1799-1809 (1990)
1980 – 1989
- 1989
- [j65]Teruo Higashino, Mamoru Fujii, Kenichi Taniguchi, Tadao Kasami, Masaaki Mori:
Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol. Syst. Comput. Jpn. 20(5): 57-68 (1989) - [j64]Tadao Kasami, Hiroyuki Seki, Mamoru Fujii:
Membership problem for head languages and multiple context-free languages. Syst. Comput. Jpn. 20(6): 43-51 (1989) - [j63]Tadao Kasami, Hiroyuki Seki, Mamoru Fujii:
Generalized context-free grammars and multiple context-free grammars. Syst. Comput. Jpn. 20(7): 43-52 (1989) - [j62]Toru Fujiwara, Tadao Kasami, Shu Lin:
Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3. IEEE Trans. Commun. 37(9): 986-989 (1989) - 1988
- [j61]Tadao Kasami, Toru Fujiwara, Toyoo Takata, Shu Lin:
A cascaded coding scheme for error control and its performance analysis. IEEE Trans. Inf. Theory 34(3): 448-462 (1988) - 1987
- [j60]Koji Torii, Yuji Sugiyama, Mamoru Fujii, Tadao Kasami, Yoshitomi Morisawa:
Logical Programming for the Telegram Analysis Problem. Comput. Lang. 12(1): 9-20 (1987) - [j59]Toru Fujiwara, Kenichi Taniguchi, Tadao Kasami:
Decision problem concerning security for cryptographic protocols. Syst. Comput. Jpn. 18(5): 67-78 (1987) - [j58]Tadao Kasami, Kenichi Taniguchi, Yuji Sugiyama, Hiroyuki Seki:
Principles of algebraic language ASL. Syst. Comput. Jpn. 18(7): 11-20 (1987) - [j57]Teruo Higashino, Kenichi Taniguchi, Tadao Kasami, Mamoru Fujii, Masaaki Mori:
Verification of progress property of algebraically specified communication protocols. Syst. Comput. Jpn. 18(9): 96-107 (1987) - 1986
- [j56]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) - [j55]Tadao Kasami, Toru Fujiwara, Shu Lin:
A Concatenated Coding Scheme for Error Control. IEEE Trans. Commun. 34(5): 481-488 (1986) - [j54]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) - [j53]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 Trans. Inf. Theory 32(5): 706-709 (1986) - 1985
- [j52]Hiroyuki Seki, Kenichi Taniguchi, Tadao Kasami:
Optimization of functional language ASL/F programs. Syst. Comput. Jpn. 16(4): 9-18 (1985) - [j51]Minoru Ito, Motoaki Iwasaki, Tadao Kasami:
Some Results on the Representative Instance in Relational Databases. SIAM J. Comput. 14(2): 334-354 (1985) - [j50]Toru Fujiwara, Tadao Kasami, Atsushi Kitai, Shu Lin:
On the Undetected Error Probability for Shortened Hamming Codes. IEEE Trans. Commun. 33(6): 570-574 (1985) - [j49]Tadao Kasami, Shu Lin, Victor K.-W. Wei, Saburo Yamamura:
Coding for the binary symmetric broadcast channel with two receivers. IEEE Trans. Inf. Theory 31(5): 616-625 (1985) - [j48]Tadao Kasami, Toru Fujiwara, Shu Lin:
An approximation to the weight distribution of binary linear codes. IEEE Trans. Inf. Theory 31(6): 769-780 (1985) - [j47]Ichiro Suzuki, Tadao Kasami:
A Distributed Mutual Exclusion Algorithm. ACM Trans. Comput. Syst. 3(4): 344-349 (1985) - 1984
- [j46]Tadao Kasami, Shu Lin:
On the Probability of Undetected Error for the Maximum Distance Separable Codes. IEEE Trans. Commun. 32(9): 998-1006 (1984) - [j45]Minoru Ito, Motoaki Iwasaki, Kenichi Taniguchi, Tadao Kasami:
Membership Problems for Data Dependencies in Relational Expressions. Theor. Comput. Sci. 34: 315-335 (1984) - [j44]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) - [c4]Koji Torii, Yoshitomi Morisawa, Yuji Sugiyama, Tadao Kasami:
Functional Programming and Logical Programming for the Telegram Analysis Problem. ICSE 1984: 463-472 - 1983
- [j43]Ichiro Suzuki, Tadao Kasami:
Three Measures for Synchronic Dependence in Petri Nets. Acta Informatica 19: 325-338 (1983) - [j42]Minoru Ito, Kenichi Taniguchi, Tadao Kasami:
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions. Theor. Comput. Sci. 22: 175-194 (1983) - [j41]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 Trans. Inf. Theory 29(1): 114-130 (1983) - [j40]Tadao Kasami, Torleiv Kløve, Shu Lin:
Linear block codes for error detection. IEEE Trans. Inf. Theory 29(1): 131-136 (1983) - 1982
- [c3]Ichiro Suzuki, Tadao Kasami:
An Optimality Theory for Mutual Exclusion Algorithms in Computer Networks. ICDCS 1982: 365-370 - 1981
- [j39]Tadao Kasami:
Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey. IEEE Trans. Inf. Theory 27(6): 812 (1981) - 1980
- [j38]Shu Lin, Tadao Kasami, Saburo Yamamura:
Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel. IBM J. Res. Dev. 24(4): 486-495 (1980)
1970 – 1979
- 1979
- [j37]Kenichi Hagihara, Minoru Ito, Kenichi Taniguchi, Tadao Kasami:
Decision Problems for Multivalued Dependencies in Relational Databases. SIAM J. Comput. 8(2): 247-264 (1979) - [c2]Kenichi Taniguchi, Toshio Matsuura, Yuji Sugiyama, Tadao Kasami:
On equivalence of safe Petri nets. FCT 1979: 430-436 - 1978
- [j36]Tadao Kasami, Shu Lin:
Bounds on the achievable rates of block coding for a memoryless multiple-access channel. IEEE Trans. Inf. Theory 24(2): 187-197 (1978) - [j35]Tadao Kasami, Shu Lin:
Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.). IEEE Trans. Inf. Theory 24(5): 633-635 (1978) - [j34]A. V. Kuznetsov, Tadao Kasami, Saburo Yamamura:
An error correcting scheme for defective memory. IEEE Trans. Inf. Theory 24(6): 712-718 (1978) - 1977
- [j33]Toshiro Araki, Tadao Kasami:
Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. Theor. Comput. Sci. 4(1): 99-119 (1977) - 1976
- [j32]Kenichi Taniguchi, Tadao Kasami:
An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts. Acta Informatica 6: 361-364 (1976) - [j31]Tadao Kasami, Nobuki Tokura, Saburo Azumi:
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes. Inf. Control. 30(4): 380-395 (1976) - [j30]Kenichi Taniguchi, Tadao Kasami:
A Result on the Equivalence Problem for Deterministic Pushdown Automata. J. Comput. Syst. Sci. 13(1): 38-50 (1976) - [j29]Toshiro Araki, Tadao Kasami:
Some Decision Problems Related to the Reachability Problem for Petri Nets. Theor. Comput. Sci. 3(1): 85-104 (1976) - [j28]Tadao Kasami, Shu Lin:
Coding for a multiple-access channel. IEEE Trans. Inf. Theory 22(2): 129-137 (1976) - 1974
- [j27]Tadao Kasami:
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.). IEEE Trans. Inf. Theory 20(5): 679 (1974) - [j26]Tadao Kasami:
Construction and decomposition of cyclic codes of composite length (Corresp.). IEEE Trans. Inf. Theory 20(5): 680-683 (1974) - [c1]Nobuki Tokura, Tadao Kasami, Shukichi Furuta:
Ianov Schemas Augmented by a Pushdown Memory. SWAT 1974: 84-94 - 1973
- [j25]W. Wesley Peterson, Tadao Kasami, Nobuki Tokura:
On the Capabilities of While, Repeat, and Exit Statements. Commun. ACM 16(8): 503-512 (1973) - 1972
- [j24]Keijiro Nakamura, Nobuki Tokura, Tadao Kasami:
Minimal Negative Gate Networks. IEEE Trans. Computers 21(1): 5-11 (1972) - [j23]Tadao Kasami, Shu Lin:
Some results on the minimum weight of primitive BCH codes (Corresp.). IEEE Trans. Inf. Theory 18(6): 824-825 (1972) - 1971
- [j22]Tadao Kasami:
The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes. Inf. Control. 18(4): 369-394 (1971) - [j21]Nobuki Tokura, Tadao Kasami, Akihiro Hashimoto:
Failsafe Logic Nets. IEEE Trans. Computers 20(3): 323-330 (1971) - [j20]Tadao Kasami, Shu Lin:
On majority-logic decoding for duals of primitive polynomial codes. IEEE Trans. Inf. Theory 17(3): 322-331 (1971) - [j19]Tadao Kasami, Shu Lin:
On the construction of a class of majority-logic decodable codes. IEEE Trans. Inf. Theory 17(5): 600-610 (1971) - [j18]M. Sugino, Y. Ienaga, Nobuki Tokura, Tadao Kasami:
Weight distribution of (128, 64) Reed-Muller code (Corresp.). IEEE Trans. Inf. Theory 17(5): 627-628 (1971) - 1970
- [j17]Kenichi Taniguchi, Tadao Kasami:
Reduction of Context-Free Grammars. Inf. Control. 17(1): 92-108 (1970) - [j16]Tadao Kasami, Nobuki Tokura:
On the weight structure of Reed-Muller codes. IEEE Trans. Inf. Theory 16(6): 752-759 (1970)
1960 – 1969
- 1969
- [j15]Kenichi Taniguchi, Tadao Kasami:
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine. Inf. Control. 14(3): 278-284 (1969) - [j14]Tadao Kasami, Koji Torii:
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars. J. ACM 16(3): 423-431 (1969) - [j13]Tadao Kasami:
An upper bound on k/n for affine-invariant codes with fixed d/n (Corresp.). IEEE Trans. Inf. Theory 15(1): 174-176 (1969) - [j12]Tadao Kasami, Nobuki Tokura:
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes. IEEE Trans. Inf. Theory 15(3): 408-413 (1969) - 1968
- [j11]Harry T. Hsu, Tadao Kasami, Robert T. Chien:
Error-correcting codes for a compound channel. IEEE Trans. Inf. Theory 14(1): 135-139 (1968) - [j10]Tadao Kasami, Shu Lin, W. Wesley Peterson:
New generalizations of the Reed-Muller codes-I: Primitive codes. IEEE Trans. Inf. Theory 14(2): 189-199 (1968) - [j9]Tadao Kasami, Shu Lin, W. Wesley Peterson:
Polynomial codes. IEEE Trans. Inf. Theory 14(6): 807-814 (1968) - [j8]Tadao Kasami:
Some lower bounds on the minimum weight of cyclic codes of composite length. IEEE Trans. Inf. Theory 14(6): 814-818 (1968) - 1967
- [j7]Tadao Kasami:
A Note on Computing Time for Recognition of Languages Generated by Linear Grammars. Inf. Control. 10(2): 209-214 (1967) - [j6]Tadao Kasami, Shu Lin, W. Wesley Peterson:
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application. Inf. Control. 11(5/6): 475-496 (1967) - [j5]Nobuki Tokura, Kenichi Taniguchi, Tadao Kasami:
A search procedure for finding optimum group codes for the binary symmetric channel. IEEE Trans. Inf. Theory 13(4): 587-594 (1967) - 1964
- [j4]Tadao Kasami:
A decoding procedure for multiple-error-correcting cyclic codes. IEEE Trans. Inf. Theory 10(2): 134-138 (1964) - [j3]Tadao Kasami, S. Matoba:
Some efficient shortened cyclic codes for burst-error correction (Corresp.). IEEE Trans. Inf. Theory 10(3): 252-253 (1964) - 1963
- [j2]Tadao Kasami:
Optimum shortened cyclic codes for burst-error correction. IEEE Trans. Inf. Theory 9(2): 105-109 (1963) - 1961
- [j1]Tadao Kasami:
Optimum linear finite-dimensional estimator of signal waveforms. IRE Trans. Inf. Theory 7(4): 206-215 (1961)
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-10-07 21:11 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:
