( en | de | ru )

 

Disambiguation of "Kasami, Tadao"

Author of the publication

copydeleteadd this publication to your clipboard
A concatenated coded modulation scheme for error control.

, , , and . IEEE Trans. Commun., 38 (6): 752-763 (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tadao Johannes Araki

 

Other publications of authors with the same name

On the Capabilities of While, Repeat, and Exit Statements., , and . Commun. ACM, 16 (8): 503-512 (1973)An upper bound on the effective error coefficient of two-stage decoding, and good two-level decompositions of some Reed-Muller codes., , , , and . IEEE Trans. Commun., 42 (234): 813-818 (1994)Some results on the minimum weight of primitive BCH codes (Corresp.)., and . IEEE Trans. Inf. Theory, 18 (6): 824-825 (1972)On majority-logic decoding for duals of primitive polynomial codes., and . IEEE Trans. Inf. Theory, 17 (3): 322-331 (1971)An approximation to the weight distribution of binary linear codes., , and . IEEE Trans. Inf. Theory, 31 (6): 769-780 (1985)Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel., , , and . IEEE Trans. Inf. Theory, 29 (1): 114-130 (1983)On complexity of trellis structure of linear block codes., , , and . IEEE Trans. Inf. Theory, 39 (3): 1057-1064 (1993)Bounds on the achievable rates of block coding for a memoryless multiple-access channel., and . IEEE Trans. Inf. Theory, 24 (2): 187-197 (1978)On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes., , , and . IEEE Trans. Inf. Theory, 39 (1): 242-245 (1993)Linear block codes for error detection., , and . IEEE Trans. Inf. Theory, 29 (1): 131-136 (1983)