Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
The work of Karabed and Marcus on constructing finite-state codes between constrained systems called sofic systems is continued. It is shown that if Σ is a shift of finite type and S is a sofic system with k/n=h(s)/h(Σ) where h denotes entropy, there is a noncatastrophic finite-state invertible code from Σ to S at rate k : n if: 1) Σ and S satisfy a certain algebraic condition involving dimension groups, and 2) Σ and S satisfy a certain condition on their periodic point. Moreover, if S is an almost finite type sofic system then the decoder can be sliding block. © 1993, IEEE. All rights reserved.
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)