Title :
Asymptotically optimal deterministic encoders for constrained systems
Author :
Chaichanavong, Panu ; Marcus, Brian H.
Author_Institution :
Stanford Univ., CA, USA
Abstract :
A constrained system or constraint S=SG is the set of all finite sequences generated by a labeled graph G by reading the labels along walks on the graph. We say that G is a presentation of S. A graph G is deterministic if at each state, the outgoing edges are labeled distinctly. Some well-known constraints include runlength limited RLL(d,k) and maximum transition run MTR(j,k). A deterministic presentation of MTR(j,k) is shown.
Keywords :
constraint theory; encoding; graph theory; runlength codes; asymptotically optimal deterministic encoders; constrained systems; deterministic presentation; finite sequences; labeled graph; maximum transition run constraint; runlength limited constraint; Application specific integrated circuits; Codes; Decoding; Eigenvalues and eigenfunctions;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023601
