Joint source, channel coding, and secrecy

Authors:
Enrico Magli;Marco Grangetto;Gabriella Olmo
Affiliations:
Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, Torino, Italy
Venue:
EURASIP Journal on Information Security
Year:
2007

Citing 6
Cited 2

The Art of Error Correcting Coding

The Art of Error Correcting Coding
On compressing encrypted data

IEEE Transactions on Signal Processing - Part II
Secure Arithmetic Coding

IEEE Transactions on Signal Processing
Design of integrated multimedia compression and encryption systems

IEEE Transactions on Multimedia
Multimedia Selective Encryption by Means of Randomized Arithmetic Coding

IEEE Transactions on Multimedia
Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction

IEEE Journal on Selected Areas in Communications

Secure arithmetic coding with error detection capability

EURASIP Journal on Information Security
Enhanced Secure Error Correction Code Schemes in Time Reversal UWB Systems

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of joint source coding, channel coding, and secrecy. In particular, we propose two practical joint schemes: the first one is based on error-correcting randomized arithmetic codes, while the second one employs turbo codes with compression, error protection, and securization capabilities. We provide simulation results on ideal binary data showing that the proposed schemes achieve satisfactory performance; they also eliminate the need for external compression and ciphering blocks with a significant potential computational advantage.