Residential College | false |
Status | 已發表Published |
The most efficient uniquely decipherable encoding schemes | |
Long D.; Jia W. | |
2000 | |
Conference Name | 1st International Conference on WEB Information Systems Engineering (WISE 2000) |
Source Publication | Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000 |
Volume | 1 |
Pages | 159-163 |
Conference Date | JUN 19-21, 2000 |
Conference Place | HONG KONG, PEOPLES R CHINA |
Abstract | The relevant concepts of the most efficient uniquely decipherable and maximal uniquely decipherable encoding schemes similar to highly efficient instantaneous encoding schemes are introduced. We show that the Huffman encoding schemes are the most efficient possible among both all uniquely decipherable encoding schemes and all maximal uniquely decipherable encoding schemes, respectively. Generally, decoding messages encrypted by a uniquely decipherable encoding scheme is more difficult than decoding messages encrypted by an instantaneous encoding scheme. However, from the security point of view, it is much more secure to apply a uniquely decipherable encoding scheme than to apply an instantaneous encoding scheme to an information system. |
Keyword | Code Huffman Encoding Schemes Instantaneous Code Uniquely Decipherable Code |
DOI | 10.1109/WISE.2000.882388 |
URL | View the original |
Language | 英語English |
WOS ID | WOS:000165194800020 |
Scopus ID | 2-s2.0-84968832016 |
Fulltext Access | |
Citation statistics | |
Document Type | Conference paper |
Collection | University of Macau |
Affiliation | City University of Hong Kong |
Recommended Citation GB/T 7714 | Long D.,Jia W.. The most efficient uniquely decipherable encoding schemes[C], 2000, 159-163. |
APA | Long D.., & Jia W. (2000). The most efficient uniquely decipherable encoding schemes. Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000, 1, 159-163. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment