Codes, systems, and graphical models. IMA workshop, Minneapolis, MN, USA, August 2--13, 1999 (Q5931582)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Richardson, Tom; Urbanke, Rüdiger}, An introduction to the analysis of iterative coding systems, 1-37 [Zbl 0995.94553] \textit{Rosenthal, Joachim}, Connections between linear systems and convolutional codes, 39-66 [Zbl 0993.94559] \textit{Schmidt, Klaus}, Multi-dimensional symbolic dynamical systems, 67-82 [Zbl 0990.37011] \textit{Bond, J.; Hui, S.; Schmidt, H.}, Linear-congruence constructions of low-density parity-check codes, 83-100 [Zbl 1005.94539] \textit{Forney, G. David jun.; Koetter, Ralf; Kschischang, Frank R.; Reznik, Alex}, On the effective weights of pseudocodewords for codes defined on graphs with cycles, 101-112 [Zbl 1005.94540] \textit{MacKay, David J. C.; Davey, Matthew C.}, Evaluation of Gallager codes for short block length and high rate applications, 113-133 [Zbl 0995.94035] \textit{MacKay, David J. C.; Davey, Matthew C.}, Two small Gallager codes, 131-133 [Zbl 0991.94058] \textit{Parks, Alan}, Mildly nonlinear codes, 135-151 [Zbl 0995.94557] \textit{Shokrollahi, M. A.}, Capacity-achieving sequences, 153-166 [Zbl 0994.94519] \textit{Mow, Wai Ho}, Hypertrellis: A generalization of trellis and factor graph, 167-194 [Zbl 0993.94560] \textit{Aji, Srinivas; Jin, Hui; Khandekar, Aamod; MacKay, David J. C.; McEliece, Robert J.}, BSC thresholds for code ensembles based on ``typical pairs'' decoding, 195-210 [Zbl 0996.94530] \textit{Anderson, John B.; Tepe, Kemal E.}, Properties of the tailbiting BCJR decoder, 211-238 [Zbl 1007.94020] \textit{Forney, G. David jun.; Kschischang, Frank R.; Marcus, Brian; Tuncel, Selim}, Iterative decoding of tail-biting trellises and connections with symbolic dynamics, 239-264 [Zbl 0992.94032] \textit{Kuijper, Margreet}, Algorithms for decoding and interpolation, 265-282 [Zbl 0990.94033] \textit{Offer, Elke; Soljanin, Emina}, An algebraic description of iterative decoding schemes, 283-298 [Zbl 0996.94533] \textit{O'Keeffe, Henry; Fitzpatrick, Patrick}, Recursive construction of Gröbner bases for the solution of polynomial congruences, 299-309 [Zbl 0998.13013] \textit{Zémor, Gilles}, On iterative decoding of cycle codes of graphs, 311-326 [Zbl 0992.94035] \textit{Fagnani, Fabio; Zampieri, Sandro}, Convolutional codes over finite abelian groups: Some basic results, 327-346 [Zbl 1006.94025] \textit{Kitchens, Bruce}, Symbolic dynamics and convolutional codes, 347-360 [Zbl 0993.94558] \textit{Mittelholzer, Thomas}, Linear codes and their duals over artinian rings, 361-379 [Zbl 1015.94012] \textit{Smarandache, Roxana}, Unit memory convolutional codes with maximum distance, 381-396 [Zbl 1007.94019] \textit{Weiner, Paul}, Basic properties of multidimensional convolutional codes, 397-414 [Zbl 1021.94021] \textit{Bassino, Frédérique; Béal, Marie-Pierre; Perrin, Dominique}, Length distributions and regular sequences, 415-437 [Zbl 0992.94504] \textit{de Angelis, Valerio; Tuncel, Selim}, Handelman's theorem on polynomials with positive multiples., 439-445 [Zbl 1091.13507] \textit{Kůrka, Petr}, Topological dynamics of cellular automata., 447-485 [Zbl 1198.37019] \textit{Lind, Douglas; Tuncel, Selim}, A spanning tree invariant for Markov shifts, 487-497 [Zbl 1030.37005]