Utilizing ASCII Codes Redundancy for Data Compression

When information is organized in documents and saved into computers its contents are stored using traditional ASCII codes. The occupied space by those ASCII codes is one challenge in the field of information technology. This is why many different data compression techniques have been developed and others are still in progress to meet this challenge. This paper looks at the ASCII codes from another view as inherited redundant codes. This inherited redundancy forms spatial redundancy that can be utilized to compress data documents. This compression is based on eliminating the repetition of the same ASCII code for the same character along its occurrences in a document. The proposed technique is based on the idea of assigning a position code for each element in the document. The position code is then connected with the original ASCII code for that element by reserving a memory area to keep track of the position codes of all bytes' patterns participating in the original document. The technique is then evaluated and assessed using analytical analysis and MATLAB work. The obtained results are then discussed to show the capability of the proposed method.