Codes on Graphs: Fundamentals

DOI10.1109/TIT.2014.2346210MaRDI QIDQ2983381zbMATH OpenFDO

Authors G. David jun. Forney

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.6264

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: 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 new and extended results include: normal realization duality; analysis of systems-theoretic properties of fragments of realizations and their connections; "minimal = trim and proper" theorem for cycle-free codes; results showing that all constraint codes except interface nodes may be assumed to be trim and proper, and that the interesting part of a cyclic realization is its "2-core;" notions of observability and controllability for fragments, and related tests; relations between state-trimness and controllability, and dual state-trimness and observability.

Cited in

(10)

• On codes from hypergraphs.
• On graphs and codes preserved by edge local complementation
• An Introduction to Coding Sequences of Graphs
• Codes on graphs: normal realizations
• scientific article; zbMATH DE number 1897217 (Why is no real title available?)
• scientific article; zbMATH DE number 1440644 (Why is no real title available?)
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Isodual and self-dual codes from graphs
• Structured Codes of Graphs
• Codes on graphs: Recent progress

This page was built for publication: Codes on Graphs: Fundamentals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983381)