Abstract
Cycle-free graphical realizations of linear codes generalize trellis realizations. Given a linear code C and a cycle-free graph topology, there exists a well-defined minimal realization for C on that graph in which each constraint is a linear code with a well-defined length and dimension. The constraint complexity of the realization is defined as maximum dimension of any constraint code. There exists a graph that minimizes constraint complexity in which all internal nodes have degree 3 and all interface nodes have degree 2, and which moreover can be put in the form of a "tree-structured trellis realization." The constraint complexity of a general cycle-free graph realization can be less than that of any conventional trellis realization, but not by very much. Such realizations can yield reductions in decoding complexity even when they do not reduce constraint complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
