Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
CYK algorithmClaude E. Shannon AwardElectrical engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Continuous-wave Terahertz Spectroscopy System Based on Photodiodes
Photodiodes have been commonly used for generation of continuous terahertz (THz) waves. In this paper, we proposed the use of… 
2010
2010
Performance Improvement of IM-DD Free Space Optical CDMA (Attenuated by Strong Atmospheric Turbulence) with Maximal Ratio Combining
In this paper a completely new analytical approach to the performance evaluation of turbulence induced fading on free space… 
2010
2010
A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
2008
2008
Monomial bent functions and Stickelberger's theorem
Highly Cited
2005
Highly Cited
2005
Generalized Kasami Sequences: The Large Set
In this correspondence, new binary sequence families F<sup>k</sup> of period 2<sup>n</sup>-1 are constructed for even n and any k… 
1994
1994
Biosignal pattern recognition and interpretation systems. 3. Methods of classification
The following topics are discussed: Bayes/minimum distance classifiers; maximum likelihood classification estimation; k-nearest… 
Highly Cited
1991
Highly Cited
1991
Prime-phase sequences with periodic correlation properties better than binary sequences
For the case where p is an odd prime, n>or=2 is an integer, and omega is a complex primitive pth root of unity, a construction is… 
1991
1991
Performance Of An Asynchronous DS/SSMA (DS/CDMA) System With Kronecker Sequences
A Kronecker sequence is constructed by sequence-inversion keying of an inner component sequence with an outer component code… 
1983
1983
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
We relate coding for the two-user multiple-access binary adder channel to a problem in graph theory, known as the independent set… 
Highly Cited
1970
Highly Cited
1970
On cyclic codes that are invariant under the general linear group
Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic q -ary codes to be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)