Titlebook: Codes, Systems, and Graphical Models; Brian Marcus,Joachim Rosenthal Conference proceedings 2001 Springer Science+Business Media New York

CULP

Recursive Construction of GrÖbner Bases for the Solution of Polynomial CongruencesA number of questions in systems theory and coding theory can be formulated as the solution of a system of polynomial congruences in one or more variables. We present a new generalised algorithm, based on Gröbner basis techniques, that recursively solves a wide class of such problems.

glacial

善于骗人

Connections Between Linear Systems and Convolutional Codesions are worked out in detail. It is shown that bi-infinite support systems are dual to finite-support systems under Pontryagin duality. In this duality the dual of a controllable system is observable and vice versa. Uncontrollability can occur only if there are bi-infinite support trajectories in t

palette

制定

Linear-Congruence Constructions of Low-Density Parity-Check Codespreviously discussed in the literature have involved matrices constructed using random techniques. In this paper, we discuss construction techniques for LDPCC involving multiple permutation matrices, each specified by a linear congruence. Construction options depend on the size of the parity-check m

CUR

兵团

fibula

ARCHE

Hypertrellis: A Generalization of Trellis and Factor Graphn that a factor graph generalizes only the time axis of a trellis, but omits the state transition representation. In this paper, a new graphical model, called the hypertrellis, is proposed to overcome this insufficiency of factor graphs. A hypertrellis is in essence a weighted hypergraph generalizat

Commonplace