Shojiro Sakata

Masaya Fujisawa, Shojiro Sakata: Improved multipoint codes from Hermitian curves. ISITA 2012: 431-435

Masaya Fujisawa, Shojiro Sakata: On a fast decoding of multipoint codes from algebraic curves. ISIT 2011: 1022-1026

Shojiro Sakata, Masaya Fujisawa: Can the BMS Algorithm Decode Up to [/d_g-g-1)/2] Errors? Yes, but with Some Additional Remarks. IEICE Transactions 93-A(4): 857-862 (2010)

Masaya Fujisawa, Shojiro Sakata: A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8. IEICE Transactions 90-A(5): 1055-1061 (2007)

Shojiro Sakata: On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes. AAECC 2001: 172-181

Shojiro Sakata, Masazumi Kurihara: A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It. AAECC 1999: 302-313

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. IEEE Transactions on Information Theory 44(4): 1558-1564 (1998)

Shojiro Sakata: A Vector Version of the BMS Algorithm for Implementing Fast Erasure-and-Error Decoding of One-Point AG Codes. AAECC 1997: 291-310

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. IEEE Transactions on Information Theory 41(6): 1672-1677 (1995)

Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt: Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. IEEE Transactions on Information Theory 41(6): 1762-1772 (1995)

Shojiro Sakata, Masazumi Kurihara: A Fast Parallel Implementation of the Berlekamp-Massey Algorithm with a One-D Systolic Array Architecture. AAECC 1995: 415-426

Shojiro Sakata: Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring. Discrete Applied Mathematics 33(1-3): 191-203 (1991)

Shojiro Sakata: Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm. IEEE Transactions on Information Theory 37(4): 1200-1203 (1991)

Shojiro Sakata: Finding a Minimal Polynomial Vector Set of a Vector of nD Arrays. AAECC 1991: 414-425

Shojiro Sakata (Ed.): Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24, 1990, Proceedings. Lecture Notes in Computer Science 508, Springer 1991, isbn 3-540-54195-0

Shojiro Sakata: Extension of the Berlekamp-Massey Algorithm to N Dimensions. Inf. Comput. 84(2): 207-239 (1990)

Shojiro Sakata: A Gröbner Basis and a Minimal Polynominal Set of a Finite nD Array. AAECC 1990: 280-291

Shojiro Sakata: Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array. J. Symb. Comput. 5(3): 321-337 (1988)

Shojiro Sakata: Cycle representatives of quasi-irreducible two-dimensional cyclic codes. IEEE Transactions on Information Theory 34(4): 871-875 (1988)

Shojiro Sakata: N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros. AAECC 1988: 356-376

Hiroyoshi Morita, Kaanyasn Yajima, Shojiro Sakata: Reconstruction Of Surfaces Of 3-D Objects By M-array Pattern Projection Method. ICCV 1988: 468-473

Shojiro Sakata: Synthesis of Two-Dimensional Linear Feedback Shift Registers and Groebner Bases. AAECC 1987: 394-407

Shojiro Sakata: On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals. IEEE Transactions on Information Theory 27(5): 556-564 (1981)