Tadao Kasami
Affiliations:- Nara Institute of Science and Technology, Japan
According to our database1,
Tadao Kasami
authored at least 125 papers
between 1961 and 2010.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 1975, "".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on id.loc.gov
-
on dl.acm.org
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. Commun., 2010
2009
A Soft-Input and Output Iterative Bounded-Distance and Encoding-Based Decoding Algorithm for Product Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
2007
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
2006
Selection of Test Patterns in an Iterative Erasure and Error Decoding Algorithm for Non-binary Block Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms, 2006
2005
IEICE Trans. Inf. Syst., 2005
2004
IEEE Commun. Lett., 2004
Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, 2004
Soft-input soft-output decoding algorithm of linear block codes based on minimum distance search.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
Selection Method of Test Patterns in Soft-Decision Iterative Bounded Distance Decoding Algorithms.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
2002
IEEE Trans. Inf. Theory, 2002
A Soft-Decision Iterative Decoding Algorithm Using a Top-Down and Recursive Minimum Distance Search.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002
Proceedings of the 2002 IEEE Information Theory Workshop, 2002
On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes.
Proceedings of the Global Telecommunications Conference, 2002
2001
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. Inf. Theory, 1999
A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes.
IEEE Trans. Inf. Theory, 1999
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. Inf. Theory, 1998
On block-coded modulation using unequal error protection codes over Rayleigh-fading channels.
IEEE Trans. Commun., 1998
1997
Soft-decision decoding of binary linear block codes based on an iterative search algorithm.
IEEE Trans. Inf. Theory, 1997
IEEE Trans. Inf. Theory, 1997
J. Symb. Comput., 1997
Proceedings of the Information and Communication Security, First International Conference, 1997
The Split Weight (<i>w<sub>L</sub>, w<sub>R</sub></i>) Enumeration of Reed-Muller Codes for <i>w<sub>L</sub></i> + <i>w<sub>R</sub></i> < 2<i>d<sub>min</sub></i>.
Proceedings of the Applied Algebra, 1997
1996
IEEE Trans. Inf. Theory, 1996
1995
IEEE Trans. Computers, 1995
Multilevel block coded 8-PSK modulations using unequal error protection codes for the Rayleigh fading channel.
Proceedings of the 6th IEEE International Symposium on Personal, 1995
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. Commun., 1994
The Computational Complexity of the Universal Recognition Problem for Parallel Multiple Context-Free Grammars.
Comput. Intell., 1994
1993
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis.
IEEE Trans. Inf. Theory, 1993
IEEE Trans. Inf. Theory, 1993
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes.
IEEE Trans. Inf. Theory, 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.
Syst. Comput. Jpn., 1992
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
Proceedings of the Software Science and Engineering: Selected Papers from the Kyoto Symposia, 1991
Proceedings of the Software Science and Engineering: Selected Papers from the Kyoto Symposia, 1991
On linear structure and phase rotation invariant properties of block M-PSK modulation codes.
IEEE Trans. Inf. Theory, 1991
On the monotonic property of the probability of undetected error for a shortened code.
IEEE Trans. Inf. Theory, 1991
IEEE Trans. Inf. Theory, 1991
Syst. Comput. Jpn., 1991
1990
IEEE Trans. Commun., 1990
1989
Error detecting capabilities of the shortened Hamming codes adopted for error detection in IEEE Standard 802.3.
IEEE Trans. Commun., 1989
Syst. Comput. Jpn., 1989
Syst. Comput. Jpn., 1989
Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol.
Syst. Comput. Jpn., 1989
1988
IEEE Trans. Inf. Theory, 1988
1987
Verification of progress property of algebraically specified communication protocols.
Syst. Comput. Jpn., 1987
Syst. Comput. Jpn., 1987
1986
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11.
IEEE Trans. Inf. Theory, 1986
Specification and Verification of Decentralized Daisy Chain Arbiters with omega-Extended Regular Expressions.
Theor. Comput. Sci., 1986
Sci. Comput. Program., 1986
1985
IEEE Trans. Inf. Theory, 1985
IEEE Trans. Inf. Theory, 1985
IEEE Trans. Commun., 1985
SIAM J. Comput., 1985
1984
IEEE Trans. Software Eng., 1984
Theor. Comput. Sci., 1984
IEEE Trans. Commun., 1984
Proceedings of the Proceedings, 1984
1983
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel.
IEEE Trans. Inf. Theory, 1983
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions.
Theor. Comput. Sci., 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. Inf. Theory, 1981
1980
IBM J. Res. Dev., 1980
1979
SIAM J. Comput., 1979
On equivalence of safe Petri nets.
Proceedings of the Fundamentals of Computation Theory, 1979
1978
IEEE Trans. Inf. Theory, 1978
Bounds on the achievable rates of block coding for a memoryless multiple-access channel.
IEEE Trans. Inf. Theory, 1978
1977
Theor. Comput. Sci., 1977
1976
Inf. Control., April, 1976
Theor. Comput. Sci., 1976
J. Comput. Syst. Sci., 1976
Acta Informatica, 1976
1974
IEEE Trans. Inf. Theory, 1974
IEEE Trans. Inf. Theory, 1974
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974
1973
1972
IEEE Trans. Inf. Theory, 1972
1971
The Weight Enumerators for Several Clauses of Subcodes of the 2nd Order Binary Reed-Muller Codes
Inf. Control., May, 1971
IEEE Trans. Inf. Theory, 1971
IEEE Trans. Inf. Theory, 1971
IEEE Trans. Inf. Theory, 1971
1970
1969
A Note on Computing Time for the Recognition of Context-Free Languages by a Single-Tape Turing Machine
Inf. Control., March, 1969
IEEE Trans. Inf. Theory, 1969
IEEE Trans. Inf. Theory, 1969
1968
IEEE Trans. Inf. Theory, 1968
IEEE Trans. Inf. Theory, 1968
1967
Inf. Control., February, 1967
IEEE Trans. Inf. Theory, 1967
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application
Inf. Control., 1967
1964
IEEE Trans. Inf. Theory, 1964
IEEE Trans. Inf. Theory, 1964
1963
IEEE Trans. Inf. Theory, 1963
1961
IRE Trans. Inf. Theory, 1961