|Title:|| ON THE DECODING
DELAY OF ENCODERS FOR INPUT-CONSTRAINED CHANNELS.
|Authors:|| J.J. Ashley, B.H. Marcus and R.M. Roth
|Abstract:||Finite-state encoders that encode $n$-ary data into a constrained system $S$ are considered. The anticipation, or decoding delay, of such an $(S,n)$-encoder is the number of symbols that a state-dependent decoder needs to look ahead in order to recover the current input symbol. Upper bounds are obtained on the smallest attainable number of states of any $(S,n)$-encoder with anticipation $t$. Those bounds can be explicitly computed from $t$ and $S$, which implies that the problem of checking whether there is an $(S,n)$-encoder with anticipation $t$ is decidable. It is also shown that if there is an $(S,n)$-encoder with anticipation $t$, then a version of the state-splitting algorithm can be applied to produce an $(S,n)$ encoder with anticipation at most $2t-1$. We also observe that the problem of checking whether there is an $(S,n)$-encoder having a sliding-block decoder with a given memory and anticipation is decidable.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0866), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page
Computer science department, Technion