The most efficient uniquely decipherable encoding schemes

Dongyang Long; Weijia Jia

doi:10.1109/WISE.2000.882388

The most efficient uniquely decipherable encoding schemes

Dongyang Long
, Weijia Jia

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

1 Citation (Scopus)

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. © 2000 IEEE.

Original language	English
Title of host publication	Main Program
Publisher	IEEE
Pages	159-163
Volume	1
ISBN (Print)	0769505775, 9780769505770
DOIs	https://doi.org/10.1109/WISE.2000.882388
Publication status	Published - 2000
Event	1st International Conference on Web Information Systems Engineering, WISE 2000 - Hong Kong, China Duration: 19 Jun 2000 → 21 Jun 2000

Publication series

Name	Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000
Volume	1

Conference

Conference	1st International Conference on Web Information Systems Engineering, WISE 2000
Place	China
City	Hong Kong
Period	19/06/00 → 21/06/00

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

This work was partially sponsored by UGC Hong Kong under grant 9040352 and by the City University of Hong Kong under grants 7000853, 7000765, and 7100065. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official polices or endorsements, either express or implied, of the UGC Hong Kong or the City University of Hong Kong.

Research Keywords

code
Huffman encoding schemes
instantaneous code
uniquely decipherable code

Access Output

10.1109/WISE.2000.882388

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{010a336a90b347e6a283c2ea688ffd65,

title = "The most efficient uniquely decipherable encoding schemes",

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. {\textcopyright} 2000 IEEE.",

keywords = "code, Huffman encoding schemes, instantaneous code, uniquely decipherable code",

author = "Dongyang Long and Weijia Jia",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 1st International Conference on Web Information Systems Engineering, WISE 2000 ; Conference date: 19-06-2000 Through 21-06-2000",

year = "2000",

doi = "10.1109/WISE.2000.882388",

language = "English",

isbn = "0769505775",

volume = "1",

series = "Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000",

publisher = "IEEE",

pages = "159--163",

booktitle = "Main Program",

address = "United States",

}

Long, D & Jia, W 2000, The most efficient uniquely decipherable encoding schemes. in Main Program. vol. 1, Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000, vol. 1, IEEE, pp. 159-163, 1st International Conference on Web Information Systems Engineering, WISE 2000, Hong Kong, China, 19/06/00. https://doi.org/10.1109/WISE.2000.882388

The most efficient uniquely decipherable encoding schemes. / Long, Dongyang; Jia, Weijia.
Main Program. Vol. 1 IEEE, 2000. p. 159-163 (Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000; Vol. 1).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - The most efficient uniquely decipherable encoding schemes

AU - Long, Dongyang

AU - Jia, Weijia

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2000

Y1 - 2000

N2 - 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. © 2000 IEEE.

AB - 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. © 2000 IEEE.

KW - code

KW - Huffman encoding schemes

KW - instantaneous code

KW - uniquely decipherable code

UR - https://www.scopus.com/pages/publications/84968832016

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84968832016&origin=recordpage

U2 - 10.1109/WISE.2000.882388

DO - 10.1109/WISE.2000.882388

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0769505775

SN - 9780769505770

VL - 1

T3 - Proceedings of the 1st International Conference on Web Information Systems Engineering, WISE 2000

SP - 159

EP - 163

BT - Main Program

PB - IEEE

T2 - 1st International Conference on Web Information Systems Engineering, WISE 2000

Y2 - 19 June 2000 through 21 June 2000

ER -

The most efficient uniquely decipherable encoding schemes

Abstract

Publication series

Conference

Bibliographical note

Funding

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this