Search the dblp DataBase

Publications of Author

1. Shojiro Sakata
   On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes. [Citation Graph (0, 0)][DBLP]
   AAECC, 2001, pp:172-181 [Conf]
   
2. Shojiro Sakata
   Synthesis of Two-Dimensional Linear Feedback Shift Registers and Groebner Bases. [Citation Graph (0, 0)][DBLP]
   AAECC, 1987, pp:394-407 [Conf]
   
3. Shojiro Sakata
   N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros. [Citation Graph (0, 0)][DBLP]
   AAECC, 1988, pp:356-376 [Conf]
   
4. Shojiro Sakata
   A Gröbner Basis and a Minimal Polynominal Set of a Finite nD Array. [Citation Graph (0, 0)][DBLP]
   AAECC, 1990, pp:280-291 [Conf]
   
5. Shojiro Sakata
   Finding a Minimal Polynomial Vector Set of a Vector of nD Arrays. [Citation Graph (0, 0)][DBLP]
   AAECC, 1991, pp:414-425 [Conf]
   
6. Shojiro Sakata
   A Vector Version of the BMS Algorithm for Implementing Fast Erasure-and-Error Decoding of One-Point AG Codes. [Citation Graph (0, 0)][DBLP]
   AAECC, 1997, pp:291-310 [Conf]
   
7. Shojiro Sakata, Masazumi Kurihara
   A Fast Parallel Implementation of the Berlekamp-Massey Algorithm with a One-D Systolic Array Architecture. [Citation Graph (0, 0)][DBLP]
   AAECC, 1995, pp:415-426 [Conf]
   
8. Shojiro Sakata, Masazumi Kurihara
   A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It. [Citation Graph (0, 0)][DBLP]
   AAECC, 1999, pp:302-313 [Conf]
   
9. Shojiro Sakata
   Extension of the Berlekamp-Massey Algorithm to N Dimensions [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1990, v:84, n:2, pp:207-239 [Journal]
   
10. Shojiro Sakata
    Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1988, v:5, n:3, pp:321-337 [Journal]
    
11. Shojiro Sakata
    On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:5, pp:556-564 [Journal]
    
12. Shojiro Sakata
    Cycle representatives of quasi-irreducible two-dimensional cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:4, pp:871-0 [Journal]
    
13. Shojiro Sakata
    Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1200-0 [Journal]
    
14. Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt
    Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1762-1772 [Journal]
    
15. Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt
    Fast decoding of algebraic-geometric codes up to the designed minimum distance. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1672-1677 [Journal]
    
16. Shojiro Sakata, Douglas A. Leonard, Helge Elbrønd Jensen, Tom Høholdt
    Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1558-1564 [Journal]
    
17. 
    Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring. [Citation Graph (, )][DBLP]