Observability, Controllability and Local Reducibility of Linear Codes on Graphs

Details Observability, Controllability and Local Reducibility of Linear Codes on Graphs Observability, Controllability and Local Reducibility of Linear Codes on Graphs

2012-02-02

arxiv.org/abs/1202.0534v1

Computer Science

Information Theory

5 pages; submitted to the 2012 IEEE International Symposium on Information Theory

Scientific paper

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 linear realization is locally reducible if any constraint code is not both trim and proper. On a finite cycle-free graph, a linear realization is minimal if and only if every constraint code is both trim and proper. A linear realization is called observable if it is one-to-one, and controllable if all constraints are independent. Observability and controllability are dual properties. An unobservable or uncontrollable realization is locally reducible. A parity-check realization is uncontrollable if and only if it has redundant parity checks. A tail-biting trellis realization is uncontrollable if and only if its trajectories partition into disconnected subrealizations. General graphical realizations do not share this property.

Affiliated with

Also associated with

No associations

Rating

Observability, Controllability and Local Reducibility of Linear Codes on Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Observability, Controllability and Local Reducibility of Linear Codes on Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Observability, Controllability and Local Reducibility of Linear Codes on Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-3490