{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:56Z","timestamp":1761292916885},"publisher-location":"New York, NY","reference-count":26,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781441923264"},{"type":"electronic","value":"9780387216966"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-0-387-21696-6_16","type":"book-chapter","created":{"date-parts":[[2012,5,5]],"date-time":"2012-05-05T09:48:38Z","timestamp":1336211318000},"page":"469-492","source":"Crossref","is-referenced-by-count":16,"title":["On Factor Graphs and Electrical Networks"],"prefix":"10.1007","author":[{"given":"Pascal O.","family":"Vontobel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Andrea","family":"Loeliger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Special issue on \u201cCodes on graphs and iterative decoding.\u201d IEEE Trans. Inform. Theory, 47(2), Feb. 2001."},{"key":"16_CR2","volume-title":"Convex Optimization","author":"S Boyd","year":"2001","unstructured":"S. Boyd and L. Vandenberghe, Convex Optimization. Preprint of book, 2001."},{"key":"16_CR3","first-page":"1224","volume-title":"A circuit theory of the Kalman filter","author":"DW Carter","year":"1993","unstructured":"D.W. Carter, \u201cA circuit theory of the Kalman filter,\u201d Proc. 32nd Conf. on Decision and Control (San Antonio, TX, USA), pp. 1224\u20131226, Dec. 1993."},{"key":"16_CR4","first-page":"121","volume-title":"Influence Diagrams, Belief Nets, and Decision Analysis","author":"AP Dempster","year":"1990","unstructured":"A.P. Dempster, \u201cConstruction and local computation aspects of network be lief functions,\u201d in Influence Diagrams, Belief Nets, and Decision Analysis, R.M. Oliver and J.Q. Smith, eds., Wiley 1990, pp. 121\u2013141."},{"key":"16_CR5","volume-title":"Normal belief functions and the Kalman filter","author":"AP Dempster","year":"1990","unstructured":"A.P. Dempster, \u201cNormal belief functions and the Kalman filter,\u201d Dept. Statistics Harvard Univ., Cambridge, MA, May 1990."},{"key":"16_CR6","volume-title":"Mathematical Programming and Electrical Networks","author":"JB Dennis","year":"1959","unstructured":"J.B. Dennis, Mathematical Programming and Electrical Networks. Jointly by MIT Press, John Wiley, and Chapman & Hall, 1959."},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/18.910573","volume":"47","author":"GD Forney Jr.","year":"2001","unstructured":"G.D. Forney, Jr., \u201cCodes on graphs: normal realizations,\u201d IEEE Trans. Inform. Theory, 47(2): 520\u2013548, 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"RG Gallager","year":"1963","unstructured":"R.G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963."},{"key":"16_CR9","volume-title":"An Introduction to Bayesian Networks","author":"FV Jensen","year":"1996","unstructured":"F.V. Jensen, An Introduction to Bayesian Networks, New York: Springer Verlag, 1996."},{"key":"16_CR10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3349.001.0001","volume-title":"An Introduction to Graphical Models","author":"MI Jordan","year":"2001","unstructured":"M.I. Jordan and C. M. Bishop, An Introduction to Graphical Models. Preprint of book, 2001."},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/001","volume-title":"Markov Random Fields and their Applications","author":"R Kindermann","year":"1980","unstructured":"R. Kindermann and J.L. Snell, Markov Random Fields and their Applications, Providence, Rhode Island: American Mathematical Society, 1980."},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"FR Kschischang","year":"2001","unstructured":"F.R. Kschischang, B.J. Frey, and H.-A. Loeliger, \u201cFactor graphs and the sum-product algorithm,\u201d IEEE Trans. Inform. Theory, 47(2): 498\u2013519, 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"S.L. Lauritzen and D.J. Spiegelhalter, \u201cLocal computations with probabilities on graphical structures and their application to expert systems (with discussion),\u201d J. Royal Stat. Soc., Series B, 50: 157\u2013224, 1988.","journal-title":"J. Royal Stat. Soc., Series B"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/9.533675","volume":"41","author":"BC Levy","year":"1996","unstructured":"B.C. Levy, A. Benveniste, and R. Nikoukhah, \u201cHigh-level primitives for recursive maximum-likelihood estimation,\u201d IEEE Trans. Automatic Control, 41: 1125\u20131145, Aug. 1996.","journal-title":"IEEE Trans. Automatic Control"},{"key":"16_CR15","volume-title":"Codes, Graphs, and Systems","author":"H-A Loeliger","year":"2002","unstructured":"H.-A. Loeliger, \u201cLeast squares and Kalman filtering on Forney graphs,\u201d in Codes, Graphs, and Systems, festschrift in honor of G.D. Forney, Jr., Kluwer, 2002."},{"key":"16_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1639-8","volume-title":"Analog VLSI and Neural Systems","author":"C Mead","year":"1989","unstructured":"C. Mead, Analog VLSI and Neural Systems. Reading, MA: Addison-Wesley, 1989."},{"key":"16_CR17","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J Pearl","year":"1988","unstructured":"J. Pearl, Probabilistic Reasoning in Intelligent Systems, 2nd ed. San Francisco: Morgan Kaufmann, 1988.","edition":"2"},{"key":"16_CR18","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis. Princeton, N.J.: Princeton University Press, 1970."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1109\/18.910586","volume":"47","author":"P Rusmevichientong","year":"2001","unstructured":"P. Rusmevichientong and B. Van Roy, \u201cAn analysis of belief propagation on the turbo decoding graph with Gaussian densities,\u201d IEEE Trans. Inform. Theory, 47: 745\u2013765, Feb. 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"27","author":"RM Tanner","year":"1981","unstructured":"R.M. Tanner, \u201cA recursive approach to low complexity codes,\u201d IEEE Trans. Inform. Theory, IT-27: 533\u2013547, Sept. 1981.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR21","volume-title":"Kalmanfiltering, factor graphs, and electrical networks","author":"PO Vontobel","year":"2002","unstructured":"P.O. Vontobel, D. Lippuner, and H.-A. Loeliger, \u201cKalman filtering, factor graphs, and electrical networks.\u201d Proc. 15th Int. Symp. on Math. Theory of Networks and Systems, South Bend, IN, USA, Aug. 12\u201316, 2002."},{"key":"16_CR22","unstructured":"P.O. Vontobel, Kalman Filters, Factor Graphs, and Electrical Networks. Internal report INT\/200202, ISI-ITET, ETH Zurich, April 2002."},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y Weiss","year":"2001","unstructured":"Y. Weiss and W.T. Freeman, \u201cOn the optimality of the max-product belief propagation algorithm in arbitrary graphs,\u201d IEEE Trans. Inform. Theory 47(2): 736\u2013744, 2001.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1002\/ett.4460060507","volume":"6","author":"N Wiberg","year":"1995","unstructured":"N. Wiberg, H.-A. Loeliger, and R. Kotter, \u201cCodes and iterative decoding on general graphs,\u201d Europ. Trans. Telecomm., 6: 513\u2013525, Sept\/Oct. 1995.","journal-title":"Europ. Trans. Telecomm."},{"key":"16_CR25","volume-title":"Codes and Decoding on General Graphs","author":"N Wiberg","year":"1996","unstructured":"N. Wiberg, Codes and Decoding on General Graphs. Ph.D. thesis, Link\u00f6ping University, Sweden, 1996."},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/9.73561","volume":"36","author":"JC Willems","year":"1991","unstructured":"J.C. Willems, \u201cParadigms and puzzles in the theory of dynamical systems,\u201d IEEE Trans. Automat. Control, 36(3): 259\u2013294, 1991.","journal-title":"IEEE Trans. Automat. Control"}],"container-title":["The IMA Volumes in Mathematics and its Applications","Mathematical Systems Theory in Biology, Communications, Computation, and Finance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-21696-6_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T06:00:29Z","timestamp":1713938429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-21696-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9781441923264","9780387216966"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-21696-6_16","relation":{},"ISSN":["0940-6573"],"issn-type":[{"type":"print","value":"0940-6573"}],"subject":[],"published":{"date-parts":[[2003]]}}}