Alphabet Size Matching Techniques Based on Non-Binary Gilbert-Varshamov Bounded Limits for Synchronization Finite State Markov Channel.
Shamin AchariLing ChengPublished in: IEEE Access (2023)
Keyphrases
- finite state
- non binary
- markov chain
- constraint satisfaction problems
- alphabet size
- markov decision processes
- model checking
- binary representation
- matching algorithm
- channel coding
- optimal policy
- pattern matching
- graph matching
- tree automata
- markov processes
- transition systems
- constraint satisfaction
- state space
- constraint programming
- frequent pattern mining
- hidden variables
- error correction
- search space
- small number
- special case