| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| CCS, NLP | 2022-06-10 09:25 |
Osaka | (Primary: On-site, Secondary: Online) |
On Auto-Correlation Properties of Random Numbers Generated by Two Markov Binary Sequences Shuzo Okuno, Akio Tsuneda (Kumamoto Univ.)  NLP2022-13 CCS2022-13 |
Markov binary sequences generated by 2-state Markov source are one of typical information sources and they have exponent... [more] | NLP2022-13 CCS2022-13 pp.62-65 |
| NLP | 2021-12-18 11:05 |
Oita | J:COM Horuto Hall OITA | Markov Binary Sequences Generated by Post-Processing Based on Nonlinear Feedback Shift Registers Akio Tsuneda (Kumamoto Univ.), Naruaki Maeda (NEC) NLP2021-59 |
In general, random numbers are required to be uniform and uncorrelated. However, it is known that correlated random numb... [more] | NLP2021-59 pp.72-75 |
| WBS, IT, ISEC | 2021-03-05 14:45 |
Online | Online | Analysis of Optimal Error Exponents on Classification for Markov Sources Hiroto Kuramata, Hideki Yagi, Tsutomu Kawabata (UEC) IT2020-152 ISEC2020-82 WBS2020-71 |
We consider a classification problem for a test sequence to determine from which source the sequence generates. The syst... [more] | IT2020-152 ISEC2020-82 WBS2020-71 pp.245-250 |
| IT, ISEC, WBS | 2019-03-07 09:30 |
Tokyo | University of Electro-Communications | Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
-- When the Statewise Alphabets are Unknown -- Yusuke Hashimoto, Tstutomu Kawabata (Univ. of Electro-Comm.) IT2018-89 ISEC2018-95 WBS2018-90 |
A Bayesian (Laplace or Krichevski-Trofimov) estimator for Markov source can be used to build a lossless source code. Ho... [more] |
IT2018-89 ISEC2018-95 WBS2018-90 pp.85-90 |
| IT | 2016-07-29 14:00 |
Fukuoka | Seminar House, Fukuoka Univ. | Source coding with side information at the decoder for a class of correlated information sources with memory Yasutada Oohama (UEC) IT2016-27 |
We consider the one helper source coding problem posed and investigated by Ahlswede, K"orner, and Wyner for a class of i... [more] | IT2016-27 pp.37-42 |
| IT, ISEC, WBS | 2013-03-07 11:45 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Order Estimator of Stationary Markov Sources Using Codeword Length of Universal Code Shinji Kanazawa, Tomohiko Uyematsu (Tokyo Inst. of Tech.) IT2012-65 ISEC2012-83 WBS2012-51 |
Merhav et al. studied the problem of estimating the order of stationary Markov sources. They proposed an order estimator... [more] | IT2012-65 ISEC2012-83 WBS2012-51 pp.19-24 |
| IT, ISEC, WBS | 2013-03-07 13:40 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62 |
Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CS... [more] | IT2012-76 ISEC2012-94 WBS2012-62 pp.95-100 |
[Return to Top Page]