185 citations · 467 across the 15 of their papers we have counts for
16 papers
Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions
G. David Forney
The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller gran…
Codes on Graphs: Fundamentals
G. David Forney
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal…
Codes on Graphs: Observability, Controllability and Local Reducibility
G. David Forney, Heide Gluesing-Luerssen
This paper investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility. Trimness and properness are dual properties of constr…
Reducing complexity of tail-biting trellises
Heide Gluesing-Luerssen, G. David Forney
It is shown that a trellis realization can be locally reduced if it is not state-trim, branch-trim, proper, observable, and controllable. These conditions are not sufficient for lo…
Observability, Controllability and Local Reducibility of Linear Codes on Graphs
G. David Forney, Heide Gluesing-Luerssen
This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs. Trimness and properness are dual properties of constraint codes. A…
Partition Functions of Normal Factor Graphs
G. David Forney, Pascal O. Vontobel
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of prod…