Shojiro Sakata
Orcid: 0000-0002-4211-380X
According to our database1,
Shojiro Sakata
authored at least 32 papers
between 1978 and 2021.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 2002, "For contributions to the theory of multidimensional arrays and codes".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Proceedings of the IEEE Information Theory Workshop, 2021
2018
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel-Pellikaan Bound.
IEEE Trans. Inf. Theory, 2018
2014
IEEE Trans. Inf. Theory, 2014
2012
Proceedings of the International Symposium on Information Theory and its Applications, 2012
2010
Can the BMS Algorithm Decode Up to [/d<sub>g</sub>-g-1)/2] Errors? Yes, but with Some Additional Remarks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
2009
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009
2007
A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
2005
Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves.
IEEE Trans. Inf. Theory, 2005
Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
2003
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
2001
On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes.
Proceedings of the Applied Algebra, 2001
1999
A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It.
Proceedings of the Applied Algebra, 1999
1998
Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound.
IEEE Trans. Inf. Theory, 1998
1997
A Vector Version of the BMS Algorithm for Implementing Fast Erasure-and-Error Decoding of One-Point AG Codes.
Proceedings of the Applied Algebra, 1997
1995
IEEE Trans. Inf. Theory, 1995
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound.
IEEE Trans. Inf. Theory, 1995
A Fast Parallel Implementation of the Berlekamp-Massey Algorithm with a One-D Systolic Array Architecture.
Proceedings of the Applied Algebra, 1995
1991
IEEE Trans. Inf. Theory, 1991
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring.
Discret. Appl. Math., 1991
Proceedings of the Applied Algebra, 1991
1990
Inf. Comput., February, 1990
Partial realization of 2-D discrete linear system and 2-D Pade approximation and reduction of 2-D rational transfer function.
Proc. IEEE, 1990
Proceedings of the Applied Algebra, 1990
1988
IEEE Trans. Inf. Theory, 1988
Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array.
J. Symb. Comput., 1988
Proceedings of the Second International Conference on Computer Vision, 1988
N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros.
Proceedings of the Applied Algebra, 1988
1987
Proceedings of the Applied Algebra, 1987
1981
On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals.
IEEE Trans. Inf. Theory, 1981
1978
General theory of doubly periodic arrays over an arbitrary finite field and its applications.
IEEE Trans. Inf. Theory, 1978