Loading...
Please wait, while we are loading the content...
Similar Documents
Variable-length codes for sources with equiprobable symbols (1999).
| Content Provider | CiteSeerX |
|---|---|
| Author | Assanovich, Boris Günther, Ulrich |
| Abstract | Variable-length codes can provide compression for data communication. Such codes maybe used not only when the source statistics is known but also when we do not know the source probability distribution, and a source with equal symbol probabilities (equiprobable symbols) can or has to be assumed. This paper presents variable-length codes with code words that differ in length by at most one code symbol. Such codes suit the efficient encoding of sources with equiprobable symbols. We accommodate non-binary codes and present an iterative algorithm for the construction of such codes. We also calculate the average codeword length for such codes, which extends Krichevski's result for binary codes [5]. Finally,we propose a scheme that allows the code to be communicated efficiently from transmitter to receiver. |
| File Format | |
| Publisher Date | 1999-01-01 |
| Access Restriction | Open |
| Subject Keyword | Variable-length Code Equiprobable Symbol Equal Symbol Probability Code Symbol Non-binary Code Data Communication Code Word Source Probability Distribution Efficient Encoding Iterative Algorithm Binary Code Source Statistic Average Codeword Length |
| Content Type | Text |
| Resource Type | Article |
