5 citations found. Retrieving documents...
G.D. Forney, Jr., B.H. Marcus, N.T. Sindhushayana, and M.D.Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics and automata theory," in Different Aspects of Coding Theory, A.R. Calderbank (Editor), vol. 50, pp. 109--138, Proc. Symp. Applied Mathematics, Providence, RI: AMS Press, 1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha (2002)   (Correct)

....is the constraint defined by the FSTD. Such constraints have been studied in systems theory, information and coding theory, computer science, and symbolic dynamics under the respective names of dynamical systems, discrete noiseless channels, regular languages, and sofic systems; see, Forney et al. [4] and Marcus [5] These concepts are now illustrated by an example. A class of constraints that are useful in magnetic recording are the runlength limited (RLL) constraints. For nonnegative integers and , the RLL constraint contains all binary words such that, between every two consecutive s, ....

G. D. Forney, Jr., B. Marcus, N. T. Sindhushayana, and M. Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics, and automata theory," in Proc. Symp. Applied Mathematics, vol. 50, 1995, pp. 109--138.


Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha   (Correct)

....is the constraint defined by the FSTD. Such constraints have been studied in systems theory, information coding theory, computer science, and symbolic dynamics under the respective names of dynamical systems, discrete noiseless channels, regular languages, and sofic systems; see, Forney et al. [4] and Marcus [5] These concepts are now illustrated by an example. A class of constraints that are useful in magnetic recording are the run length limited (RLL) constraints. For nonnegative integers d and k, the RLL(d; k) constraint contains all binary words such that, between every two ....

G. D. Forney, Jr., B. Marcus, N. T. Sindhushayana, and M. Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics, and automata theory," in Proc. Symp. Appl. Math., vol. 50, pp. 109--138, 1995.


Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha   (Correct)

....1; otherwise, it is nondeterministic. Such constraints have been studied in systems theory, information coding theory, computer science, and symbolic dynamics under the respective names of dynamical systems, discrete noiseless channels, regular languages, and sofic systems; see, Forney et al. [4] and Marcus [5] Suppose we are given an FSTD, that is, a finite, directed, labeled graph. A finite binary word generated by following some walk on the graph from some (arbitrary) state to another (possibly the same, arbitrary) state is known as a constrained sequence. The set of all such ....

G. D. Forney, Jr., B. Marcus, N. T. Sindhushayana, and M. Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics, and automata theory," in Proc. Symp. Appl. Math., vol. 50, pp. 109--138, 1995.


Ordered Binary Decision Diagrams and Minimal Trellises - Lafferty, Vardy (1998)   (1 citation)  (Correct)

....set. It follows that when the distance of C is larger than one, the state diagram of its DFA is the same as the minimal proper trellis, or the single terminal OBDD. This viewpoint is briefly mentioned in the multilingual dictionary of coding, systems theory, symbolic dynamics, and automata theory [35]. 5. Directions for transfer of ideas The connection between binary decision diagrams and trellises established in the previous section makes it possible to translate knowledge accumulated in one discipline into the language of the other. We will give just a few examples of this in what follows. ....

G.D. Forney, Jr., B.H. Marcus, N.T. Sindhushayana, and M.D.Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics and automata theory," in Different Aspects of Coding Theory, A.R. Calderbank (Editor), vol. 50, pp. 109--138, Proc. Symp. Applied Mathematics, Providence, RI: AMS Press, 1995.


Ordered Binary Decision Diagrams - And Minimal Trellises   (Correct)

No context found.

G.D. Forney, Jr., B.H. Marcus, N.T. Sindhushayana, and M.D.Trott, "Multilingual dictionary: System theory, coding theory, symbolic dynamics and automata theory," in Different Aspects of Coding Theory, A.R. Calderbank (Editor), vol. 50, pp. 109--138, Proc. Symp. Applied Mathematics, Providence, RI: AMS Press, 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC