Tadao Kasami

From MaRDI portal
Person:1060027

Available identifiers

zbMath Open kasami.tadaoMaRDI QIDQ1060027

List of research outcomes

PublicationDate of PublicationType
Asymptotic optimality of the GMD and Chase decoding algorithms2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q31548522005-01-14Paper
https://portal.mardi4nfdi.de/entity/Q31548762005-01-14Paper
https://portal.mardi4nfdi.de/entity/Q44742692004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44704712004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44705112004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45026272002-06-02Paper
https://portal.mardi4nfdi.de/entity/Q45026102002-03-18Paper
Constructions of generalized concatenated codes and their trellis-based decoding complexity1999-11-21Paper
A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q43999361998-07-30Paper
Soft-decision decoding of binary linear block codes based on an iterative search algorithm1998-03-22Paper
https://portal.mardi4nfdi.de/entity/Q43736541998-02-16Paper
The weight distributions of extended binary primitive BCH codes of length 1281998-01-08Paper
https://portal.mardi4nfdi.de/entity/Q43655221998-01-08Paper
https://portal.mardi4nfdi.de/entity/Q43655231998-01-08Paper
On bit-error probability of a concatenated coding scheme1997-10-28Paper
Solving a unification problem under constrained substitutions using tree automata1997-05-28Paper
The weight distribution of the third-order Reed-Muller code of length 5121996-10-22Paper
Suboptimum decoding of decomposable block codes1995-03-01Paper
On the maximum value of aliasing probabilities for single input signature registers1995-01-01Paper
Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis1994-10-04Paper
On complexity of trellis structure of linear block codes1994-02-07Paper
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes1993-05-16Paper
On multiple context-free grammars1992-06-26Paper
On the monotonic property of the probability of undetected error for a shortened code1992-06-26Paper
On linear structure and phase rotation invariant properties of block M-PSK modulation codes1991-01-01Paper
Performance analysis of disk allocation method using error-correcting codes1991-01-01Paper
On multilevel block modulation codes1991-01-01Paper
The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3)1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37894771987-01-01Paper
Compiling and optimizing methods for the functional language ASL/F1986-01-01Paper
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11 (Corresp.)1986-01-01Paper
Coding for the binary symmetric broadcast channel with two receivers1985-01-01Paper
An approximation to the weight distribution of binary linear codes1985-01-01Paper
Some Results on the Representative Instance in Relational Databases1985-01-01Paper
Membership problems for data dependencies in relational expressions1984-01-01Paper
On the Probability of Undetected Error for the Maximum Distance Separable Codes1984-01-01Paper
Three measures for synchronic dependence in Petri nets1983-01-01Paper
Membership problem for embedded multivalued dependencies under some restricted conditions1983-01-01Paper
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel1983-01-01Paper
Linear block codes for error detection (Corresp.)1983-01-01Paper
Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38516341979-01-01Paper
Decision Problems for Multivalued Dependencies in Relational Databases1979-01-01Paper
Bounds on the achievable rates of block coding for a memoryless multiple-access channel1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41631201978-01-01Paper
An error correcting scheme for defective memory1978-01-01Paper
Some decision problems related to the reachability problem for Petri nets1977-01-01Paper
Decidable problems on the strong connectivity of Petri net reachability sets1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41370821977-01-01Paper
An \(O(n)\) algorithm for computing the set of available expressions of D-charts1976-01-01Paper
A result on the equivalence problem for deterministic pushdown automata1976-01-01Paper
Coding for a multiple-access channel1976-01-01Paper
On the weight enumeration of weights less than 2.5d of Reed—Muller codes1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40992091975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41517131975-01-01Paper
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)1974-01-01Paper
Construction and decomposition of cyclic codes of composite length (Corresp.)1974-01-01Paper
On the capabilities of while, repeat, and exit statements1973-01-01Paper
Minimal Negative Gate Networks1972-01-01Paper
Some results on the minimum weight of primitive BCH codes (Corresp.)1972-01-01Paper
The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes1971-01-01Paper
On majority-logic decoding for duals of primitive polynomial codes1971-01-01Paper
On the construction of a class of majority-logic decodable codes1971-01-01Paper
Erratum “Optimal Sequencing of Two Equivalent Processors”1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56424831971-01-01Paper
On the weight structure of Reed-Muller codes1970-01-01Paper
Reduction of context-free grammars1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56336631970-01-01Paper
An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)1969-01-01Paper
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes1969-01-01Paper
A note on computing time for the recognition of context-free languages by a single-tape Turing machine1969-01-01Paper
Optimal Sequencing of Two Equivalent Processors1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56129881969-01-01Paper
Error-correcting codes for a compound channel1968-01-01Paper
On the Coding of the Path in a Graph and Some Applications1968-01-01Paper
New generalizations of the Reed-Muller codes--I: Primitive codes1968-01-01Paper
Some lower bounds on the minimum weight of cyclic codes of composite length1968-01-01Paper
Polynomial codes1968-01-01Paper
A note on computing time for recognition of languages generated by linear grammars1967-01-01Paper
Some results on cyclic codes which are invariant under the affine group and their applications1967-01-01Paper
A decoding procedure for multiple-error-correcting cyclic codes1964-01-01Paper
Optimum shortened cyclic codes for burst-error correction1963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32841811961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53385811961-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57375191961-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tadao Kasami