SMS Compression System using Arithmetic Coding Algorithm

Short Message Service (SMS) has limitation in the length of its text message, which only provides 160 characters per SMS. It means that if we send more than 160 characters, it will be considered as sending more than one SMS, so that we have to spend more cost for sending SMS. On the other side, the...

Full description

Saved in:
Bibliographic Details
Published in:IT for Society Vol. 3; no. 2
Main Authors: Rosalina, Rosalina, Hidayat, Wahyu
Format: Journal Article
Language:English
Published: 18.02.2018
ISSN:2503-2224, 2527-595X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Short Message Service (SMS) has limitation in the length of its text message, which only provides 160 characters per SMS. It means that if we send more than 160 characters, it will be considered as sending more than one SMS, so that we have to spend more cost for sending SMS. On the other side, the Arithmetic Coding algorithm provides an effective mechanism for text compression. It has performed the great compression result and in many case it was considered as the better compression algorithm than other ones, such as Huffman and LZW (Lempel-Ziv-Welch). This research will implement the Arithmetic Coding algorithm to develop an application that will compress the SMS text message. The concept of Arithmetic Coding will be implemented to compress the SMS text message before it is sent from the sender to the receiver. The application is called CheaperZipper (CZ). This application will handle the sending and receiving SMS in the hand phone by preceding the compression and decompression process. 
AbstractList Short Message Service (SMS) has limitation in the length of its text message, which only provides 160 characters per SMS. It means that if we send more than 160 characters, it will be considered as sending more than one SMS, so that we have to spend more cost for sending SMS. On the other side, the Arithmetic Coding algorithm provides an effective mechanism for text compression. It has performed the great compression result and in many case it was considered as the better compression algorithm than other ones, such as Huffman and LZW (Lempel-Ziv-Welch). This research will implement the Arithmetic Coding algorithm to develop an application that will compress the SMS text message. The concept of Arithmetic Coding will be implemented to compress the SMS text message before it is sent from the sender to the receiver. The application is called CheaperZipper (CZ). This application will handle the sending and receiving SMS in the hand phone by preceding the compression and decompression process. 
Author Hidayat, Wahyu
Rosalina, Rosalina
Author_xml – sequence: 1
  givenname: Rosalina
  surname: Rosalina
  fullname: Rosalina, Rosalina
– sequence: 2
  givenname: Wahyu
  surname: Hidayat
  fullname: Hidayat, Wahyu
BookMark eNotjz1rwzAYhEVJoWmSuav_gB19WtIYTL8gpYMzZBOW9DoVxHaQ3EL-fR230x13x8HziBb90ANCTwQXjGFKtmFsU_HDAqaFUOUdWlJBZS60OC5uHrOcUsof0CalYDHnklOO6RKp-qPOqqG7RJiaoc_qaxqhy75T6E_ZLobxq4MxuGnj5-R8GuZwje7b5pxg868rdHh5PlRv-f7z9b3a7XOnSJm32govvGbOYSLAKua9o1w6gIZhz0stlSDKamZtq6UAVlrg3mlnXSMlsBXa_t26OKQUoTWXGLomXg3BZkY3N3Qzo5sJnf0Cbx5Qkw
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.33021/itfs.v3i02.586
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2527-595X
ExternalDocumentID 10_33021_itfs_v3i02_586
GroupedDBID AAYXX
CITATION
M~E
ID FETCH-LOGICAL-c816-f9b5d5d93cc015eb83ddc247ceea30d46978518b93bbf975e36be4dc9cbca77e3
ISSN 2503-2224
IngestDate Sat Nov 29 05:56:37 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 2
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c816-f9b5d5d93cc015eb83ddc247ceea30d46978518b93bbf975e36be4dc9cbca77e3
OpenAccessLink https://doi.org/10.33021/itfs.v3i02.586
ParticipantIDs crossref_primary_10_33021_itfs_v3i02_586
PublicationCentury 2000
PublicationDate 2018-02-18
PublicationDateYYYYMMDD 2018-02-18
PublicationDate_xml – month: 02
  year: 2018
  text: 2018-02-18
  day: 18
PublicationDecade 2010
PublicationTitle IT for Society
PublicationYear 2018
SSID ssib044742402
Score 1.6471708
Snippet Short Message Service (SMS) has limitation in the length of its text message, which only provides 160 characters per SMS. It means that if we send more than...
SourceID crossref
SourceType Index Database
Title SMS Compression System using Arithmetic Coding Algorithm
Volume 3
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2527-595X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044742402
  issn: 2503-2224
  databaseCode: M~E
  dateStart: 20160101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEA66evAiiopvevAgSLWbR9McF1nRgyK44N5KXtUF7cpuV3Yv_nanSd1WUdCDlxCGMDT50uk36cwEoaPMyohkMXiq2qiQlsVngZazUMQYtoDCGsvIXTbBb26Sfl_cVteyj911AjzPk-lUvPwr1CADsMvU2T_APVcKAugD6NAC7ND-Cvg7cM3Lt9wHuOZVTfKTiTsU6IwGxeNzmbgIY1w-S-fpYeiETZp61XPhh1VIZ_1TZizL_F0fke379dG1kTPpLPq9fJxNmqcJ7aQMQG4aQGBEJATO4J18W8kwD5lg_abVJI3Ngb-zxYQAfYDFGhTZ-PSVDCJ8yr6rev3lazSPEQTvxKlISwWpU5CCgkW0hDkTpQ2-fut-mA5KwcWnLsJ0PgNfyMnpOPv8EA0O0iATvTW0WnkBQcejt44WbL6BEkAuaCAXeOQCh1xQIxd45II5cpuod9HtnV-G1cUWoU7acZgJxQwzgmgNZMyqhBijMeXAVySJDI3Bs2ftRAmiVCY4syRWlhottNKSc0u2UCsf5nYbBRbmHbcVoUwJsL7gP0fYCMpjLmlGmNpBxx8zTV98-ZL0h4Xd_f3QPbRS75191CpGE3uAlvVrMRiPDh0w7wEgPcY
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=SMS+Compression+System+using+Arithmetic+Coding+Algorithm&rft.jtitle=IT+for+Society&rft.au=Rosalina%2C+Rosalina&rft.au=Hidayat%2C+Wahyu&rft.date=2018-02-18&rft.issn=2503-2224&rft.eissn=2527-595X&rft.volume=3&rft.issue=2&rft_id=info:doi/10.33021%2Fitfs.v3i02.586&rft.externalDBID=n%2Fa&rft.externalDocID=10_33021_itfs_v3i02_586
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2503-2224&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2503-2224&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2503-2224&client=summon