Codes, Systems, and Graphical Models: The IMA Volumes in Mathematics and its Applications, cartea 123
Editat de Brian Marcus, Joachim Rosenthalen Limba Engleză Paperback – 13 iul 2013
This volume contains survey and research articles from leading researchers at the interface of these subjects.
Din seria The IMA Volumes in Mathematics and its Applications
- 18% Preț: 896.50 lei
- 15% Preț: 605.98 lei
- 15% Preț: 621.93 lei
- 15% Preț: 608.16 lei
- 15% Preț: 611.24 lei
- Preț: 371.64 lei
- 15% Preț: 608.91 lei
- 15% Preț: 617.28 lei
- 15% Preț: 616.84 lei
- Preț: 365.61 lei
- 15% Preț: 605.68 lei
- 15% Preț: 609.40 lei
- 15% Preț: 632.17 lei
- Preț: 367.98 lei
- Preț: 368.14 lei
- 20% Preț: 315.90 lei
- 15% Preț: 610.93 lei
- Preț: 362.69 lei
- Preț: 360.68 lei
- Preț: 377.62 lei
- 5% Preț: 1341.82 lei
- Preț: 362.32 lei
- Preț: 360.31 lei
- Preț: 378.71 lei
- 15% Preț: 609.69 lei
- Preț: 369.06 lei
- 18% Preț: 894.26 lei
- 18% Preț: 898.74 lei
- 5% Preț: 1344.26 lei
- 18% Preț: 895.30 lei
Preț: 326.34 lei
Preț vechi: 407.93 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
62.51€ • 67.76$ • 51.96£
62.51€ • 67.76$ • 51.96£
Carte tipărită la comandă
Livrare economică 02-16 decembrie
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
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ă
ResearchCuprins
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.