Tadao Kasami

Q: What Schools Are Affiliated With Tadao Kasami

Tadao Kasami is affiliated with the following schools: Nara Institute of Science and Technology, University of Tokyo, Hiroshima City University, Institute of Science Tokyo, Osaka University

Tadao Kasami's AcademicInfluence.com Rankings

Tadao Kasami

Computer Science

#1200

World Rank

#1240

Historical Rank

Information Theory

#21

World Rank

#22

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Tadao Kasami's Degrees

Bachelors Electrical Engineering University of Tokyo

Why Is Tadao Kasami Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Tadao Kasami was a noted Japanese information theorist who made significant contributions to error correcting codes. He was the earliest to publish the key ideas for the CYK algorithm, separately discovered by Daniel Younger and John Cocke .

(See a Problem?)

Tadao Kasami's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages (1965) (624)
A distributed mutual exclusion algorithm (1985) (358)
The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes (1971) (340)
WEIGHT DISTRIBUTION FORMULA FOR SOME CLASS OF CYCLIC CODES (1966) (323)
New generalizations of the Reed-Muller codes-I: Primitive codes (1968) (210)
On Multiple Context-Free Grammars (1991) (207)
Optimal Sequencing of Two Equivalent Processors (1969) (173)
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes (1993) (160)
WEIGHT DISTRIBUTION OF BOSE-CHAUDHURI-HOCQUENGHEM CODES. (1966) (153)
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application (1966) (150)
On the capabilities of while, repeat, and exit statements (1973) (115)
Some Decision Problems Related to the Reachability Problem for Petri Nets (1976) (109)
Coding for a multiple-access channel (1976) (109)
On Complexity Of Trellis Structure Of Linear Block Codes (1991) (108)
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.) (1974) (105)
On multilevel block modulation codes (1991) (103)
Polynomial codes (1968) (102)
On the Probability of Undetected Error for the Maximum Distance Separable Codes (1984) (100)
A decoding procedure for multiple-error-correcting cyclic codes (1964) (94)
On the weight structure of Reed-Muller codes (1970) (93)
Positive Real Functions of Several Variables and Their Applications to Variable Networks (1960) (88)
On the Undetected Error Probability for Shortened Hamming Codes (1985) (83)
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes (1976) (72)
A concatenated coded modulation scheme for error control (1988) (64)
An approximation to the weight distribution of binary linear codes (1985) (62)
Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3 (1989) (62)
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes (1969) (61)
Optimum shortened cyclic codes for burst-error correction (1963) (59)
On the probability of undetected error of linear block codes (1982) (50)
Soft-decision decoding of binary linear block codes based on an iterative search algorithm (1995) (49)
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel (1983) (46)
The weight distributions of extended binary primitive BCH codes of length 128 (1997) (46)
Bounds on the achievable rates of block coding for a memoryless multiple-access channel (1978) (46)
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis (1993) (41)
The binary weight distribution of the extended (2m,2m − 4) code of the Reed-Solomon code over GF(2m) with generator polynomial (x − α)(x − α2)(x − α3) (1988) (41)
A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars (1969) (40)
Linear block codes for error detection (1983) (39)
Some results on the minimum weight of primitive BCH codes (Corresp.) (1972) (39)
Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets (1977) (38)
Decision Problems for Multivalued Dependencies in Relational Databases (1979) (38)
A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes (1998) (38)
On linear structure and phase rotation invariant properties of block M-PSK modulation codes (1991) (36)
Minimal Negative Gate Networks (1972) (34)
On the construction of a class of majority-logic decodable codes (1971) (32)
On majority-logic decoding for duals of primitive polynomial codes (1971) (32)
RNA Pseudoknotted Structure Prediction Using Stochastic Multiple Context-Free Grammar (2006) (31)
Some Results on the Representative Instance in Relational Databases (1985) (30)
An error correcting scheme for defective memory (1978) (29)
A translation method from natural language specifications into formal specifications using contextual dependencies (1993) (28)
A Result on the Equivalence Problem for Deterministic Pushdown Automata (1976) (26)
On Structural Complexity of the L-Section Minimal Trellis Diagrams for Binary Linear Block Codes (Special Section on Information Theory and Its Applications) (1993) (25)
A Note on Computing Time for Recognition of Languages Generated by Linear Grammars (1967) (25)
A Concatenated Coding Scheme for Error Control (1986) (23)
Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars (1993) (23)
An upper bound on k/n for affine-invariant codes with fixed d/n (Corresp.) (1969) (22)
Generalized context-free grammars and multiple context-free grammars (1989) (21)
An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codes (1994) (19)
Solving a Unification Problem under Constrained Substitutions Using Tree Automata (1994) (19)
Suboptimum decoding of decomposable block codes (1994) (19)
Weight distribution of (128, 64) Reed-Muller code (Corresp.) (1971) (19)
Error-correcting codes for a compound channel (1968) (18)
The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems (1992) (18)
Coding for the binary symmetric broadcast channel with two receivers (1985) (17)
On bit-error probability of a concatenated coding scheme (1997) (17)
Erratum “Optimal Sequencing of Two Equivalent Processors” (1971) (17)
Compiling and Optimizing Methods for the Functional Language ASL/F (1986) (17)
An Algebraic Specification of HDLC Procedures and Its Verification (1984) (16)
Linear Block Codes (1998) (16)
A Method for Computing the Weight Distribution of a Block Code by Using Its Trellis Diagram (Special Section on Information Theory and Its Applications) (1994) (16)
Performance analysis of disk allocation method using error-correcting codes (1991) (15)
Sufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms (1999) (15)
On branch labels of parallel components of the L-section minimal trellis diagrams for binary linear block codes (1994) (15)
Evaluation of the Block Error Probability of Block Modulation Codes by the Maximum-Likelihood Decoding for an Awgn Channel (1993) (14)
Stochastic Multiple Context-Free Grammar for RNA Pseudoknot Modeling (2006) (14)
Failsafe Logic Nets (1971) (13)
Principles of algebraic language ASL (1987) (13)
Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.) (1978) (13)
Some lower bounds on the minimum weight of cyclic codes of composite length (1968) (13)
On the Generative Power of Grammars for RNA Secondary Structure (2005) (13)
A Polynomial Time Learning Algorithm for Recognizable Series (1994) (12)
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11 (1986) (12)
A sufficient condition for ruling out some useless test error patterns in iterative decoding algorithms (1998) (12)
An Optimality Theory for Mutual Exclusion Algorithms in Computer Networks (1982) (11)
A cascaded coding scheme for error control and its performance analysis (1988) (11)
The least stringent sufficient condition on the optimality of suboptimally decoded codewords (1995) (10)
Functional programming and logical programming for the telegram analysis problem (1984) (10)
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity (1999) (10)
Asymptotic optimality of the GMD and chase decoding algorithms (2002) (10)
An Iterative Soft-Decision Decoding Algorithm (1996) (9)
On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms (1999) (9)
Three measures for synchronic dependence in Petri nets (1983) (9)
Membership Problems for Data Dependencies in Relational Expressions (1984) (9)
A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes (1999) (9)
A processing system for programming specifications in a natural language (1988) (8)
THE COMPUTATIONAL COMPLEXITY OF THE UNIVERSAL RECOGNITION PROBLEM FOR PARALLEL MULTIPLE CONTEXT‐FREE GRAMMARS (1994) (8)
On block-coded modulation using unequal error protection codes over Rayleigh-fading channels (1998) (8)
Construction and decomposition of cyclic codes of composite length (Corresp.) (1974) (8)
A secure code for recipient watermarking against conspiracy attacks by all users (1997) (7)
Ianov Schemas Augmented by a Pushdown Memory (1974) (7)
Linear structure and error performance analysis of block PSK modulation codes (1990) (7)
The state complexity of trellis diagrams for a class of generalized concatenated codes (1994) (7)
The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis (1997) (7)
A cascaded coding scheme for error control (1985) (6)
On the monotonic property of the probability of undetected error for a shortened code (1991) (6)
Membership problem for head languages and multiple context-free languages (1989) (6)
Low Weight Subtrellises for Binary Linear Block Codes and Their Applications (1997) (6)
A search procedure for finding optimum group codes for the binary symmetric channel (1967) (6)
A recursive maximum likelihood decoding algorithm for some transitive invariant binary block codes (1998) (6)
Reduction of Context-Free Grammars (1970) (6)
A defect-tolerant design for mask ROMs (1992) (6)
Selection of Search Centers in Iterative Soft-Decision Decoding Algorithms (2001) (6)
Subclasses of Tree Adjoining Grammar for RNA Secondary Structure (2004) (5)
The Weight Distributions of Cosets of the Second-Order Reed-Muller Code of Length 128 in the Third-Order Reed-Muller Code of Length 128 (1995) (5)
The Binary Weight Distribution of the Extended ( 2 m , 2 m-4 ) Code of the Reed-Solomon Code (2001) (5)
Comparison of aliasing probability for multiple MISRs and M-stage MISRs with m inputs (1991) (5)
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine (1969) (5)
An error control system with multiple-stage forward error corrections (1990) (5)
On the maximum value of aliasing probabilities for single input signature registers (1993) (5)
Some efficient shortened cyclic codes for burst-error correction (Corresp.) (1964) (4)
Multi-stage Decoding For Multi-level Block Modulation Codes And Its Performance Analysis (1991) (4)
On the Number of Minimum Weight Codewords of Subcodes of Reed-Muller Codes (1998) (4)
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions (1983) (4)
Soft-input soft-output decoding algorithm of linear block codes based on minimum distance search (2004) (4)
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions (1986) (4)
Decision Problem of the Security for Cryptographic Protocols (1987) (4)
A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (1992) (4)
On integer programming problems related to soft decision decoding algorithms (1999) (4)
A Verification Method via Invariant for Communication Protocols Modeled as Extended Communicating Finite-State Machines (1993) (3)
Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel (1980) (3)
Functional programming language ASL/F and its optimizing compiler (1984) (3)
Top-down recursive maximum likelihood decoding using ordered statistic information (2002) (3)
On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes (2002) (3)
A method for translating natural language program specifications into algebraic specifications (1992) (3)
An improved search algorithm for the adaptive and recursive MLD algorithm (2001) (3)
A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search (2002) (3)
Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms (2003) (3)
New Methods for Computing the Weight Distribution of a Linear Block Code Based on Its Trellis Structure (1994) (3)
An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity (1998) (3)
Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes (2006) (2)
Error Performance of Multilevel Block Coded 8-PSK Modulations Using Unequal Error Protection Codes for the Rayleigh Fading Channel (1997) (2)
EFFICIENT EXECUTION IN A CLASS OF TERM REWRITING SYSTEMS. (1982) (2)
A Systematic Code for Non-Independent Errors (1960) (2)
SOME RESULTS ON CAPABILITIES OF ONEDIMENSIONAL ITERATIVE LOGICAL NETWORKS AND THEIR RELATED PROBLEMS. (1965) (2)
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code (2006) (2)
A Comparative Study on Formal Grammars for Pseudoknots (2003) (2)
Average Complexity Evaluation of an MLD Algorithm Using the Trellis Structure for a Linear Block Code (1995) (2)
An algorithm for testing consistency of a database scheme in relational databases (1983) (2)
Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey (1981) (2)
Comparison of Aliasing Probabilit for Multiple MlSRs and M-stage MlSRs wit i m Inputs (1991) (2)
Optimum linear finite-dimensional estimator of signal waveforms (1961) (2)
The Viterbi and Differential Trellis Decoding Algorithms (1998) (2)
ALGEBRAIC SPECIFICATION OF HDLC PROCEDURES. (1982) (2)
RELIABILITY BOUNDS FOR POLYPHASE CODES FOR THE GAUSSIAN CHANNEL. (1965) (2)
Cross-over component code construction for multi-level block modulation codes (1990) (2)
Adaptive Recursive MLD Algorithm Based on Parallel Concatenation Decomposition for Binary Linear Codes (2004) (1)
The structure and complexity of subtrellis diagrams for low weight codewords of binary linear block codes (1997) (1)
Error performance of multi-stage hard-decision bounded distance decoding for multi-level block modulation codes (1991) (1)
The generative power of multiple context-free grammars and head grammars (1991) (1)
An Improved Union Bound on Block Error Probability for Closest Coset Decoding (1995) (1)
On the Coding of the Path in a Graph and Some Applications (1968) (1)
Optimization of functional language ASL/F programs (1985) (1)
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms (2001) (1)
Logical Programming for the Telegram Analysis Problem (1987) (1)
Finite state translation systems and parallel multiple context-free grammars (1993) (1)
Algebraic specifications of a file management system-representation of synchronization mechanisms (1983) (1)
An improvement to GMD-like decoding algorithms (2000) (1)
Two hybrid ARQ error control schemes for near Earth satellite communications (1986) (1)
The Optimal Sectionalized Trellises for the Generalized Version of Viterbi Algorithm of Linear Block Codes and Its Application to Reed-Muller Codes (2000) (1)
Analysis of Aliasing Probability for MISRs by Using Complete Weight Distributions (1995) (1)
Minimizing the Number of States in a Sequential Machine with Don't Care Conditions (1971) (1)
Computation Complexity for Computing Sufficient Conditions on the Optimality of a Decoded Codeword (1998) (1)
Adaptive Recursive Maximum Likelihood Decoding Based on the Coarsest Parallel Concatenation Decomposition : Evaluation of the Decoding Complexity by Simulation (2003) (1)
On error performance analysis of closest coset decoding (1994) (1)
A test pattern selection method for a joint bounded-distance and encoding-based decoding algorithm of binary codes [Transactions Letters] (2010) (1)
Recognition of Parallel Multiple Context-Free Grammars and Finite State Translation Systems (1)
A System for Deciding the Security of Cryptographic Protocols (Special Section on Cryptography and Information Security) (1993) (1)
ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA. (1975) (1)
Recursive maximum likelihood decoder for high-speed satellite communication (1999) (1)
On Recursive Maximum Likelihood Decoding algorithms for Linear Codes (2001) (1)
RNA Structure Prediction Including Pseudoknots Based on Stochastic Multiple Context-Free Grammar (2006) (1)
On the binary images of (8, 5) shortened cyclic codes over GF(2/sup 8/) (2001) (1)
A Recursive Maximum Likelihood Decoding (1998) (1)
SOME CODES WHICH ARE INVARIENT UNDER A DOUBLY-TRANSITIVE PERMUTATION GROUP AND THEIR CONNECTION WITH BALANCED INCOMPLETE BLOCK DESIGNS (1966) (1)
Multilevel block coded 8-PSK modulation using unequal error protection codes for Rayleigh fading channels (1995) (1)
A Translation Method from Natural Language Specifications of Communication Protocols into Algebraic Specifications Using Contextual Dependencies (1993) (1)
Upper and lower bounds on the undetected error probability of binary codes derived from shortened Reed-Solomon codes (1992) (0)
Permanence analysis of a concatenated coding scheme for error control (1983) (0)
On binary images of shortened cyclic (8, 5) codes over GF(2/sup 8/) (2004) (0)
Libraries in the Time of Multimedia Age - Digital Libraries--Digital Library at the Nara Institute of Science and Technology (1997) (0)
A Polynomial-Time Recognizable Subclass of Lexical-Functional Grammars (1994) (0)
Structural Analysis of Minimum Weight Codewords of the Extended (32, 21, 6) and (64, 45, 8) BCH Codes Using Invariance Property(HISC2006) (2006) (0)
ERROR ANALYSIS PARSING FOR CONTEXT-FREE LANGUAGES. (1966) (0)
Optimizing universal queries in relational databases (1991) (0)
A Watermarking System with Two Servers which can Detect Server's Corruption (1998) (0)
Evaluation method for the testing conditions of the h-Chase decoding (2001) (0)
Multi-stage decoding of multi-level modulation codes (1991) (0)
On a reduced complexity soft-input and output iterative decoding algorithm for product codes(HISC2006) (2006) (0)
Performance Analysis for Binary Image of Linear Block Codes over an Extended Field of GF(2) (2005) (0)
Performance analysis of disk allocation methods for cartesian product files by using error-correcting codes (1992) (0)
Soft-Input Soft-Output Decoding Algorithm Using a Structure of the Set of Minimum Weight Codewords of Reed-Muller Codes with Simulation Results (2004) (0)
A Selection Method of Search Centers in Iteration of Bounded-distance Decodings (2001) (0)
A new evaluation method of a block error probability of a block modulation code over an AWGN channel (1997) (0)
Trellis Representation of Linear Block Codes (1998) (0)
ISIT'00 Shannon Lecture: Soft-Decision Recursive Decoding for Binary Linear Block Codes* (2000) (0)
A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes (2009) (0)
Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol (1989) (0)
Parallel Decomposition and Low-Weight Subtrellises (1998) (0)
Recursive MAP Algorithm (1996) (0)
A cascaded error control coding scheme for space and satellite communication (1986) (0)
COMPLEXITIES OF DECISION PROBLEMS FOR EQUIVALENCE AND SIMPLIFICATION OF SAFE PETRI NETS. (1980) (0)
An Improved Method for Formal Security Verification of Cryptographic Protocols (1996) (0)
User authentication with the help of simple memory devices (1997) (0)
AFCRL-70-0655 A STUDY OF PROBLEMS IN INFORMATION PROCESSING (0)
A phase connection method for communication protocols (1996) (0)
A Recursive Log-MAP Algorithm for Binary Linear Block Codes (2007) (0)
Trellises for Convolutional Codes and their Related Linear Block Codes (1998) (0)
Implementation of natural language specifications of communication protocols by executable specifications (1994) (0)
Soft-Input Soft-Output Decoding Algorithm Based on Iterative Minimum Distance Search for Reed-Muller Codes (2003) (0)
An O(n) algorithm for computing the set of available expressions of D-charts (1976) (0)
An Evaluation Method of the Block Error Probability by Using a Low-Weight Sub-Trellis Diagram (1997) (0)
A Watermarking System that Prevents Server's Corruption with Small Communication Cost (1997) (0)
A New Iterative Soft-Decision Decoding Algorithm Using List Decoding of Minimum Weight Sub-trellis Search (2001) (0)
Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm (2004) (0)
Assignment of Data Types to Words in a Natural Language Specification (1996) (0)
The structure of the set of minimum weight codewords of the extended (32,21,6) and (64,45,8) BCH codes (2005) (0)
An interleaved error control coding scheme for satellite and space communications (1987) (0)
Reduced Complexity Iterative Decoding Using a Sub-Optimum Minimum Distance Search (2003) (0)
Analysis of a Disk Operating System (プログラムの基礎理論) (1973) (0)
Decision problem concerning security for cryptographic protocols (1987) (0)
A Concatenated Coded Modulation Scheme (2003) (0)
A Soft-input and output Iterative Decoding Algorithm for Product Codes (2005) (0)
One sufficient termination condition for some iterative soft-decision algorithms decoding binary linear block codes (1997) (0)
On equivalence of safe Petri nets (1979) (0)
The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin (1997) (0)
Syntactic Unification Problems under Constrained Substitutions (1997) (0)
A Note on Inadequacy of the Model for Learning from Queries (1994) (0)
Security Verification of Real-Time Cryptographic Protocols Using a Rewriting Approach (1998) (0)
The Map and Related Decoding Algorithms (1998) (0)
A Verification System for Communication Protocols and Its Application to the OSI Session Protocol (1990) (0)
State Labeling, Trellis Construction Procedures and Trellis Symmetry (1998) (0)
Program Schemas with Tree Data Structures (アルゴリズムにおける証明論) (1975) (0)
Selecting the Search Centers of h-Chase Decoding Algorithms by Simulation (2001) (0)
DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMS. (1980) (0)
An Algebraic Method For Verifying Progress Property of Communication Protocols (1988) (0)
Methods for Constructing Codes and Trellises (1998) (0)
Verification of progress property of algebraically specified communication protocols (1987) (0)
Evaluation of block error probability of trellis codes (1995) (0)
A Study of Problems in Information Processing (1970) (0)
Suboptimum decoding of block codes (1991) (0)
On Operational Semantics of Congruence Relation Defined in Algebraic Language ASL/ (1988) (0)
An efficient MAP decoding algorithm using a section trellis diagram (1999) (0)

This paper list is powered by the following services:

Other Resources About Tadao Kasami

en.wikipedia.org

What Schools Are Affiliated With Tadao Kasami?

Tadao Kasami is affiliated with the following schools:

Tadao Kasami's Academic­Influence.com Rankings