An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Compression and Coding Algorithms
Compression and Coding Algorithms
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Dependability Modelling under Uncertainty: An Imprecise Probabilistic Approach
Dependability Modelling under Uncertainty: An Imprecise Probabilistic Approach
Security and Dependability for Ambient Intelligence
Security and Dependability for Ambient Intelligence
Handbook of Data Compression
IEEE Journal on Selected Areas in Communications
Introduction to Digital Communication Systems
Introduction to Digital Communication Systems
A reversible data hiding scheme using even-odd embedding method
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Architecting dependable systems VII
Architecting dependable systems VII
High diffusion cipher: encryption and error correction in a single cryptographic primitive
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
IEEE Communications Surveys & Tutorials
PPM compression without escapes
Software—Practice & Experience
Organizational Patterns for Security and Dependability: From Design to Application
International Journal of Secure Software Engineering
Hi-index | 0.00 |
We apply Linear Error Correction (LEC) code to a novel encoding scheme to assure two fundamental requirements for transmission channels and storage units: security and dependability. Our design has the capacity to adapt itself to different applications and their various characteristics such as availability, error rate, and vulnerabilities. Based on simple logic operations, our scheme affords fast encryption, scalability (dual or more column erasures), and flexibility (LEC encoder employed as a front end to any conventional compression scheme). Performance results are very promising: Experiments on dual erasures outperform conventional compression algorithms including Arithmetic Coding, Huffman, and LZ77.