Takahiro Ota

Orcid: 0000-0002-8591-0083

According to our database1, Takahiro Ota authored at least 35 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Reconstruction of Circular Binary String Using Substrings and Minimal Absent Words.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

2022
A Necessary and Sufficient Condition for Reconstruction of Circular Binary String based on the Lengths of Substrings with Weights.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

The Maximum Run-Length Constrained Balanced Codes for Random-Access DNA Storage.
Proceedings of the International Symposium on Information Theory and Its Applications, 2022

2020
Compression by Substring Enumeration Using Sorted Contingency Tables.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Addressing Information Using Data Hiding for DNA-based Storage Systems.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Bonds of Constrained Systems and Their Characteristics.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019
A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Arrhythmia Detection with Antidictionary Coding and Its Application on Mobile Platforms.
Proceedings of the Body Area Networks. Smart IoT and Big Data for Intelligent Health Management, 2019

2018
Compression by Substring Enumeration with a Finite Alphabet Using Sorting.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
A Compact Tree Representation of an Antidictionary.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Two-dimensional source coding by means of subblock enumeration.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
A Graph Representation for Two-Dimensional Finite Type Constrained Systems.
CoRR, 2016

A two-dimensional antidictionary automaton for a toric surface.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

A finite graph representation for two-dimensional finite type constrained systems.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015
On a two-dimensional antidictionary construction using suffix tries.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Dynamic construction of an antidictionary with linear complexity.
Theor. Comput. Sci., 2014

On a universal antidictionary coding for stationary ergodic sources with finite alphabet.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

On a two-dimensional antidictionary coding.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
Characteristic profiles of high gamma activity and blood oxygenation level-dependent responses in various language areas.
NeuroImage, 2013

Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

On the Irreducibility of Certain Shifts of Finite Type.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Relationship between antidictionary automata and compacted substring automata.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

On antidictionary coding based on compacted substring automaton.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
On real-time arrhythmia detection in ECG monitors using antidictionary coding.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

On fast and memory-efficient construction of an antidictionary array.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Classification based character segmentation guided by Fast-Hessian-Affine regions.
Proceedings of the First Asian Conference on Pattern Recognition, 2011

2010
On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet.
IEICE Trans. Inf. Syst., 2010

On the adaptive antidictionary code using minimal forbidden words with constant lengths.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Asymptotic optimality of antidictionary codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Classifier Acceleration by Imitation.
Proceedings of the Computer Vision - ACCV 2010, 2010

2009
Length of minimal forbidden words on a stationary ergodic source.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2007
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

On the On-line Arithmetic Coding Based on Antidictionaries with Linear Complexity.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
On the Construction of an Antidictionary of a Binary String with Linear Complexity.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...