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ț: 946.55 lei
- 15% Preț: 639.73 lei
- 15% Preț: 656.58 lei
- 15% Preț: 642.03 lei
- 15% Preț: 645.28 lei
- Preț: 392.21 lei
- 15% Preț: 642.83 lei
- 15% Preț: 651.67 lei
- 15% Preț: 651.19 lei
- Preț: 385.84 lei
- 15% Preț: 639.41 lei
- 15% Preț: 643.34 lei
- 15% Preț: 667.38 lei
- Preț: 388.34 lei
- Preț: 388.52 lei
- 20% Preț: 333.40 lei
- 15% Preț: 644.95 lei
- Preț: 382.75 lei
- Preț: 380.63 lei
- Preț: 398.53 lei
- 5% Preț: 1416.81 lei
- Preț: 382.36 lei
- Preț: 380.25 lei
- Preț: 399.67 lei
- 15% Preț: 643.65 lei
- Preț: 389.49 lei
- 18% Preț: 944.19 lei
- 18% Preț: 948.92 lei
- 5% Preț: 1419.39 lei
- 18% Preț: 945.30 lei
Preț: 344.42 lei
Preț vechi: 430.53 lei
-20% Nou
Puncte Express: 517
Preț estimativ în valută:
65.91€ • 68.00$ • 55.79£
65.91€ • 68.00$ • 55.79£
Carte tipărită la comandă
Livrare economică 04-18 martie
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.