Constructions of Fix-Free Codes
碩士 === 國立清華大學 === 通訊工程研究所 === 93 === A code is a fix-free code if it is both a prefix code and a suffix code. Data encoded by a fix-free code can be decoded in the forward direction and the backward direction simultaneously, thus reducing the decoding time by half. In this thesis, we prove a suffici...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/82808849104635963418 |