Learn More
This paper describes an algorithm to improve a computational cost for estimation using the Kriging method with a large number of sampling data. An improved formula to compute the weighting coefficient for Kriging estimation is proposed. The Sherman–Morrison–Woodbury formula is applied to solving an approximated simultaneous equation to determine a weighting(More)
Recently, Nishijima-Gell-Mann's rule 1 l for the systematization of new particles has achieved a great success to account for various facts obtained from the experiments with cosmic rays and with high energy accelerators. Nevertheless, it would be desirable from the theoretical standpoint * The content of this letter was read before the annual meeting of(More)
We construct a two-dimensional systolic array implementing the Berlekamp-Massey-Sakata (BMS) algorithm to provide error-locator polynomials for codes on selected algebraic curves. This array is constructed by introducing some new polynomials in order to increase the parallelism of the algorithm. The introduced polynomials are used in the majority logic(More)
In this paper, we propose a class of regular LDPC codes from a cyclic difference family, which is a kind of combinatorial design. These LDPC codes have no 4-cycles, i.e., cycles of length 4. We clarify the conditions on which these codes with column weight 3 have no 6-cycles and discuss their minimum distance. Finally, we show the performance of the(More)
The Geography Markup Language (GML) has been introduced to standardize the representation of geographical data in Extensible Markup Language (XML), which makes the exchanging and sharing of geographical information easier. As GML becomes the geospatial language of the Web, the compression of GML files becomes a new challenge to the compression research(More)
  • S. Sakata
  • 2005
We present a simple modification of the Berlekamp-Massey (BM) algorithm by which one can solve the problem solved by the 'multiple-sequence BM algorithm' [Feng and Tzeng, IEEE IT Trans. 1989, 1991]. The original BM algorithm which we call 'single-sequence BM algorithm' finds a simplest linear feedback shift register (LFSR) capable of generating a given(More)
I would first like to thank the Royal Swedish Academy of Sciences and the Nobel Foundation for awarding me this honour, of which I had never even dreamt. I was born in 1940, the son of a furniture craftsman in the city of Nagoya, in Japan. My father wanted to change his job and was taking a correspondence course to become an electrical engineer, while he(More)