An Iterative Matrix-Based Procedure for Finding the Shannon Cover for Constrained Sequences
In many applications such as coding for magnetic and optical recording, the determination of the graph with the fewest vertices (i.e., the Shannon cover) presenting a given set of constrained sequences (i.e., shift of finite type) is very important. The main contribution of this paper is an efficient iterative vertex-minimization algorithm, which manipulates the symbolic adjacency matrix associated with an initial graph presenting a shift of finite type. A characterization of this initial graph is given. By using the matrix representation, the minimization procedure to finding the Shannon cover becomes easy to implement using a symbolic manipulation program, such as Maple.
Unable to display preview. Download preview PDF.
- 2.Immink, K.A.S.: Coding Techniques for Digital Recorders. Prentice-Hall, Englewoods Cliffs (1991)Google Scholar
- 5.Chaves, D.P.B., Pimentel, C., Uchôa-Filho, B.F.: On the Shannon cover of shifts of finite type. In: Proceedings of the Brazilian Telecommunication Symposium, Rio de Janeiro, Brazil (October 2003)Google Scholar