FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
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.
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Limin Hu
IEEE/ACM Transactions on Networking
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Quinn Pham, Danila Seliayeu, et al.
CASCON 2024