Introduction to coding theory:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2007
|
| Ausgabe: | 1. publ., repr. with corr. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 566 S. graph. Darst. |
| ISBN: | 0521845041 9780521845045 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV023407142 | ||
| 003 | DE-604 | ||
| 005 | 20220429 | ||
| 007 | t | ||
| 008 | 080721s2007 d||| |||| 00||| eng d | ||
| 020 | |a 0521845041 |9 0-521-84504-1 | ||
| 020 | |a 9780521845045 |9 978-0-521-84504-5 | ||
| 035 | |a (OCoLC)254255305 | ||
| 035 | |a (DE-599)BVBBV023407142 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-706 |a DE-91 |a DE-384 | ||
| 050 | 0 | |a QA268 | |
| 082 | 0 | |a 003.54 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 584f |2 stub | ||
| 084 | |a DAT 580f |2 stub | ||
| 100 | 1 | |a Roth, Ron M. |d ca. 20./21. Jh. |e Verfasser |0 (DE-588)1256468037 |4 aut | |
| 245 | 1 | 0 | |a Introduction to coding theory |c Ron M. Roth |
| 250 | |a 1. publ., repr. with corr. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2007 | |
| 300 | |a XI, 566 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Codierungstheorie | |
| 650 | 4 | |a Coding theory | |
| 650 | 0 | 7 | |a Fehlerkorrekturcode |0 (DE-588)4124917-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a RS-Code |0 (DE-588)4218587-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Fehlerkorrekturcode |0 (DE-588)4124917-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a RS-Code |0 (DE-588)4218587-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016589814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016589814 | ||
Datensatz im Suchindex
| _version_ | 1804137792875266048 |
|---|---|
| adam_text | Contents Preface page ix 1 Introduction 1.1 Communication systems 1.2 Channel coding 1.3 Block codes 1.4 Decoding 1.5 Levels of error handling Problems Notes 1 1 3 5 7 11 17 22 2 Linear Codes 2.1 Definition 2.2 Encoding of linear codes 2.3 Parity-check matrix 2.4 Decoding of linear codes Problems Notes 26 26 28 29 32 36 47 3 Introduction to Finite Fields 3.1 Prime fields 3.2 Polynomials 3.3 Extension fields 3.4 Roots of polynomials 3.5 Primitive elements 3.6 Field characteristic 3.7 Splitting field 3.8 Application: double error-correcting codes Problems Notes 50 50 51 56 59 60 62 64 66 70 90 v
Contents VI Contents vu Bounds on the Parameters of Codes 4.1 The Singleton bound 4.2 The sphere-packing bound 4.3 The Gilbert-Varshamov bound 4.4 MacWilliams’ identities 4.5 Asymptotic bounds 4.6 Converse Coding Theorem 4.7 Coding Theorem Problems Notes 93 94 95 97 99 104 110 115 119 136 5 Reed-Solomon andRelated Codes 5.1 Generalized Reed-Solomon codes 5.2 Conventional Reed-Solomon codes 5.3 Encoding of RS codes 5.4 Concatenated codes 5.5 Alternant codes 5.6 BCH codes Problems Notes 147 148 151 152 154 157 162 163 177 6 Decoding of Reed-Solomon Codes 6.1 Introduction 6.2 Syndrome computation 6.3 Key equation of GRS decoding 6.4 Solving the key equation by Euclid’s algorithm 6.5 Finding the error values 6.6 Summary of the GRS decoding algorithm 6.7 The Berlekamp-Massey algorithm Problems Notes 183 183 184 185 191 194 195 197 204 215 10 Codes in the Lee Metric 10.1 Lee weight and Lee distance 10.2 Newton’s identities 10.3 Lee-metric alternant codes and GRS codes 10.4 Decoding alternant codes in the Lee metric 10.5 Decoding GRS codes in the Lee metric 10.6 Berlekamp codes 10.7 Bounds for codes in the Lee metric Problems Notes 298 298 300 302 306 312 314 316 321 327 7 Structure of FiniteFields 7.1 Minimal polynomials 7.2 Enumeration of irreducible polynomials 7.3 Isomorphism of finite fields 7.4 Primitive polynomials 7.5 Cyclotomie cosets Problems Notes 218 218 224 227 227 229 232 240 11 MDS Codes 11.1 Definition revisited 11.2 GRS codes and their extensions 11.3 Bounds on the length of linear MDS codes 11.4 GRS codes and the MDS conjecture 11.5 Uniqueness of certain MDS
codes Problems Notes 333 333 335 338 342 347 351 361 4 8 Cyclic Codes 8.1 Definition 8.2 Generator polynomial and check polynomial 8.3 Roots of a cyclic code 8.4 BCH codes as cyclic codes 8.5 The BCH bound Problems Notes 242 242 244 247 250 253 256 265 9 List Decoding of Reed-Solomon Codes 9.1 List decoding 9.2 Bivariate polynomials 9.3 GRS decoding through bivariate polynomials 9.4 Sudan’s algorithm 9.5 The Guruswami-Sudan algorithm 9.6 List decoding of alternant codes 9.7 Finding linear bivariate factors 9.8 Bounds on the decoding radius Problems Notes 266 267 268 269 271 276 280 284 289 291 295
viii Contents 12 Concatenated Codes 12.1 Definition revisited 12.2 Decoding of concatenated codes 12.3 The Zyablov bound 12.4 Justesen codes 12.5 Concatenated codes that attain capacity Problems Notes 365 366 367 371 374 378 381 392 13 Graph Codes 13.1 Basic concepts from graph theory 13.2 Regular graphs 13.3 Graph expansion 13.4 Expanders from codes 13.5 Ramanujan graphs 13.6 Codes from expanders 13.7 Iterative decoding of graph codes 13.8 Graph codes in concatenated schemes Problems Notes 395 396 401 402 406 409 411 414 420 426 445 14 Trellis and Convolutional Codes 14.1 Labeled directed graphs 14.2 Trellis codes 14.3 Decoding of trellis codes 14.4 Linear finite-state machines 14.5 Convolutional codes 14.6 Encoding of convolutional codes 14.7 Decoding of convolutional codes 14.8 Non-catastrophic generator matrices Problems Notes 452 453 460 466 471 477 479 485 495 501 518 Appendix: Basics inModern Algebra Problems 521 522 Bibliography 527 List of Symbols 553 Index 559
|
| adam_txt |
Contents Preface page ix 1 Introduction 1.1 Communication systems 1.2 Channel coding 1.3 Block codes 1.4 Decoding 1.5 Levels of error handling Problems Notes 1 1 3 5 7 11 17 22 2 Linear Codes 2.1 Definition 2.2 Encoding of linear codes 2.3 Parity-check matrix 2.4 Decoding of linear codes Problems Notes 26 26 28 29 32 36 47 3 Introduction to Finite Fields 3.1 Prime fields 3.2 Polynomials 3.3 Extension fields 3.4 Roots of polynomials 3.5 Primitive elements 3.6 Field characteristic 3.7 Splitting field 3.8 Application: double error-correcting codes Problems Notes 50 50 51 56 59 60 62 64 66 70 90 v
Contents VI Contents vu Bounds on the Parameters of Codes 4.1 The Singleton bound 4.2 The sphere-packing bound 4.3 The Gilbert-Varshamov bound 4.4 MacWilliams’ identities 4.5 Asymptotic bounds 4.6 Converse Coding Theorem 4.7 Coding Theorem Problems Notes 93 94 95 97 99 104 110 115 119 136 5 Reed-Solomon andRelated Codes 5.1 Generalized Reed-Solomon codes 5.2 Conventional Reed-Solomon codes 5.3 Encoding of RS codes 5.4 Concatenated codes 5.5 Alternant codes 5.6 BCH codes Problems Notes 147 148 151 152 154 157 162 163 177 6 Decoding of Reed-Solomon Codes 6.1 Introduction 6.2 Syndrome computation 6.3 Key equation of GRS decoding 6.4 Solving the key equation by Euclid’s algorithm 6.5 Finding the error values 6.6 Summary of the GRS decoding algorithm 6.7 The Berlekamp-Massey algorithm Problems Notes 183 183 184 185 191 194 195 197 204 215 10 Codes in the Lee Metric 10.1 Lee weight and Lee distance 10.2 Newton’s identities 10.3 Lee-metric alternant codes and GRS codes 10.4 Decoding alternant codes in the Lee metric 10.5 Decoding GRS codes in the Lee metric 10.6 Berlekamp codes 10.7 Bounds for codes in the Lee metric Problems Notes 298 298 300 302 306 312 314 316 321 327 7 Structure of FiniteFields 7.1 Minimal polynomials 7.2 Enumeration of irreducible polynomials 7.3 Isomorphism of finite fields 7.4 Primitive polynomials 7.5 Cyclotomie cosets Problems Notes 218 218 224 227 227 229 232 240 11 MDS Codes 11.1 Definition revisited 11.2 GRS codes and their extensions 11.3 Bounds on the length of linear MDS codes 11.4 GRS codes and the MDS conjecture 11.5 Uniqueness of certain MDS
codes Problems Notes 333 333 335 338 342 347 351 361 4 8 Cyclic Codes 8.1 Definition 8.2 Generator polynomial and check polynomial 8.3 Roots of a cyclic code 8.4 BCH codes as cyclic codes 8.5 The BCH bound Problems Notes 242 242 244 247 250 253 256 265 9 List Decoding of Reed-Solomon Codes 9.1 List decoding 9.2 Bivariate polynomials 9.3 GRS decoding through bivariate polynomials 9.4 Sudan’s algorithm 9.5 The Guruswami-Sudan algorithm 9.6 List decoding of alternant codes 9.7 Finding linear bivariate factors 9.8 Bounds on the decoding radius Problems Notes 266 267 268 269 271 276 280 284 289 291 295
viii Contents 12 Concatenated Codes 12.1 Definition revisited 12.2 Decoding of concatenated codes 12.3 The Zyablov bound 12.4 Justesen codes 12.5 Concatenated codes that attain capacity Problems Notes 365 366 367 371 374 378 381 392 13 Graph Codes 13.1 Basic concepts from graph theory 13.2 Regular graphs 13.3 Graph expansion 13.4 Expanders from codes 13.5 Ramanujan graphs 13.6 Codes from expanders 13.7 Iterative decoding of graph codes 13.8 Graph codes in concatenated schemes Problems Notes 395 396 401 402 406 409 411 414 420 426 445 14 Trellis and Convolutional Codes 14.1 Labeled directed graphs 14.2 Trellis codes 14.3 Decoding of trellis codes 14.4 Linear finite-state machines 14.5 Convolutional codes 14.6 Encoding of convolutional codes 14.7 Decoding of convolutional codes 14.8 Non-catastrophic generator matrices Problems Notes 452 453 460 466 471 477 479 485 495 501 518 Appendix: Basics inModern Algebra Problems 521 522 Bibliography 527 List of Symbols 553 Index 559 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Roth, Ron M. ca. 20./21. Jh |
| author_GND | (DE-588)1256468037 |
| author_facet | Roth, Ron M. ca. 20./21. Jh |
| author_role | aut |
| author_sort | Roth, Ron M. ca. 20./21. Jh |
| author_variant | r m r rm rmr |
| building | Verbundindex |
| bvnumber | BV023407142 |
| callnumber-first | Q - Science |
| callnumber-label | QA268 |
| callnumber-raw | QA268 |
| callnumber-search | QA268 |
| callnumber-sort | QA 3268 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 170 ST 134 |
| classification_tum | DAT 584f DAT 580f |
| ctrlnum | (OCoLC)254255305 (DE-599)BVBBV023407142 |
| dewey-full | 003.54 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003.54 |
| dewey-search | 003.54 |
| dewey-sort | 13.54 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 1. publ., repr. with corr. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01740nam a2200469 c 4500</leader><controlfield tag="001">BV023407142</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220429 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080721s2007 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521845041</subfield><subfield code="9">0-521-84504-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521845045</subfield><subfield code="9">978-0-521-84504-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254255305</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023407142</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA268</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003.54</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 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 584f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 580f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Roth, Ron M.</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1256468037</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to coding theory</subfield><subfield code="c">Ron M. Roth</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ., repr. with corr.</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">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 566 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="650" ind1=" " ind2="4"><subfield code="a">Codierungstheorie</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">Fehlerkorrekturcode</subfield><subfield code="0">(DE-588)4124917-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">RS-Code</subfield><subfield code="0">(DE-588)4218587-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Fehlerkorrekturcode</subfield><subfield code="0">(DE-588)4124917-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">RS-Code</subfield><subfield code="0">(DE-588)4218587-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=016589814&sequence=000001&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-016589814</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV023407142 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:26:01Z |
| indexdate | 2024-07-09T21:17:56Z |
| institution | BVB |
| isbn | 0521845041 9780521845045 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016589814 |
| oclc_num | 254255305 |
| open_access_boolean | |
| owner | DE-29T DE-706 DE-91 DE-BY-TUM DE-384 |
| owner_facet | DE-29T DE-706 DE-91 DE-BY-TUM DE-384 |
| physical | XI, 566 S. graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Roth, Ron M. ca. 20./21. Jh. Verfasser (DE-588)1256468037 aut Introduction to coding theory Ron M. Roth 1. publ., repr. with corr. Cambridge [u.a.] Cambridge Univ. Press 2007 XI, 566 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Codierungstheorie Coding theory Fehlerkorrekturcode (DE-588)4124917-3 gnd rswk-swf RS-Code (DE-588)4218587-7 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Fehlerkorrekturcode (DE-588)4124917-3 s DE-604 RS-Code (DE-588)4218587-7 s Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016589814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Roth, Ron M. ca. 20./21. Jh Introduction to coding theory Codierungstheorie Coding theory Fehlerkorrekturcode (DE-588)4124917-3 gnd RS-Code (DE-588)4218587-7 gnd |
| subject_GND | (DE-588)4124917-3 (DE-588)4218587-7 (DE-588)4151278-9 |
| title | Introduction to coding theory |
| title_auth | Introduction to coding theory |
| title_exact_search | Introduction to coding theory |
| title_exact_search_txtP | Introduction to coding theory |
| title_full | Introduction to coding theory Ron M. Roth |
| title_fullStr | Introduction to coding theory Ron M. Roth |
| title_full_unstemmed | Introduction to coding theory Ron M. Roth |
| title_short | Introduction to coding theory |
| title_sort | introduction to coding theory |
| topic | Codierungstheorie Coding theory Fehlerkorrekturcode (DE-588)4124917-3 gnd RS-Code (DE-588)4218587-7 gnd |
| topic_facet | Codierungstheorie Coding theory Fehlerkorrekturcode RS-Code Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016589814&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT rothronm introductiontocodingtheory |