default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasato Tajima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Masato Tajima:
Derivation of Mutual Information and Linear Minimum Mean-Square Error for Viterbi Decoding of Convolutional Codes Using the Innovations Method. CoRR abs/2403.05740 (2024)- 2021
- [j10]Masato Tajima
:
Corrections to "An Innovations Approach to Viterbi Decoding of Convolutional Codes". IEEE Trans. Inf. Theory 67(5): 3183-3185 (2021) - [i11]Masato Tajima:
A Further Note on an Innovations Approach to Viterbi Decoding of Convolutional Codes. CoRR abs/2102.07315 (2021) - 2020
- [i10]Masato Tajima:
Corrections to "An Innovations Approach to Viterbi Decoding of Convolutional Codes". CoRR abs/2008.08760 (2020)
2010 – 2019
- 2019
- [j9]Masato Tajima:
An Innovations Approach to Viterbi Decoding of Convolutional Codes. IEEE Trans. Inf. Theory 65(5): 2704-2722 (2019) - [i9]Masato Tajima:
Non-Linear Estimation of Convolutionally Encoded Sequences. CoRR abs/1906.02377 (2019) - 2017
- [i8]Masato Tajima:
Characteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes. CoRR abs/1705.03982 (2017) - [i7]Masato Tajima:
An Innovations Approach to Viterbi Decoding of Convolutional Codes. CoRR abs/1710.11310 (2017) - 2015
- [i6]Masato Tajima:
Algebraic Construction of Tail-Biting Trellises for Linear Block Codes. CoRR abs/1512.02782 (2015) - 2014
- [j8]Masato Tajima, Koji Okino, Tatsuto Murayama:
Initial (Final) State Estimation in Error-Trellises for Tail-Biting Convolutional Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(3): 881-887 (2014) - [i5]Masato Tajima, Koji Okino, Tatsuto Murayama:
Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences. CoRR abs/1401.2496 (2014) - 2012
- [c5]Masato Tajima, Koji Okino:
Error-trellises for tailbiting convolutional codes. ISITA 2012: 648-652 - [i4]Masato Tajima, Koji Okino:
Error-Trellis Construction for Tailbiting Convolutional Codes. CoRR abs/1201.4428 (2012) - 2011
- [j7]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2894-2899 (2011) - [c4]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Simultaneous code/error-trellis reduction for convolutional codes using shifted code/error-subsequences. ISIT 2011: 2482-2486 - [i3]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences. CoRR abs/1101.5858 (2011) - 2010
- [c3]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Error-trellis state complexity of LDPC convolutional codes based on circulant matrices. ISITA 2010: 19-24
2000 – 2009
- 2009
- [j6]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Error-Trellis Construction for Convolutional Codes Using Shifted Error/Syndrome-Subsequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2086-2096 (2009) - [i2]Masato Tajima, Koji Okino, Takashi Miyagoshi:
1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices. CoRR abs/0912.4995 (2009) - 2008
- [i1]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Error-Trellis State Complexity of LDPC Convolutional Codes Based on Circulant Matrices. CoRR abs/0812.4642 (2008) - 2007
- [j5]Masato Tajima, Koji Okino, Takashi Miyagoshi:
Minimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(11): 2629-2634 (2007) - 2006
- [j4]Masato Tajima, Koji Okino, Takashi Miyagoshi:
State-Complexity Reduction for Convolutional Codes Using Trellis-Module Integration. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(10): 2466-2474 (2006) - 2003
- [j3]Masato Tajima, Keiji Shibata, Zenshiro Kawasaki:
On the Equivalence Between Scarce-State-Transition Viterbi Decoding and Syndrome Decoding of Convolutional Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(8): 2107-2116 (2003) - [j2]Masato Tajima, Keiji Shibata, Zenshiro Kawasaki:
Relation between encoder and syndrome former variables and symbol reliability estimation using a syndrome trellis. IEEE Trans. Commun. 51(9): 1474-1484 (2003) - 2002
- [j1]Masato Tajima, Keiji Shibata, Zenshiro Kawasaki:
Soft-in Syndrome Decoding of Convolutional Codes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(8): 1979-1983 (2002) - 2001
- [c2]Zenshiro Kawasaki, Keiji Shibata, Masato Tajima:
Sentence Extraction by Questioning. NLPRS 2001: 585-591
1990 – 1999
- 1998
- [c1]Zenshiro Kawasaki, Keiji Takida, Masato Tajima:
Language Model and Sentence Structure Manipulations for Natural Language Application Systems. CoNLL 1998: 281-286
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-24 22:51 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:
