登入選單

返回Google圖書搜尋

Construction of Minimal-Redundancy Codes for Variable-Length Words

Bogomir Horvat

出版	Wright-Patterson Air Force Base, Foreign Technology Division, Translation Division, 1977
URL	http://books.google.com.hk/books?id=lTpGHQAACAAJ&hl=&source=gbs_api

註釋

Another approach for the construction of minimum-redundancy codes for variable-length words is described. Based on Huffman's optimized codes, it uses a small memory space and a shorter program. The word-length is inversely proportional to the probability of its presence at the output. The construction of minimum-redundancy codes is not limited to data transfer but can also be used in the memory, for display of system states, for language generation, etc. The choice of code symbols in the code table determines the synchronizing properties of the code. Random code tables can be used for secret message transmission. It is well known that coding into code words of variable length is characterized by incomplete reliability of reception. Messages will be properly received from the data source only when the receiving end has enough time for immediate decoding. If that is not the case, we can be sure that the receiver will not be able to receive the transmitted data in their entirety. Intermediaries are required that are built into the transmitting and receiving end. Due to the short processing times, the described coding method requires intermediaries of lower capacity.