A low complexity joint compression-error detection-cryptography based on arithmetic coding
Mahnaz Sinaie, Vahid Tabataba Vakili · 2010
This paper proposes a new joint source-cryptographic-channel coding (JSCC) based on arithmetic coding which is used basically for compression. The proposed method uses arithmetic coding (AC) with forbidden symbol for channel coding as an error detection codes. In this method, we use random length forbidden symbol and placing this dummy symbol in random places to provide security. The proposed technique provides secure codes; in addition, added redundancy is half of redundancy which is added by arithmetic coding with fixed forbidden symbol length. Our proposed technique is less complicated than cascaded source-channel coding and encryption. Moreover, our coder provides a flexible switch between a standard compression model and joint model.