Codes on Graphs: Observability, Controllability, and Local Reducibility
From MaRDI portal
Publication:2989455
DOI10.1109/TIT.2012.2217312zbMATH Open1364.94677arXiv1203.3115OpenAlexW1969010274MaRDI QIDQ2989455FDOQ2989455
Authors: Heide Gluesing-Luerssen, G. David jun. Forney 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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 constraint codes. A linear or group realization with a constraint code that is not both trim and proper is locally reducible. A linear or group realization on a finite cycle-free graph is minimal if and only if every local constraint code is trim and proper. A realization is called observable if there is a one-to-one correspondence between codewords and configurations, and controllable if it has independent constraints. A linear or group realization is observable if and only if its dual is controllable. A simple counting test for controllability is given. An unobservable or uncontrollable realization is locally reducible. Parity-check realizations are controllable if and only if they have independent parity checks. In an uncontrollable tail-biting trellis realization, the behavior partitions into disconnected subbehaviors, but this property does not hold for non-trellis realizations. On a general graph, the support of an unobservable configuration is a generalized cycle.
Full work available at URL: https://arxiv.org/abs/1203.3115
Cited In (1)
This page was built for publication: Codes on Graphs: Observability, Controllability, and Local Reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989455)
