Efficient homophonic coding
Authors:
- A. FionovAFA. Fionov
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (6) , 2083-2091
Abstract
Homophonic coding, or homophonic substitution, is referred to as a technique that contributes to reliability of the secret key cipher systems. Its main goal is to convert the plaintext into a sequence of completely random (equiprobable and independent) code letters. In solving this problem three characteristics are to be considered: (i) redundancy, defined as the difference between the mean codeword length and the source entropy, (ii) an average number of random bits used in encoding, and (iii) complexity of the encoder and decoder, measured by memory size (in bits) and computation time (in bit operations). A class of homophonic codes is suggested for which both the redundancy and the average number of random bits can be made as small as required with nonexponential growth of memory size and roughly logarithmic growth of computation timeKeywords
This publication has 7 references indexed in Scilit:
- An Information-Theoretic Treatment of Homophonic Substitution2001
- A Universal Algorithm for Homophonic Coding2000
- A fast and efficient homophonic coding algorithm1996
- A fast homophonic coding algorithm based on arithmetic codingLecture Notes in Computer Science, 1995
- Fast and efficient coding of information sourcesIEEE Transactions on Information Theory, 1994
- Universal modeling and codingIEEE Transactions on Information Theory, 1981
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949