Cantitate/Preț
Produs

Codes, Systems, and Graphical Models: The IMA Volumes in Mathematics and its Applications, cartea 123

Editat de Brian Marcus, Joachim Rosenthal
en Limba Engleză Paperback – 13 iul 2013
Coding 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.
Citește tot Restrânge

Din seria The IMA Volumes in Mathematics and its Applications

Preț: 33147 lei

Preț vechi: 41434 lei
-20% Nou

Puncte Express: 497

Preț estimativ în valută:
6344 6693$ 5287£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781461265344
ISBN-10: 1461265347
Pagini: 540
Ilustrații: XIII, 513 p. 18 illus.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.75 kg
Ediția:2001
Editura: Springer
Colecția Springer
Seria The IMA Volumes in Mathematics and its Applications

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

1. 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.