{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T05:20:30Z","timestamp":1730265630580,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/iisa.2017.8316446","type":"proceedings-article","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T16:46:49Z","timestamp":1521132409000},"page":"1-4","source":"Crossref","is-referenced-by-count":2,"title":["A data compression scheme using adaptive word-based pattern matching"],"prefix":"10.1109","author":[{"given":"Moad","family":"Mowafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dima","family":"Kasasbeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faruq","family":"Al-Omari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2012.01.917"},{"key":"ref11","first-page":"1","article-title":"Semi-adaptive substitution coder for lossless text compression","volume":"80","author":"rexline","year":"2013","journal-title":"Int J Comput Appl"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/76894.76896"},{"key":"ref13","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"Technical Report 124 Palo Alto CA Digital Equipment Corporation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322346"},{"key":"ref4","article-title":"Byte pair encoding: a text compression scheme that accelerates pattern matching","author":"shibata","year":"1999","journal-title":"Department of Informatics Kyushu University Japan Tech Rep"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1147\/rd.282.0135"},{"key":"ref6","article-title":"A linear representation of huffman tree","volume":"1","author":"goel","year":"2012","journal-title":"Proceedings of the International MultiConference of Engineers and Computer Scientists"},{"key":"ref5","first-page":"1098","volume":"40","author":"huffman","year":"1952","journal-title":"A method for the construction of minimum redundancy codes"},{"key":"ref8","article-title":"An intelligent text data encryption and compression for high speed and secure data transmission over internet","author":"govindan","year":"2005","journal-title":"International Conference on Information Technology Coding and Compression ITCC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"journal-title":"Introduction to Data Compression","year":"2013","author":"sayood","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-072-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICECTECH.2011.5941833"}],"event":{"name":"2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA)","start":{"date-parts":[[2017,8,27]]},"location":"Larnaca","end":{"date-parts":[[2017,8,30]]}},"container-title":["2017 8th International Conference on Information, Intelligence, Systems &amp; Applications (IISA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8308011\/8316350\/08316446.pdf?arnumber=8316446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T17:07:39Z","timestamp":1523293659000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8316446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iisa.2017.8316446","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}