default search action
Yasuo Sugiyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1986
- [j14]Yasuo Sugiyama:
An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm. IEEE Trans. Inf. Theory 32(3): 394-409 (1986) - [c1]Yasuo Sugiyama:
A generalization of Levinson algorithm for solving Toeplitz systems. ICASSP 1986: 305-308 - 1984
- [j13]Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa:
Modified product codes. IEEE Trans. Inf. Theory 30(2): 299-305 (1984) - 1981
- [j12]Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa:
An improvement of error exponents at low rates for the generalized version of concatenated codes. IEEE Trans. Inf. Theory 27(3): 350-352 (1981) - 1980
- [j11]Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa:
Certain generalizations of concatenated codes-Exponential error bounds and decoding complexity. IEEE Trans. Inf. Theory 26(5): 527-534 (1980) - [j10]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
Superimposed concatenated codes (Corresp.). IEEE Trans. Inf. Theory 26(6): 735-736 (1980)
1970 – 1979
- 1978
- [j9]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
A new class of asymptotically good codes beyond the Zyablov bound. IEEE Trans. Inf. Theory 24(2): 198-204 (1978) - 1976
- [j8]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
An erasures-and-errors decoding algorithm for Goppa codes (Corresp.). IEEE Trans. Inf. Theory 22(2): 238-241 (1976) - [j7]Masao Kasahara, Yasuo Sugiyama, Shigeichi Hirasawa, Toshihiko Namekawa:
New classes of binary codes constructed on the basis of concatenated codes and product codes. IEEE Trans. Inf. Theory 22(4): 462-468 (1976) - [j6]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
Further results on Goppa codes and their applications to constructing efficient binary codes. IEEE Trans. Inf. Theory 22(5): 518-526 (1976) - [j5]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes'. IEEE Trans. Inf. Theory 22(6): 765 (1976) - 1975
- [j4]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
A Method for Solving Key Equation for Decoding Goppa Codes. Inf. Control. 27(1): 87-99 (1975) - [j3]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
Some efficient binary codes constructed using Srivastava codes (Corresp.). IEEE Trans. Inf. Theory 21(5): 581-582 (1975) - [j2]Masao Kasahara, Yasuo Sugiyama, Shigeichi Hirasawa, Toshihiko Namekawa:
A new class of binary codes constructed on the basis of BCH codes (Corresp.). IEEE Trans. Inf. Theory 21(5): 582-585 (1975) - 1974
- [j1]Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
A Modification of the Constructive Asymptotically Good Codes of Justesen for Low Rates. Inf. Control. 25(4): 341-350 (1974)
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:58 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: