Tadao Kasami

Known as: Kasami, Kasami Tadao, Tadao 
Tadao Kasami (嵩 忠雄 Kasami Tadao, April 12, 1930 – March 18, 2007) was a noted Japanese information theorist who made significant contributions to… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Tadao Nagatsuma , Akira Kaino, Shintaro Hisatake, Katsuhiro Ajito, Ho-Jin Song, Atsushi Wakatsuki, Yoshifumi Muramoto, Naoya… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
The binary primitive triple-error-correcting BCH code is a cyclic code of minimum distance d = 7 with generator polynomial having… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
With the introduction of UML 2.0, many improvements to diagrams have been incorporated into the language. Some of the major… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A transmitter identification system for DTV distributed transmission network using embedded pseudo random sequences is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this correspondence, for a positive integer , new families and of binary sequences of period2 1 with low correlations are… (More)
  • table I
Is this relevant?
2001
2001
BACKGROUND Expression of the VLDL receptor, primarily in macrophages, has been confirmed in human and rabbit atherosclerotic… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
1995
1995
Given a string w and a pattern p, approximate pattern matching merges traditional sequence comparison and pattern matching by… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1980
Highly Cited
1980
A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1970
Highly Cited
1970
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 5
Is this relevant?