Position index preserving compression of text data

Data compression offers an attractive approach to reducing communication cost by using available bandwidth effectively. It also secures data during transmission for its encoded form. In this paper an index based position oriented lossless text compression called PIPC ( Position Index Preserving Comp...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Akhtar, Nasim, Rashid, Mamunur, Islam, Shafiqul, Kashem, Mohammod Abul, Kolybanov, Cyrll Y.
Formato: Articulo
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
Data compaction and compression
index
;IDBE
LIPT
PIPC
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/9689
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr11-2.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-9689
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Data compaction and compression
index
;IDBE
LIPT
PIPC
spellingShingle Ciencias Informáticas
Data compaction and compression
index
;IDBE
LIPT
PIPC
Akhtar, Nasim
Rashid, Mamunur
Islam, Shafiqul
Kashem, Mohammod Abul
Kolybanov, Cyrll Y.
Position index preserving compression of text data
topic_facet Ciencias Informáticas
Data compaction and compression
index
;IDBE
LIPT
PIPC
description Data compression offers an attractive approach to reducing communication cost by using available bandwidth effectively. It also secures data during transmission for its encoded form. In this paper an index based position oriented lossless text compression called PIPC ( Position Index Preserving Compression) is developed. In PIPC the position of the input word is denoted by ASCII code. The basic philosopy of the secure compression is to preprocess the text and transform it into some intermediate file which can be compressed with better efficiency and which exploits the natural redundancy of the languaje in making the transformation. The proposed algorithm compresses the data 35 % to 50 % of its original size depending on occurrence of repeat word
format Articulo
Articulo
author Akhtar, Nasim
Rashid, Mamunur
Islam, Shafiqul
Kashem, Mohammod Abul
Kolybanov, Cyrll Y.
author_facet Akhtar, Nasim
Rashid, Mamunur
Islam, Shafiqul
Kashem, Mohammod Abul
Kolybanov, Cyrll Y.
author_sort Akhtar, Nasim
title Position index preserving compression of text data
title_short Position index preserving compression of text data
title_full Position index preserving compression of text data
title_fullStr Position index preserving compression of text data
title_full_unstemmed Position index preserving compression of text data
title_sort position index preserving compression of text data
publishDate 2011
url http://sedici.unlp.edu.ar/handle/10915/9689
http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr11-2.pdf
work_keys_str_mv AT akhtarnasim positionindexpreservingcompressionoftextdata
AT rashidmamunur positionindexpreservingcompressionoftextdata
AT islamshafiqul positionindexpreservingcompressionoftextdata
AT kashemmohammodabul positionindexpreservingcompressionoftextdata
AT kolybanovcyrlly positionindexpreservingcompressionoftextdata
bdutipo_str Repositorios
_version_ 1764820492554862595

Ejemplares similares