#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1978

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Shojiro Sakata
- J. Symb. Comput.
- 1988

We present an algorithm for finding a minimal set of two-dimensional linear recurring relations capable of generating a prescribed finite two-dimensional array. This is a twodimensional extension of the Berlekamp-Massey algorithm for synthesizing a shortest linear feedback shift-register capable of generating a given finite sequence. The complexity of… (More)

- Shojiro Sakata
- Inf. Comput.
- 1990

- Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt
- IEEE Trans. Information Theory
- 1995

E FFICIENT decoding of BCHand Reed-Solomon codes can be done by using the Berlekamp-Massey algorithm [ 11, and it is natural to try to use the extension to N dimensions of Sakata [2] to decode algebraic-geometric codes. For codes from regular plane curves this was done in [3] and using the Feng-Rao majority scheme from [4], the procedure was extended in [S]… (More)

- Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt
- IEEE Trans. Information Theory
- 1995

We present a decoding algorithm for algebraicgeometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patternes of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme of Feng and Rao and uses a modified version of Sakata’s generalization of the Berlekamp-Massey algorithm.

- Shojiro Sakata
- AAECC
- 2001

- Shojiro Sakata
- AAECC
- 1997

- Shojiro Sakata, Masazumi Kurihara
- AAECC
- 1999

Since before we have proposed a systolic array architecture for implementing fast decoding algorithm of one point AG codes. In this paper we propose a revised architecture which is as its main framework a one-dimensional systolic array, in details, composed of a threedimensional arrangement of processing units called cells, and present a method of complete… (More)

- Hiroyoshi Morita, Kaanyasn Yajima, Shojiro Sakata
- ICCV
- 1988

- Shojiro Sakata
- IEEE Trans. Information Theory
- 1981

- Shojiro Sakata, Masaya Fujisawa
- IEEE Transactions on Information Theory
- 2014

Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions, which have multiple poles and/or zeros on an algebraic curve. Thus, they are more general than one-point codes, which are an important class of algebraic geometry codes in the sense that they can be decoded efficiently using the Berlekamp-Massey-Sakata… (More)