Joint source-cryptographic-channel coding for dependable systems

Authors:
Haruhiko Kaneko;Eiji Fujiwara
Affiliations:
Department of Computer Science, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo, 152-8552, Japan.;Department of Computer Science, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo, 152-8552, Japan
Venue:
International Journal of Computer Applications in Technology
Year:
2009

Citing 6
Cited 0

Design and implementation of JPEG encoder IP core

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Code Design for Dependable Systems: Theory and Practical Application

Code Design for Dependable Systems: Theory and Practical Application
IBM memory expansion technology (MXT)

IBM Journal of Research and Development
Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Coding with digits of unequal cost

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes the novel joint coding suitable for dependable and secure systems. The proposed joint coding has three functions: data compression, public-key encryption and error control coding. This coding provides very low encoding complexity due to realising only by simple matrix computation, which gives an efficient transmission of data in networks and a high speed execution in computers. In an encoding process, input data is firstly converted to a sparse sequence, which is then encoded using the encoding matrix generated by linear block codes and randomly constructed non-singular matrices. Decoding is performed based on error correction algorithm of the linear block codes. Evaluation shows that the encoder gate count of the proposed joint coding for still images is smaller than that of the conventional separate coding by 65.7%.