Title :
Sliding-block decodable encoders between (d,k) runlength-limited constraints of equal capacity
Author :
Kashyap, Navin ; Siegel, Paul H.
Author_Institution :
Dept. of Math. & Stat., Queen´´s Univ., Kingston, Ont., Canada
fDate :
6/1/2004 12:00:00 AM
Abstract :
We determine the pairs of (d,k)-constrained systems, S(d,k) and S(dˆ,kˆ), of equal capacity, for which there exists a rate 1:1 sliding-block-decodable encoder from S(d,k) to S(dˆ,kˆ). In all cases where there exists such an encoder, we explicitly describe the encoder and its corresponding sliding-block decoder.
Keywords :
binary sequences; block codes; decoding; runlength codes; (d, k) runlength-limited constrained system; finite-state encoder; sliding-block decoder; sliding-block-decodable encoder; Binary sequences; Clocks; Decoding; Interference constraints; Magnetic circuits; Magnetic recording; Mathematics; Optical recording; Statistics; Upper bound; $-constrained systems; $; d,k; finite-state encoders; sliding-block decoders;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.828145