Verfügbarkeit: Modern coding theory

Modern coding theory:

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Richardson, Tom (VerfasserIn), Urbanke, Rüdiger (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Cambridge [u.a.] Cambridge Univ. Press 2008
Ausgabe:	1. publ.
Schlagworte:	Codering Dataprocessing Coding theory Codierungstheorie
Online-Zugang:	Verlagsmeldung Inhaltsverzeichnis Inhaltsverzeichnis
Beschreibung:	Includes bibliographical references and index. - Includes Internet access
Beschreibung:	XVI, 572 S. graph. Darst.
ISBN:	9780521852296 0521852293

Internformat

MARC


LEADER	00000nam a22000002c 4500
001	BV023300642
003	DE-604
005	20080807
007	t
008	080515s2008 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9780521852296 \|9 978-0-521-85229-6
020			\|a 0521852293 \|c (hbk.) : £45.00 hbk. \|9 0-521-85229-3
035			\|a (OCoLC)421362560
035			\|a (DE-599)BSZ279026722
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-706 \|a DE-703 \|a DE-29T \|a DE-473 \|a DE-83
084			\|a SK 170 \|0 (DE-625)143221: \|2 rvk
084			\|a ST 276 \|0 (DE-625)143642: \|2 rvk
100	1		\|a Richardson, Tom \|e Verfasser \|4 aut
245	1	0	\|a Modern coding theory \|c Tom Richardson ; Ruediger Urbanke
250			\|a 1. publ.
264		1	\|a Cambridge [u.a.] \|b Cambridge Univ. Press \|c 2008
300			\|a XVI, 572 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
500			\|a Includes bibliographical references and index. - Includes Internet access
650		7	\|a Codering \|2 gtt
650		7	\|a Dataprocessing \|2 gtt
650		4	\|a Coding theory
650	0	7	\|a Codierungstheorie \|0 (DE-588)4139405-7 \|2 gnd \|9 rswk-swf
689	0	0	\|a Codierungstheorie \|0 (DE-588)4139405-7 \|D s
689	0		\|5 DE-604
700	1		\|a Urbanke, Rüdiger \|e Verfasser \|4 aut
856	4		\|u http://www.loc.gov/catdir/enhancements/fy0808/2007039544-d.html \|z lizenzfrei \|3 Verlagsmeldung
856	4		\|u http://www.loc.gov/catdir/enhancements/fy0808/2007039544-t.html \|z lizenzfrei \|3 Inhaltsverzeichnis
856	4	2	\|m HBZ Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-016485105

Datensatz im Suchindex

_version_	1804137628854910976
adam_text	Titel: Modern coding theory Autor: Richardson, Thomas J. Jahr: 2008 CONTENTS Preface • pagexiii 1 Introduction ¦ page i §1.1 Why You Should Read This Book • i §1.2 Communications Problem • 2 §1.3 Coding: Trial and Error ¦ 4 §1.4 Codes and Ensembles • 5 §1.5 MAP and ML Decoding and APP Processing ¦ 9 §1.6 Channel Coding Theorem ¦ 9 §1.7 Linear Codes and Complexity • 13 §1.8 Rate, Probability, Complexity, and Length • 18 §1.9 Tour of Iterative Decoding • 23 §1.10 Notation, Conventions, and Useful Facts • 27 Notes • 32 Problems • 35 References • 44 2 Factor Graphs • page 49 §2.1 Distributive Law • 49 §2.2 Graphical Representation of Factorizations • 50 §2.3 Recursive Determination of Marginals • 51 §2.4 Marginalization via Message Passing • 54 §2.5 Decoding via Message Passing ¦ 57 §2.6 Limitations of Cycle-Free Codes ¦ 64 §2.7 Message Passing on Codes with Cycles • 65 Notes • 65 Problems • 67 References • 68 3 Binary Erasure Channel • page 71 §3.1 Channel Model • 71 §3.2 Transmission via Linear Codes ¦ 72 §3.3 Tanner Graphs • 75 §3.4 Low-Density Parity-Check Codes • 76 §3.5 Message-Passing Decoder • 82 vu Vili CONTENTS §3.6 Two Basic Simplifications • 83 §3.7 Computation Graph and Tree Ensemble • 87 §3.8 Tree Channel and Convergence to Tree Channel • 94 §3.9 Density Evolution • 95 §3.10 Monotonicity • 96 §3.11 Threshold • 97 §3.12 Fixed Point Characterization of Threshold • 98 §3.13 Stability • 100 §3.14 EXIT Charts • 101 §3.15 Capacity-Achieving Degree Distributions • 108 §3.16 Gallager s Lower Bound on Density • 111 §3.17 Optimally Sparse Degree Distribution Pairs • 113 §3.18 Degree Distributions with Given Maximum Degree • 114 §3.19 Peeling Decoder and Order of Limits • 115 §3.20 EXIT Function and MAP Performance • 122 §3.21 Maxwell Decoder • 131 §3.22 Exact Finite-Length Analysis • 134 §3.23 Finite-Length Scaling • 143 §3.24 Weight Distribution and Error Floor • 148 Notes • 156 Problems • 160 References • 169 4 Binary Memoryless Symmetric Channels • page 175 §4.1 Basic Definitions and Examples • 175 §4.2 Message-Passing Decoder • 209 §4.3 Two Basic Simplifications • 214 §4.4 Tree Channel and Convergence to Tree Channel • 216 §4.5 Density Evolution ¦ 217 §4.6 Monotonicity • 221 §4.7 Threshold ¦ 226 §4.8 Fixed Point Characterization of Threshold • 226 §4.9 Stability • 230 §4.10 EXIT Charts • 234 §4.11 Gallager s Lower Bound on Density ¦ 245 §4.12 GEXIT Function and MAP Performance • 249 §4.13 Finite-Length Scaling • 257 §4.14 Error Floor under MAP Decoding • 258 IX Notes • 261 Problems • 267 References ¦ 283 5 General Channels • page 291 §5.1 Fading Channel • 291 §5.2 Z Channel ¦ 294 §5.3 Channels with Memory ¦ 297 §5.4 Coding for High Spectral Efficiency • 303 §5.5 Multiple-Access Channel • 308 Notes ¦ 312 Problems • 314 References • 316 6 Turbo Codes • page 323 §6.1 Convolutional Codes • 323 §6.2 Structure and Encoding • 334 §6.3 Decoding ¦ 336 §6.4 Basic Simplifications • 339 §6.5 Density Evolution • 341 §6.6 Stability Condition ¦ 344 §6.7 EXIT Charts • 346 §6.8 GEXIT Function and MAP Performance • 347 §6.9 Weight Distribution and Error Floor ¦ 349 §6.10 Variations on the Theme • 363 Notes • 365 Problems • 369 References • 375 7 General Ensembles • page 381 §7.1 Multi-Edge-Type LDPC Code Ensembles • 382 §7.2 Multi-Edge-Type LDPC Codes: Analysis • 389 §7.3 Structured Codes • 397 §7.4 Non-Binary Codes • 405 §7.5 Low-Density Generator Codes and Rateless Codes • 410 Notes • 418 Problems • 421 References • 421 X CONTENTS 8 Expander Codes and Flipping Algorithm • page 427 §8.1 Building Codes from Expanders • 427 §8.2 Flipping Algorithm • 428 §8.3 Bound on Expansion of a Graph • 429 §8.4 Expansion of a Random Graph • 431 Notes ¦ 434 Problems • 435 References • 435 A Encoding Low-Density Parity-Check Codes • page 437 §A.i Encoding Generic LDPC Codes • 437 §A.2 Greedy Upper Triangulation • 443 §A.3 Linear Encoding Complexity • 448 §A.4 Analysis of Asymptotic Gap • 452 Notes • 456 Problems • 456 References • 457 B Efficient Implementation of Density Evolution • page 459 §B.i Quantization • 460 §B.2 Variable-Node Update via Fourier Transform • 460 §B.3 Check-Node Update via Table Method ¦ 462 §B.4 Check-Node Update via Fourier Method • 464 Notes • 477 Problems • 477 References ¦ 478 C Concentration Inequalities • page 479 §C.i First and Second Moment Method • 480 §C.2 Bernstein s Inequality • 482 §C.3 Martingales • 484 §C.4 Wormald s Differential Equation Approach • 490 §C.5 Convergence to Poisson Distribution ¦ 497 Notes • 500 Problems ¦ 501 References • 502 D Formal Power Sums • page 505 §D.i Definition • 505 §D.2 Basic Properties • 505 XI §D.3 Summation of Subsequences ¦ 506 §D.4 Coefficient Growth of Powers of Polynomials • 507 §D.5 Unimodality • 529 Notes • 529 Problems • 530 References • 535 E Convexity, Degradation, and Stability • page 537 Authors • page 551 Index • page 559
adam_txt	Titel: Modern coding theory Autor: Richardson, Thomas J. Jahr: 2008 CONTENTS Preface • pagexiii 1 Introduction ¦ page i §1.1 Why You Should Read This Book • i §1.2 Communications Problem • 2 §1.3 Coding: Trial and Error ¦ 4 §1.4 Codes and Ensembles • 5 §1.5 MAP and ML Decoding and APP Processing ¦ 9 §1.6 Channel Coding Theorem ¦ 9 §1.7 Linear Codes and Complexity • 13 §1.8 Rate, Probability, Complexity, and Length • 18 §1.9 Tour of Iterative Decoding • 23 §1.10 Notation, Conventions, and Useful Facts • 27 Notes • 32 Problems • 35 References • 44 2 Factor Graphs • page 49 §2.1 Distributive Law • 49 §2.2 Graphical Representation of Factorizations • 50 §2.3 Recursive Determination of Marginals • 51 §2.4 Marginalization via Message Passing • 54 §2.5 Decoding via Message Passing ¦ 57 §2.6 Limitations of Cycle-Free Codes ¦ 64 §2.7 Message Passing on Codes with Cycles • 65 Notes • 65 Problems • 67 References • 68 3 Binary Erasure Channel • page 71 §3.1 Channel Model • 71 §3.2 Transmission via Linear Codes ¦ 72 §3.3 Tanner Graphs • 75 §3.4 Low-Density Parity-Check Codes • 76 §3.5 Message-Passing Decoder • 82 vu Vili CONTENTS §3.6 Two Basic Simplifications • 83 §3.7 Computation Graph and Tree Ensemble • 87 §3.8 Tree Channel and Convergence to Tree Channel • 94 §3.9 Density Evolution • 95 §3.10 Monotonicity • 96 §3.11 Threshold • 97 §3.12 Fixed Point Characterization of Threshold • 98 §3.13 Stability • 100 §3.14 EXIT Charts • 101 §3.15 Capacity-Achieving Degree Distributions • 108 §3.16 Gallager's Lower Bound on Density • 111 §3.17 Optimally Sparse Degree Distribution Pairs • 113 §3.18 Degree Distributions with Given Maximum Degree • 114 §3.19 Peeling Decoder and Order of Limits • 115 §3.20 EXIT Function and MAP Performance • 122 §3.21 Maxwell Decoder • 131 §3.22 Exact Finite-Length Analysis • 134 §3.23 Finite-Length Scaling • 143 §3.24 Weight Distribution and Error Floor • 148 Notes • 156 Problems • 160 References • 169 4 Binary Memoryless Symmetric Channels • page 175 §4.1 Basic Definitions and Examples • 175 §4.2 Message-Passing Decoder • 209 §4.3 Two Basic Simplifications • 214 §4.4 Tree Channel and Convergence to Tree Channel • 216 §4.5 Density Evolution ¦ 217 §4.6 Monotonicity • 221 §4.7 Threshold ¦ 226 §4.8 Fixed Point Characterization of Threshold • 226 §4.9 Stability • 230 §4.10 EXIT Charts • 234 §4.11 Gallager's Lower Bound on Density ¦ 245 §4.12 GEXIT Function and MAP Performance • 249 §4.13 Finite-Length Scaling • 257 §4.14 Error Floor under MAP Decoding • 258 IX Notes • 261 Problems • 267 References ¦ 283 5 General Channels • page 291 §5.1 Fading Channel • 291 §5.2 Z Channel ¦ 294 §5.3 Channels with Memory ¦ 297 §5.4 Coding for High Spectral Efficiency • 303 §5.5 Multiple-Access Channel • 308 Notes ¦ 312 Problems • 314 References • 316 6 Turbo Codes • page 323 §6.1 Convolutional Codes • 323 §6.2 Structure and Encoding • 334 §6.3 Decoding ¦ 336 §6.4 Basic Simplifications • 339 §6.5 Density Evolution • 341 §6.6 Stability Condition ¦ 344 §6.7 EXIT Charts • 346 §6.8 GEXIT Function and MAP Performance • 347 §6.9 Weight Distribution and Error Floor ¦ 349 §6.10 Variations on the Theme • 363 Notes • 365 Problems • 369 References • 375 7 General Ensembles • page 381 §7.1 Multi-Edge-Type LDPC Code Ensembles • 382 §7.2 Multi-Edge-Type LDPC Codes: Analysis • 389 §7.3 Structured Codes • 397 §7.4 Non-Binary Codes • 405 §7.5 Low-Density Generator Codes and Rateless Codes • 410 Notes • 418 Problems • 421 References • 421 X CONTENTS 8 Expander Codes and Flipping Algorithm • page 427 §8.1 Building Codes from Expanders • 427 §8.2 Flipping Algorithm • 428 §8.3 Bound on Expansion of a Graph • 429 §8.4 Expansion of a Random Graph • 431 Notes ¦ 434 Problems • 435 References • 435 A Encoding Low-Density Parity-Check Codes • page 437 §A.i Encoding Generic LDPC Codes • 437 §A.2 Greedy Upper Triangulation • 443 §A.3 Linear Encoding Complexity • 448 §A.4 Analysis of Asymptotic Gap • 452 Notes • 456 Problems • 456 References • 457 B Efficient Implementation of Density Evolution • page 459 §B.i Quantization • 460 §B.2 Variable-Node Update via Fourier Transform • 460 §B.3 Check-Node Update via Table Method ¦ 462 §B.4 Check-Node Update via Fourier Method • 464 Notes • 477 Problems • 477 References ¦ 478 C Concentration Inequalities • page 479 §C.i First and Second Moment Method • 480 §C.2 Bernstein's Inequality • 482 §C.3 Martingales • 484 §C.4 Wormald's Differential Equation Approach • 490 §C.5 Convergence to Poisson Distribution ¦ 497 Notes • 500 Problems ¦ 501 References • 502 D Formal Power Sums • page 505 §D.i Definition • 505 §D.2 Basic Properties • 505 XI §D.3 Summation of Subsequences ¦ 506 §D.4 Coefficient Growth of Powers of Polynomials • 507 §D.5 Unimodality • 529 Notes • 529 Problems • 530 References • 535 E Convexity, Degradation, and Stability • page 537 Authors • page 551 Index • page 559
any_adam_object	1
any_adam_object_boolean	1
author	Richardson, Tom Urbanke, Rüdiger
author_facet	Richardson, Tom Urbanke, Rüdiger
author_role	aut aut
author_sort	Richardson, Tom
author_variant	t r tr r u ru
building	Verbundindex
bvnumber	BV023300642
classification_rvk	SK 170 ST 276
ctrlnum	(OCoLC)421362560 (DE-599)BSZ279026722
discipline	Informatik Mathematik
discipline_str_mv	Informatik Mathematik
edition	1. publ.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01783nam a22004332c 4500</leader><controlfield tag="001">BV023300642</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080807 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080515s2008 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521852296</subfield><subfield code="9">978-0-521-85229-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521852293</subfield><subfield code="c">(hbk.) : £45.00 hbk.</subfield><subfield code="9">0-521-85229-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)421362560</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ279026722</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 276</subfield><subfield code="0">(DE-625)143642:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Richardson, Tom</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modern coding theory</subfield><subfield code="c">Tom Richardson ; Ruediger Urbanke</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 572 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index. - Includes Internet access</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Codering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Dataprocessing</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Codierungstheorie</subfield><subfield code="0">(DE-588)4139405-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Codierungstheorie</subfield><subfield code="0">(DE-588)4139405-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Urbanke, Rüdiger</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0808/2007039544-d.html</subfield><subfield code="z">lizenzfrei</subfield><subfield code="3">Verlagsmeldung</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0808/2007039544-t.html</subfield><subfield code="z">lizenzfrei</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016485105</subfield></datafield></record></collection>
id	DE-604.BV023300642
illustrated	Illustrated
index_date	2024-07-02T20:46:29Z
indexdate	2024-07-09T21:15:19Z
institution	BVB
isbn	9780521852296 0521852293
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016485105
oclc_num	421362560
open_access_boolean
owner	DE-706 DE-703 DE-29T DE-473 DE-BY-UBG DE-83
owner_facet	DE-706 DE-703 DE-29T DE-473 DE-BY-UBG DE-83
physical	XVI, 572 S. graph. Darst.
publishDate	2008
publishDateSearch	2008
publishDateSort	2008
publisher	Cambridge Univ. Press
record_format	marc
spelling	Richardson, Tom Verfasser aut Modern coding theory Tom Richardson ; Ruediger Urbanke 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2008 XVI, 572 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index. - Includes Internet access Codering gtt Dataprocessing gtt Coding theory Codierungstheorie (DE-588)4139405-7 gnd rswk-swf Codierungstheorie (DE-588)4139405-7 s DE-604 Urbanke, Rüdiger Verfasser aut http://www.loc.gov/catdir/enhancements/fy0808/2007039544-d.html lizenzfrei Verlagsmeldung http://www.loc.gov/catdir/enhancements/fy0808/2007039544-t.html lizenzfrei Inhaltsverzeichnis HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Richardson, Tom Urbanke, Rüdiger Modern coding theory Codering gtt Dataprocessing gtt Coding theory Codierungstheorie (DE-588)4139405-7 gnd
subject_GND	(DE-588)4139405-7
title	Modern coding theory
title_auth	Modern coding theory
title_exact_search	Modern coding theory
title_exact_search_txtP	Modern coding theory
title_full	Modern coding theory Tom Richardson ; Ruediger Urbanke
title_fullStr	Modern coding theory Tom Richardson ; Ruediger Urbanke
title_full_unstemmed	Modern coding theory Tom Richardson ; Ruediger Urbanke
title_short	Modern coding theory
title_sort	modern coding theory
topic	Codering gtt Dataprocessing gtt Coding theory Codierungstheorie (DE-588)4139405-7 gnd
topic_facet	Codering Dataprocessing Coding theory Codierungstheorie
url	http://www.loc.gov/catdir/enhancements/fy0808/2007039544-d.html http://www.loc.gov/catdir/enhancements/fy0808/2007039544-t.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485105&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT richardsontom moderncodingtheory AT urbankerudiger moderncodingtheory

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis
Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge