{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T18:36:32Z","timestamp":1772476592166,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,6,1]]},"DOI":"10.1587\/transfun.2019eap1063","type":"journal-article","created":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T22:05:45Z","timestamp":1590962745000},"page":"829-835","source":"Crossref","is-referenced-by-count":3,"title":["Compression by Substring Enumeration Using Sorted Contingency Tables"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Takahiro","family":"OTA","sequence":"first","affiliation":[{"name":"School of Network and Information, Senshu University"}]},{"given":"Hiroyoshi","family":"MORITA","sequence":"additional","affiliation":[{"name":"Dept. of Computer and Network Engineering, Graduate School of Informatics and Engineering, The University of Electro-Communications"}]},{"given":"Akiko","family":"MANADA","sequence":"additional","affiliation":[{"name":"Dept. of Information Science, Shonan Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D. Dub\u00e9 and V. Beaudoin, \u201cLossless data compression via substring enumeration,\u201d Proc. Data Compression Conference 2010, pp.229-238, March 2010. 10.1109\/DCC.2010.28","DOI":"10.1109\/DCC.2010.28"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, \u201cData compression using antidictionaries,\u201d Proc. IEEE, vol.88, no.11, pp.1756-1768, Nov. 2000. 10.1109\/5.892711","DOI":"10.1109\/5.892711"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T. Ota and H. Morita, \u201cOn the adaptive antidictionary code using minimal forbidden words with constant lengths,\u201d Proc. International Symposium on Information Theory and its Applications, pp.72-77, Oct. 2010. 10.1109\/isita.2010.5649621","DOI":"10.1109\/ISITA.2010.5649621"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. B\u00e9liveau and D. Dub\u00e9, \u201cImproving compression via substring enumeration by explicit phase awareness,\u201d Proc. Data Compression Conference 2014, pp.26-28, March 2014. 10.1109\/dcc.2014.68","DOI":"10.1109\/DCC.2014.68"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] H. Yokoo, \u201cAsymptotic optimal lossless compression via the CSE technique,\u201d Proc. Data Compression, Communications and Processing, pp.11-18, June 2011. 10.1109\/ccp.2011.32","DOI":"10.1109\/CCP.2011.32"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S. Kanai, H. Yokoo, K. Yamazaki, and H. Kaneyasu, \u201cEfficient implementation and empirical evaluation of compression by substring enumeration,\u201d IEICE Trans. Fundamentals, vol.E99-A, no.2, pp.601-611, Feb. 2016. 10.1587\/transfun.e99.a.601","DOI":"10.1587\/transfun.E99.A.601"},{"key":"7","unstructured":"[7] T. Ota and H. Morita, \u201cOn a universal antidictionary coding for stationary ergodic sources with finite alphabet,\u201d Proc. International Symposium on Information Theory and its Applications, pp.294-298, Oct. 2014."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] T. Ota and H. Morita, \u201cA compact tree representation of an antidictionary,\u201d IEICE Trans. Fundamentals, vol.E100-A, no.9, pp.1973-1984, Sept. 2017. 10.1587\/transfun.e100.a.1973","DOI":"10.1587\/transfun.E100.A.1973"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] K. Iwata and M. Arimura, \u201cLossless data compression via substring enumeration for <i>k<\/i>-th order Markov sources with a finite alphabet,\u201d IEICE Trans. Fundamentals, vol.E99-A, no.12, pp.2130-2135, Dec. 2016. 10.1587\/transfun.e99.a.2130","DOI":"10.1587\/transfun.E99.A.2130"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] S. Sakuma, K. Narisawa, and A. Shinohara, \u201cGeneralization of efficient implementation of compression by substring enumeration,\u201d Proc. Data Compression Conference, p.630, March 2016. 10.1109\/dcc.2016.86","DOI":"10.1109\/DCC.2016.86"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] P. Elias, \u201cUniversal codeword sets and representations of the integers,\u201d IEEE Trans. Inf. Theory, vol.IT-21, no.2, pp.194-203, 1975. 10.1109\/tit.1975.1055349","DOI":"10.1109\/TIT.1975.1055349"},{"key":"12","unstructured":"[12] The Calgary text compression corpus. ftp:\/\/ftp.cpsc.ucalgary.ca\/pub\/projects\/text.compression.corpus\/"},{"key":"13","unstructured":"[14] bzip2, http:\/\/www.bzip2.org"},{"key":"14","unstructured":"[15] M. Burrows and D. Wheeler, \u201cA block-sorting lossless data compression algorithm,\u201d SRC Research Report, pp.73-93, May 1994."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] T. Ota, H. Morita, and A. Manada, \u201cCompression by substring enumeration with a finite alphabet using sorting,\u201d Proc. International Symposium on Information Theory and its Applications, pp.587-591, Oct. 2018. 10.23919\/isita.2018.8664360","DOI":"10.23919\/ISITA.2018.8664360"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/6\/E103.A_2019EAP1063\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T03:33:42Z","timestamp":1591414422000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/6\/E103.A_2019EAP1063\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,1]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2019eap1063","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,1]]}}}