Tadao Kasami

According to our database1, Tadao Kasami
  • authored at least 117 papers between 1961 and 2010.
  • has a "Dijkstra number"2 of four.

Awards

IEEE Fellow

IEEE Fellow 1975, "".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
A test pattern selection method for a joint bounded-distance and encoding-based decoding algorithm of binary codes [Transactions Letters].
IEEE Trans. Communications, 2010

2009
A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes.
IEICE Transactions, 2009

2007
Local Weight Distribution of the (256, 93) Third-Order Binary Reed-Muller Code.
IEICE Transactions, 2007

2006
Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes.
IEICE Transactions, 2006

Stochastic Multiple Context-Free Grammar for RNA Pseudoknot Modeling.
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, 2006

2005
On the Generative Power of Grammars for RNA Secondary Structure.
IEICE Transactions, 2005

2004
On binary images of shortened cyclic (8, 5) codes over GF(28).
IEEE Communications Letters, 2004

2002
Asymptotic optimality of the GMD and chase decoding algorithms.
IEEE Trans. Information Theory, 2002

On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes.
Proceedings of the Global Telecommunications Conference, 2002

2001
On the binary images of (8, 5) shortened cyclic codes over GF(28).
Proceedings of the Global Telecommunications Conference, 2001

Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms.
Proceedings of the Applied Algebra, 2001

1999
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity.
IEEE Trans. Information Theory, 1999

A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes.
IEEE Trans. Information Theory, 1999

Recursive maximum likelihood decoder for high-speed satellite communication.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity.
Proceedings of the Applied Algebra, 1999

On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms.
Proceedings of the Applied Algebra, 1999

1998
A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes.
IEEE Trans. Information Theory, 1998

On block-coded modulation using unequal error protection codes over Rayleigh-fading channels.
IEEE Trans. Communications, 1998

1997
Soft-decision decoding of binary linear block codes based on an iterative search algorithm.
IEEE Trans. Information Theory, 1997

The weight distributions of extended binary primitive BCH codes of length 128.
IEEE Trans. Information Theory, 1997

On bit-error probability of a concatenated coding scheme.
IEEE Trans. Communications, 1997

Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
J. Symb. Comput., 1997

A secure code for recipient watermarking against conspiracy attacks by all users.
Proceedings of the Information and Communication Security, First International Conference, 1997

The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin.
Proceedings of the Applied Algebra, 1997

1996
The weight distribution of the third-order Reed-Muller code of length 512.
IEEE Trans. Information Theory, 1996

A phase connection method for communication protocols.
Systems and Computers in Japan, 1996

1995
On the Maximum Value of Aliasing Probabilities for Single Input Signature Registers.
IEEE Trans. Computers, 1995

1994
Suboptimum decoding of decomposable block codes.
IEEE Trans. Information Theory, 1994

An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codes.
IEEE Trans. Communications, 1994

The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
Computational Intelligence, 1994

Solving a Unification Problem under Constrained Substitutions Using Tree Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1993
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis.
IEEE Trans. Information Theory, 1993

On complexity of trellis structure of linear block codes.
IEEE Trans. Information Theory, 1993

On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes.
IEEE Trans. Information Theory, 1993

On the maximum value of aliasing probabilities for single input signature registers.
Proceedings of the 11th IEEE VLSI Test Symposium (VTS'93), 1993

A translation method from natural language specifications into formal specifications using contextual dependencies.
Proceedings of IEEE International Symposium on Requirements Engineering, 1993

Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars.
Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, 1993

1992
A method for translating natural language program specifications into algebraic specifications.
Systems and Computers in Japan, 1992

A defect-tolerant design for mask ROMs.
Proceedings of the 10th IEEE VLSI Test Symposium (VTS'92), 1992

A Verification Procedure via Invariant for Extended Communicating Finite-State Machines.
Proceedings of the Computer Aided Verification, Fourth International Workshop, 1992

1991
On multilevel block modulation codes.
IEEE Trans. Information Theory, 1991

On linear structure and phase rotation invariant properties of block M-PSK modulation codes.
IEEE Trans. Information Theory, 1991

On the monotonic property of the probability of undetected error for a shortened code.
IEEE Trans. Information Theory, 1991

Performance analysis of disk allocation method using error-correcting codes.
IEEE Trans. Information Theory, 1991

On Multiple Context-Free Grammars.
Theor. Comput. Sci., 1991

The generative power of multiple context-free grammars and head grammars.
Systems and Computers in Japan, 1991

Optimizing universal queries in relational databases.
Systems and Computers in Japan, 1991

1990
An error control system with multiple-stage forward error corrections.
IEEE Trans. Communications, 1990

A concatenated coded modulation scheme for error control.
IEEE Trans. Communications, 1990

1989
Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3.
IEEE Trans. Communications, 1989

Generalized context-free grammars and multiple context-free grammars.
Systems and Computers in Japan, 1989

Membership problem for head languages and multiple context-free languages.
Systems and Computers in Japan, 1989

Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol.
Systems and Computers in Japan, 1989

1988
A cascaded coding scheme for error control and its performance analysis.
IEEE Trans. Information Theory, 1988

1987
Principles of algebraic language ASL.
Systems and Computers in Japan, 1987

Verification of progress property of algebraically specified communication protocols.
Systems and Computers in Japan, 1987

Decision problem concerning security for cryptographic protocols.
Systems and Computers in Japan, 1987

Logical Programming for the Telegram Analysis Problem.
Comput. Lang., 1987

1986
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11.
IEEE Trans. Information Theory, 1986

Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
Theor. Comput. Sci., 1986

A Concatenated Coding Scheme for Error Control.
IEEE Trans. Communications, 1986

Compiling and Optimizing Methods for the Functional Language ASL/F.
Sci. Comput. Program., 1986

1985
A Distributed Mutual Exclusion Algorithm
ACM Trans. Comput. Syst., 1985

Coding for the binary symmetric broadcast channel with two receivers.
IEEE Trans. Information Theory, 1985

An approximation to the weight distribution of binary linear codes.
IEEE Trans. Information Theory, 1985

On the Undetected Error Probability for Shortened Hamming Codes.
IEEE Trans. Communications, 1985

Some Results on the Representative Instance in Relational Databases.
SIAM J. Comput., 1985

Optimization of functional language ASL/F programs.
Systems and Computers in Japan, 1985

1984
An Algebraic Specification of HDLC Procedures and Its Verification.
IEEE Trans. Software Eng., 1984

Membership Problems for Data Dependencies in Relational Expressions.
Theor. Comput. Sci., 1984

On the Probability of Undetected Error for the Maximum Distance Separable Codes.
IEEE Trans. Communications, 1984

Functional Programming and Logical Programming for the Telegram Analysis Problem.
Proceedings of the Proceedings, 1984

1983
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel.
IEEE Trans. Information Theory, 1983

Linear block codes for error detection.
IEEE Trans. Information Theory, 1983

Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions.
Theor. Comput. Sci., 1983

Three Measures for Synchronic Dependence in Petri Nets.
Acta Inf., 1983

1982
An Optimality Theory for Mutual Exclusion Algorithms in Computer Networks.
Proceedings of the Proceedings of the 3rd International Conference on Distributed Computing Systems, 1982

1981
Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey.
IEEE Trans. Information Theory, 1981

1979
Decision Problems for Multivalued Dependencies in Relational Databases.
SIAM J. Comput., 1979

On equivalence of safe Petri nets.
FCT, 1979

1978
An error correcting scheme for defective memory.
IEEE Trans. Information Theory, 1978

Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.).
IEEE Trans. Information Theory, 1978

Bounds on the achievable rates of block coding for a memoryless multiple-access channel.
IEEE Trans. Information Theory, 1978

1977
Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets.
Theor. Comput. Sci., 1977

1976
On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes
Information and Control, April, 1976

Coding for a multiple-access channel.
IEEE Trans. Information Theory, 1976

Some Decision Problems Related to the Reachability Problem for Petri Nets.
Theor. Comput. Sci., 1976

A Result on the Equivalence Problem for Deterministic Pushdown Automata.
J. Comput. Syst. Sci., 1976

An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts.
Acta Inf., 1976

1974
Construction and decomposition of cyclic codes of composite length (Corresp.).
IEEE Trans. Information Theory, 1974

A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.).
IEEE Trans. Information Theory, 1974

Ianov Schemas Augmented by a Pushdown Memory
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973
On the Capabilities of While, Repeat, and Exit Statements.
Commun. ACM, 1973

1972
Some results on the minimum weight of primitive BCH codes (Corresp.).
IEEE Trans. Information Theory, 1972

Minimal Negative Gate Networks.
IEEE Trans. Computers, 1972

1971
The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes
Information and Control, May, 1971

Weight distribution of (128, 64) Reed-Muller code (Corresp.).
IEEE Trans. Information Theory, 1971

On the construction of a class of majority-logic decodable codes.
IEEE Trans. Information Theory, 1971

On majority-logic decoding for duals of primitive polynomial codes.
IEEE Trans. Information Theory, 1971

Failsafe Logic Nets.
IEEE Trans. Computers, 1971

1970
Reduction of Context-Free Grammars
Information and Control, August, 1970

On the weight structure of Reed-Muller codes.
IEEE Trans. Information Theory, 1970

1969
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine
Information and Control, March, 1969

Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes.
IEEE Trans. Information Theory, 1969

An upper bound on k/n for affine-invariant codes with fixed d/n (Corresp.).
IEEE Trans. Information Theory, 1969

A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars.
J. ACM, 1969

1968
Polynomial codes.
IEEE Trans. Information Theory, 1968

New generalizations of the Reed-Muller codes-I: Primitive codes.
IEEE Trans. Information Theory, 1968

Some lower bounds on the minimum weight of cyclic codes of composite length.
IEEE Trans. Information Theory, 1968

Error-correcting codes for a compound channel.
IEEE Trans. Information Theory, 1968

1967
A Note on Computing Time for Recognition of Languages Generated by Linear Grammars
Information and Control, February, 1967

A search procedure for finding optimum group codes for the binary symmetric channel.
IEEE Trans. Information Theory, 1967

Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application
Information and Control, 1967

1964
Some efficient shortened cyclic codes for burst-error correction (Corresp.).
IEEE Trans. Information Theory, 1964

A decoding procedure for multiple-error-correcting cyclic codes.
IEEE Trans. Information Theory, 1964

1963
Optimum shortened cyclic codes for burst-error correction.
IEEE Trans. Information Theory, 1963

1961
Optimum linear finite-dimensional estimator of signal waveforms.
IRE Trans. Information Theory, 1961


  Loading...