|
![]() |
|||
|
||||
OverviewCoding theory, system theory, and symbolic dynamics have much in common. Among the central themes in each of these subjects are the construction of state space representations, understanding of fundamental structural properties of sequence spaces, construction of input/output systems, and understanding the special role played by algebraic structure. A major new theme in this area of research is that of codes and systems based on graphical models. This volume contains survey and research articles from leading researchers at the interface of these subjects. Full Product DetailsAuthor: Brian Marcus , Joachim RosenthalPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2001 ed. Volume: 123 Dimensions: Width: 15.50cm , Height: 2.80cm , Length: 23.50cm Weight: 0.819kg ISBN: 9781461265344ISBN 10: 1461265347 Pages: 513 Publication Date: 13 July 2013 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of Contents1. Overviews.- An introduction to the analysis of iterative coding systems.- Connections between linear systems and convolutional codes.- Multi-dimensional symbolic dynamical systems.- 2. Codes on Graphs.- Linear-congruence constructions of low-density parity-check codes.- On the effective weights of pseudocodewords for codes defined on graphs with cycles.- Evaluation of Gallager codes for short block length and high rate applications.- Two small Gallager codes.- Mildly non-linear codes.- Capacity-achieving sequences.- Hypertrellis: A generalization of trellis and factor graph.- 3: Decoding Techniques.- BSC thresholds for code ensembles based on “typical pairs” decoding.- Properties of the tailbiting BCJR decoder.- Iterative decoding of tail-biting trellises and connections with symbolic dynamics.- Algorithms for decoding and interpolation.- An algebraic description of iterative decoding schemes.- Recursive construction of Gröbner bases for the solution of polynomial congruences.- On iterative decoding of cycle codes of graphs.- 4. Convolutional Codes and Codes Over Rings.- Convolutional codes over finite Abelian groups: Some basic results.- Symbolic dynamics and convolutional codes.- Linear codes and their duals over artinian rings.- Unit memory convolutional codes with maximum distance.- Basic properties of multidimensional convolutional codes.- 5. Symbolic Dynamics and Automata Theory.- Length distributions and regular sequences.- Handelman’s theorem on polynomials with positive multiples.- Topological dynamics of cellular automata.- A spanning tree invariant for Markov shifts.- List of workshop participants.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |