default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakahiro Ota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Takahiro Ota, Akiko Manada:
A Reconstruction of Circular Binary String Using Substrings and Minimal Absent Words. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 107(3): 409-416 (2024)- 2022
- [c25]Takahiro Ota, Akiko Manada:
A Necessary and Sufficient Condition for Reconstruction of Circular Binary String based on the Lengths of Substrings with Weights. ISITA 2022: 109-113 - [c24]Akiko Manada, Takahiro Ota, Hiroyoshi Morita:
The Maximum Run-Length Constrained Balanced Codes for Random-Access DNA Storage. ISITA 2022: 114-118 - 2020
- [j9]Takahiro Ota, Hiroyoshi Morita, Akiko Manada:
Compression by Substring Enumeration Using Sorted Contingency Tables. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(6): 829-835 (2020) - [c23]Akiko Manada, Takahiro Ota, Hiroyoshi Morita:
Bonds of Constrained Systems and Their Characteristics. ISITA 2020: 240-244 - [c22]Takahiro Ota, Akiko Manada:
Addressing Information Using Data Hiding for DNA-based Storage Systems. ISITA 2020: 509-513
2010 – 2019
- 2019
- [j8]Takahiro Ota, Hiroyoshi Morita, Akiko Manada:
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(2): 440-449 (2019) - [c21]Gilson Frias, Hiroyoshi Morita
, Takahiro Ota:
Arrhythmia Detection with Antidictionary Coding and Its Application on Mobile Platforms. BODYNETS 2019: 50-67 - [c20]Takahiro Ota, Ryoji Nakamura, Akiko Manada:
A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints. ISIT 2019: 1512-1516 - 2018
- [c19]Takahiro Ota, Hiroyoshi Morita, Akiko Manada:
Compression by Substring Enumeration with a Finite Alphabet Using Sorting. ISITA 2018: 555-559 - 2017
- [j7]Takahiro Ota, Hiroyoshi Morita:
A Compact Tree Representation of an Antidictionary. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1973-1984 (2017) - [c18]Takahiro Ota, Hiroyoshi Morita:
Two-dimensional source coding by means of subblock enumeration. ISIT 2017: 311-315 - [i3]Takahiro Ota, Hiroyoshi Morita:
Two-Dimensional Source Coding by Means of Subblock Enumeration. CoRR abs/1701.06733 (2017) - 2016
- [c17]Takahiro Ota, Akiko Manada, Hiroyoshi Morita:
A finite graph representation for two-dimensional finite type constrained systems. ISITA 2016: 51-55 - [c16]Takahiro Ota, Akiko Manada, Hiroyoshi Morita:
A two-dimensional antidictionary automaton for a toric surface. ISITA 2016: 71-75 - [i2]Takahiro Ota, Akiko Manada, Hiroyoshi Morita:
A Graph Representation for Two-Dimensional Finite Type Constrained Systems. CoRR abs/1602.00446 (2016) - 2015
- [c15]Takahiro Ota, Hiroyoshi Morita:
On a two-dimensional antidictionary construction using suffix tries. ISIT 2015: 2974-2978 - 2014
- [j6]Takahiro Ota, Hirotada Fukae, Hiroyoshi Morita:
Dynamic construction of an antidictionary with linear complexity. Theor. Comput. Sci. 526: 108-119 (2014) - [c14]Takahiro Ota, Hiroyoshi Morita:
On a two-dimensional antidictionary coding. ISITA 2014: 289-293 - [c13]Takahiro Ota, Hiroyoshi Morita:
On a universal antidictionary coding for stationary ergodic sources with finite alphabet. ISITA 2014: 294-298 - 2013
- [j5]Takahiro Ota, Hiroyoshi Morita, Adriaan J. de Lind van Wijngaarden:
Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2343-2350 (2013) - [j4]Tetsuya Kobayashi, Akiko Manada, Takahiro Ota, Hiroyoshi Morita:
On the Irreducibility of Certain Shifts of Finite Type. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12): 2415-2421 (2013) - [j3]Naoto Kunii, Kyousuke Kamada, Takahiro Ota, Kensuke Kawai, Nobuhito Saito:
Characteristic profiles of high gamma activity and blood oxygenation level-dependent responses in various language areas. NeuroImage 65: 242-249 (2013) - [c12]Takahiro Ota, Hiroyoshi Morita:
On antidictionary coding based on compacted substring automaton. ISIT 2013: 1754-1758 - [c11]Takahiro Ota, Hiroyoshi Morita:
Relationship between antidictionary automata and compacted substring automata. ITA 2013: 1-4 - 2012
- [c10]Hirotada Fukae, Takahiro Ota, Hiroyoshi Morita:
On fast and memory-efficient construction of an antidictionary array. ISIT 2012: 1092-1096 - [c9]Takahiro Ota, Hiroyoshi Morita:
On real-time arrhythmia detection in ECG monitors using antidictionary coding. ISITA 2012: 194-198 - 2011
- [c8]Takahiro Ota, Toshikazu Wada:
Classification based character segmentation guided by Fast-Hessian-Affine regions. ACPR 2011: 249-253 - [c7]Takahiro Ota, Hiroyoshi Morita, Hirotada Fukae:
On the dynamic construction of an antidictionary with linear complexity. ISIT 2011: 2422-2426 - 2010
- [j2]Takahiro Ota, Hiroyoshi Morita:
On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet. IEICE Trans. Inf. Syst. 93-D(12): 3384-3391 (2010) - [c6]Takahiro Ota, Toshikazu Wada, Takayuki Nakamura:
Classifier Acceleration by Imitation. ACCV (4) 2010: 653-664 - [c5]Takahiro Ota, Hiroyoshi Morita:
Asymptotic optimality of antidictionary codes. ISIT 2010: 101-105 - [c4]Takahiro Ota, Hiroyoshi Morita:
On the adaptive antidictionary code using minimal forbidden words with constant lengths. ISITA 2010: 72-77 - [i1]Takahiro Ota, Hiroyoshi Morita:
Asymptotic Optimality of Antidictionary Codes. CoRR abs/1006.0284 (2010)
2000 – 2009
- 2009
- [c3]Takahiro Ota, Hiroyoshi Morita:
Length of minimal forbidden words on a stationary ergodic source. ISIT 2009: 537-540 - 2007
- [j1]Takahiro Ota, Hiroyoshi Morita:
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(11): 2533-2539 (2007) - [c2]Takahiro Ota, Hiroyoshi Morita:
On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity. ISIT 2007: 86-90 - 2006
- [c1]Takahiro Ota, Hiroyoshi Morita:
On the Construction of an Antidictionary of a Binary String with Linear Complexity. ISIT 2006: 2343-2347
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 2025-01-09 13:01 CET 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:
