default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShojiro Sakata
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c14]Hiroyoshi Morita, Masaya Fujisawa, Shojiro Sakata:
Two-dimensional Lee-Error-Correcting Codes on Hexagonal Signal Constellations. ITW 2021: 1-6
2010 – 2019
- 2018
- [j17]Shojiro Sakata
, Masaya Fujisawa:
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel-Pellikaan Bound. IEEE Trans. Inf. Theory 64(6): 4452-4466 (2018) - 2014
- [j16]Shojiro Sakata, Masaya Fujisawa:
Fast Decoding of Multipoint Codes from Algebraic Curves. IEEE Trans. Inf. Theory 60(4): 2054-2064 (2014) - 2012
- [c13]Masaya Fujisawa, Shojiro Sakata:
Improved multipoint codes from Hermitian curves. ISITA 2012: 431-435 - 2011
- [c12]Masaya Fujisawa, Shojiro Sakata:
On a fast decoding of multipoint codes from algebraic curves. ISIT 2011: 1022-1026 - 2010
- [j15]Shojiro Sakata, Masaya Fujisawa:
Can the BMS Algorithm Decode Up to [/dg-g-1)/2] Errors? Yes, but with Some Additional Remarks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(4): 857-862 (2010)
2000 – 2009
- 2009
- [p2]Shojiro Sakata:
The BMS Algorithm. Gröbner Bases, Coding, and Cryptography 2009: 143-163 - [p1]Shojiro Sakata:
The BMS Algorithm and Decoding of AG Codes. Gröbner Bases, Coding, and Cryptography 2009: 165-185 - [e2]Massimiliano Sala, Shojiro Sakata, Teo Mora, Carlo Traverso, Ludovic Perret:
Gröbner Bases, Coding, and Cryptography. Springer 2009, ISBN 978-3-540-93805-7 [contents] - 2007
- [j14]Masaya Fujisawa, Shojiro Sakata:
A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 1055-1061 (2007) - 2005
- [j13]Hajime Matsui, Shojiro Sakata, Masazumi Kurihara, Seiichi Mita:
Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves. IEEE Trans. Inf. Theory 51(11): 3856-3871 (2005) - [c11]Shojiro Sakata:
Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm. ISIT 2005: 1967-1971 - [c10]Masaya Fujisawa, Shojiro Sakata:
A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8. ISIT 2005: 2290-2294 - 2003
- [j12]Masaya Fujisawa, Shusuke Maeda, Shojiro Sakata:
Compound-Error-Correcting Codes and Their Augmentation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(7): 1813-1819 (2003) - 2001
- [c9]Shojiro Sakata:
On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes. AAECC 2001: 172-181
1990 – 1999
- 1999
- [c8]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 - 1998
- [j11]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 Trans. Inf. Theory 44(4): 1558-1564 (1998) - 1997
- [c7]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 - 1995
- [j10]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 Trans. Inf. Theory 41(6): 1672-1677 (1995) - [j9]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 Trans. Inf. Theory 41(6): 1762-1772 (1995) - [c6]Shojiro Sakata, Masazumi Kurihara:
A Fast Parallel Implementation of the Berlekamp-Massey Algorithm with a One-D Systolic Array Architecture. AAECC 1995: 415-426 - 1991
- [j8]Shojiro Sakata:
Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring. Discret. Appl. Math. 33(1-3): 191-203 (1991) - [j7]Shojiro Sakata:
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm. IEEE Trans. Inf. Theory 37(4): 1200-1203 (1991) - [c5]Shojiro Sakata:
Finding a Minimal Polynomial Vector Set of a Vector of nD Arrays. AAECC 1991: 414-425 - [e1]Shojiro Sakata:
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 [contents] - 1990
- [j6]Shojiro Sakata:
Extension of the Berlekamp-Massey Algorithm to N Dimensions. Inf. Comput. 84(2): 207-239 (1990) - [j5]Shojiro Sakata:
Partial realization of 2-D discrete linear system and 2-D Pade approximation and reduction of 2-D rational transfer function. Proc. IEEE 78(4): 604-613 (1990) - [c4]Shojiro Sakata:
A Gröbner Basis and a Minimal Polynominal Set of a Finite nD Array. AAECC 1990: 280-291
1980 – 1989
- 1988
- [j4]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) - [j3]Shojiro Sakata:
Cycle representatives of quasi-irreducible two-dimensional cyclic codes. IEEE Trans. Inf. Theory 34(4): 871-875 (1988) - [c3]Shojiro Sakata:
N-Dimensional Berlekamp-Massey Algorithm for Multiple Arrays and Construction of Multivariate Polynomials with Preassigned Zeros. AAECC 1988: 356-376 - [c2]Hiroyoshi Morita, Kaanyasn Yajima, Shojiro Sakata:
Reconstruction Of Surfaces Of 3-D Objects By M-array Pattern Projection Method. ICCV 1988: 468-473 - 1987
- [c1]Shojiro Sakata:
Synthesis of Two-Dimensional Linear Feedback Shift Registers and Groebner Bases. AAECC 1987: 394-407 - 1981
- [j2]Shojiro Sakata:
On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals. IEEE Trans. Inf. Theory 27(5): 556-564 (1981)
1970 – 1979
- 1978
- [j1]Shojiro Sakata:
General theory of doubly periodic arrays over an arbitrary finite field and its applications. IEEE Trans. Inf. Theory 24(6): 719-730 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
