On some Characteristics of a Novel Lossless Data Compression Algorithm Based on Polynomial Codes

A new lossless data compression algorithm based on some characteristics of polynomial codes, namely polynomial codes data compression (PCDC), is introduced. In this scheme, the binary sequence to be compressed is divided into blocks of n bits length. Exploiting the property of a codeword to be multiple of a certain polynomial, one can decide to shorten the length of the given sequence by sending only the quotient polynomial. This approach needs an extra bit to signal the performed shortening. The performance of the PCDC algorithm is analyzed and the results obtained are presented. Comparison between the proposed algorithm and similar ones are commented. A possible hardware implementation is also described.