Holdings: Fundamentals of error-correcting codes

Fundamentals of error-correcting codes:

Saved in:

Bibliographic Details
Main Authors:	Huffman, William C. 1931- (Author), Pless, Vera 1931-2020 (Author)
Format:	Book
Language:	English
Published:	Cambridge [u.a.] Cambridge Univ. Press 2003
Edition:	1. publ.
Subjects:	Algoritmen Computers Correctie Fouten Teoria da informação Error-correcting codes (Information theory) Fehlerkorrekturcode Codierungstheorie Lehrbuch
Online Access:	Inhaltsverzeichnis
Physical Description:	XVII, 646 S. graph. Darst. 26 cm.
ISBN:	0521782805

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV023300600
003	DE-604
005	20080604
007	t
008	080515s2003 d\|\|\| \|\|\|\| 00\|\|\| eng d
015			\|a bA416436 \|2 dnb
020			\|a 0521782805 \|9 0-521-78280-5
035			\|a (OCoLC)49558736
035			\|a (DE-599)BVBBV023300600
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
049			\|a DE-706
050		0	\|a QA268
082	0		\|a 005.7/2 \|2 21
084			\|a SK 170 \|0 (DE-625)143221: \|2 rvk
084			\|a ST 273 \|0 (DE-625)143640: \|2 rvk
084			\|a ST 276 \|0 (DE-625)143642: \|2 rvk
100	1		\|a Huffman, William C. \|d 1931- \|e Verfasser \|0 (DE-588)133058263 \|4 aut
245	1	0	\|a Fundamentals of error-correcting codes \|c W. Cary Huffman and Vera Pless
250			\|a 1. publ.
264		1	\|a Cambridge [u.a.] \|b Cambridge Univ. Press \|c 2003
300			\|a XVII, 646 S. \|b graph. Darst. \|c 26 cm.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		7	\|a Algoritmen \|2 gtt
650		7	\|a Computers \|2 gtt
650		7	\|a Correctie \|2 gtt
650		7	\|a Fouten \|2 gtt
650		7	\|a Teoria da informação \|2 larpcal
650		4	\|a Error-correcting codes (Information theory)
650	0	7	\|a Fehlerkorrekturcode \|0 (DE-588)4124917-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Codierungstheorie \|0 (DE-588)4139405-7 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4123623-3 \|a Lehrbuch \|2 gnd-content
689	0	0	\|a Fehlerkorrekturcode \|0 (DE-588)4124917-3 \|D s
689	0	1	\|a Codierungstheorie \|0 (DE-588)4139405-7 \|D s
689	0		\|5 DE-604
700	1		\|a Pless, Vera \|d 1931-2020 \|e Verfasser \|0 (DE-588)133058247 \|4 aut
856	4	2	\|m GBV Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485062&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-016485062

Record in the Search Index

_version_	1804137628798287872
adam_text	FUNDAMENTALS OF ERROR-CORRECTING CODES W. CARY HUFFMAN LOYOLA UNIVERSITY OF CHICAGO AND VERA PLESS UNIVERSITY OF ILLINOIS AT CHICAGO CAMBRIDGE UNIVERSITY PRESS CONTENTS PREFACE 1 BASIC CONCEPTS OF LINEAR CODES 1.1 THREEFIELDS 1.2 LINEAR CODES, GENERATOR AND PARITY CHECK MATRICES 1.3 DUAL CODES 1.4 WEIGHTS AND DISTANCES 1.5 NEW CODES FROM OLD 1.5.1 PUNCTURING CODES 1.5.2 EXTENDING CODES 1.5.3 SHORTENING CODES 1.5.4 DIRECT SUMS 1.5.5 THE (U \| U + V) CONSTRUCTION 1.6 PERMUTATION EQUIVALENT CODES 1.7 MORE GENERAL EQUIVALENCE OF CODES 1.8 HAMMING CODES 1.9 THE GOLAY CODES 1.9.1 THE BINARY GOLAY CODES 1.9.2 THE TERNARY GOLAY CODES 1.10 REED-MULLER CODES 1.11 ENCODING, DECODING, AND SHANNON S THEOREM 1.11.1 ENCODING 1.11.2 DECODING AND SHANNON S THEOREM 1.12 SPHERE PACKING BOUND, COVERING RADIUS, AND PERFECT CODES 2 BOUNDS ON THE SIZE OF CODES 2.1 A Q (N,D) AND B Q {N,D) 2.2 THE PLOTKIN UPPER BOUND VIII CONTENTS 2.3 THE JOHNSON UPPER BOUNDS 2.3.1 THE RESTRICTED JOHNSON BOUND 2.3.2 THE UNRESTRICTED JOHNSON BOUND 2.3.3 THE JOHNSON BOUND FOR A Q {N, D) 2.3.4 THE NORDSTROM-ROBINSON CODE 2.3.5 NEARLY PERFECT BINARY CODES 2.4 THE SINGLETON UPPER BOUND AND MDS CODES 2.5 THE ELIAS UPPER BOUND 2.6 THE LINEAR PROGRAMMING UPPER BOUND 2.7 THE GRIESMER UPPER BOUND 2.8 THE GILBERT LOWER BOUND 2.9 THE VARSHAMOV LOWER BOUND 2.10 ASYMPTOTIC BOUNDS 2.10.1 ASYMPTOTIC SINGLETON BOUND 2.10.2 ASYMPTOTIC PLOTKIN BOUND 2.10.3 ASYMPTOTIC HAMMING BOUND 2.10.4 ASYMPTOTIC ELIAS BOUND 2.10.5 THE MRRW BOUNDS 2.10.6 ASYMPTOTIC GILBERT-VARSHAMOV BOUND 2.11 LEXICODES 3 FINITE FIELDS 3.1 INTRODUCTION 3.2 POLYNOMIALS AND THE EUCLIDEAN ALGORITHM 3.3 PRIMITIVE ELEMENTS 3.4 CONSTRUCTING HNITE FIELDS 3.5 SUBFIELDS 3.6 FIELD AUTOMORPHISMS 3.7 CYCLOTOMIC COSETS AND MINIMAL POLYNOMIALS 3.8 TRACE AND SUBFIELD SUBCODES RAUNM 4 CYCLIC CODES 4.1 FACTORING X * 1 4.2 BASIC THEORY OF CYCLIC CODES 4.3 IDEMPOTENTS AND MULTIPLIERS 4.4 ZEROS OF A CYCLIC CODE 4.5 MINIMUM DISTANCE OF CYCLIC CODES 4.6 MEGGITT DECODING OF CYCLIC CODES 4.7 AFFINE-INVARIANT CODES IX CONTENTS FLU .HU» 5 BCH AND REED-SOLOMON CODES 168 5.1 BCH CODES 168 5.2 REED-SOLOMON CODES 173 5.3 GENERALIZED REED-SOLOMON CODES 175 5.4 DECODING BCH CODES 178 5.4.1 THE PETERSON-GORENSTEIN-ZIERLER DECODING ALGORITHM 179 5.4.2 THE BERLEKAMP-MASSEY DECODING ALGORITHM 186 5.4.3 THE SUGIYAMA DECODING ALGORITHM 190 5.4.4 THE SUDAN-GURUSWAMI DECODING ALGORITHM 195 5.5 BURST ERRORS, CONCATENATED CODES, AND INTERLEAVING 200 5.6 CODING FOR THE COMPACT DISC 203 5.6.1 ENCODING 204 5.6.2 DECODING 207 BMAE 6 DUADIC CODES 209 6.1 DEFINITION AND BASIC PROPERTIES 209 6.2 A BIT OF NUMBER THEORY 217 6.3 EXISTENCE OF DUADIC CODES 220 6.4 ORTHOGONALITY OF DUADIC CODES 222 6.5 WEIGHTS IN DUADIC CODES 229 6.6 QUADRATIC RESIDUE CODES 237 6.6.1 QR CODES OVER FIELDS OF CHARACTERISTIC 2 238 6.6.2 QR CODES OVER FIELDS OF CHARACTERISTIC 3 241 6.6.3 EXTENDING QR CODES 245 6.6.4 AUTOMORPHISMS OF EXTENDED QR CODES 248 WEIGHT DISTRIBUTIONS 252 7.1 THE MACWILLIAMS EQUATIONS 252 7.2 EQUIVALENT FORMULATIONS 255 7.3 A UNIQUENESS RESULT 259 7.4 MDS CODES 262 7.5 COSET WEIGHT DISTRIBUTIONS 265 7.6 WEIGHT DISTRIBUTIONS OF PUNCTURED AND SBORTENED CODES 271 7.7 OTHER WEIGHT ENUMERATORS 273 7.8 CONSTRAINTS ON WEIGHTS 275 7.9 WEIGHT PRESERVING TRANSFORMATIONS 279 7.10 GENERALIZED HAMMING WEIGHTS 282 X CONTENTS 8 DESIGNS 9.1 9.2 9.3 9.4 9.5 9.6 9.7 9.8 9.9 9.10 9.11 9.12 8.1 ?-DESIGNS 8.2 INTERSECTION NUMBERS 8.3 COMPLEMENTARY, DERIVED, AND RESIDUAL DESIGNS 8.4 THE ASSMUS-MATTSON THEOREM 8.5 CODES FROM SYMMETRIE 2-DESIGNS 8.6 PROJECTIVE PLANES 8.7 CYCLIC PROJECTIVE PLANES 8.8 THE NONEXISTENCE OF A PROJECTIVE PLANE OF ORDER 10 8.9 HADAMARD MATRICES AND DESIGNS SELF-DUAL CODES THE GLEASON-PIERCE-WARD THEOREM GLEASON POLYNOMIALS UPPER BOUNDS THE BALANCE PRINCIPLE AND THE SHADOW COUNTING SELF-ORTHOGONAL CODES MASS FORMULAS CLASSIFICATION 9.7.1 THE CLASSIFICATION ALGORITHM 9.7.2 GLUING THEORY CIRCULANT CONSTRACTIONS FORMALLY SELF-DUAL CODES ADDITIVE CODES OVER F4 PROOF OF THE GLEASON-PIERCE-WARD THEOREM PROOFS OF SOME COUNTING FORMULAS 10 SOME FAVORITE SELF-DUAL CODES 10.1 THE BINARY GOLAY CODES 10.1.1 UNIQUENESS OF THE BINARY GOLAY CODES 10.1.2 PROPERTIES OF BINARY GOLAY CODES 10.2 PERMUTATION DECODING 10.3 THE HEXAEODE 10.3.1 UNIQUENESS OF THE HEXAEODE 10.3.2 PROPERTIES OF THE HEXAEODE 10.3.3 DECODING THE GOLAY CODE WITH THE HEXAEODE 10.4 THE TERNARY GOLAY CODES XI CONTENTS 10.4.1 UNIQUENESS OF THE TERNARY GOLAY CODES 413 10.4.2 PROPERTIES OF TERNARY GOLAY CODES 418 10.5 SYMMETRY CODES 420 10.6 LATTICES AND SELF-DUAL CODES 422 11 COVERING RADIUS AND COSETS 432 11.1 BASICS 432 11.2 THE NORSE BOUND AND REED-MULLER CODES 435 11.3 COVERING RADIUS OF BCH CODES 439 11.4 COVERING RADIUS OF SELF-DUAL CODES 444 11.5 THE LENGTH FUNCTION 447 11.6 COVERING RADIUS OF SUBCODES 454 11.7 ANCESTORS, DESCENDANTS, AND ORPHANS 459 12 CODES OVER Z 4 467 12.1 BASIC THEORY OF Z 4 -LINEAR CODES 467 12.2 BINARY CODES FROM ZZT-LINEAR CODES 472 12.3 CYCLIC CODES OVER Z4 475 12.3.1 FACTORING X * 1 OVER Z4 475 12.3.2 THE RING 9T* = Z 4 [X]/(X N - 1) 480 12.3.3 GENERATING POLYNOMIALS OF CYCLIC CODES OVER Z4 482 12.3.4 GENERATING IDEMPOTENTS OF CYCLIC CODES OVER Z4 485 12.4 QUADRATIC RESIDUE CODES OVER Z4 488 12.4.1 Z4-QUADRATIC RESIDUE CODES: P = * 1 (MOD 8) 490 12.4.2 Z 4 -QUADRATIC RESIDUE CODES: P = 1 (MOD 8) 492 12.4.3 EXTENDING Z4-QUADRATIC RESIDUE CODES 492 12.5 SELF-DUAL CODES OVER Z 4 495 12.5.1 MASSFORMULAS 498 12.5.2 SELF-DUAL CYCLIC CODES 502 12.5.3 LATTICES FRORA SELF-DUAL CODES OVER Z4 503 12.6 GALOIS RINGS 505 12.7 KERDOCK CODES 509 12.8 PREPARATA CODES 515 13 CODES FROM ALGEBRAIC GEOMETRY 517 13.1 AFFINE SPACE, PROJECTIVE SPACE, AND HOMOGENIZATION 517 13.2 SOME CLASSICAL CODES 520 XII CONTENTS 13.2.1 GENERALIZED REED-SOLOMON CODES REVISITED 520 13.2.2 CLASSICAL GOPPA CODES 521 13.2.3 GENERALIZED REED-SOLOMON CODES 524 13.3 ALGEBRAIC CURVES 526 13.4 ALGEBRAIC GEOMETRY CODES 532 13.5 THE GILBERT-VARSHAMOV BOUND REVISITED 541 13.5.1 GOPPA CODES MEET THE GILBERT-VARSHAMOV BOUND 541 13.5.2 ALGEBRAIC GEOMETRY CODES EXCEED THE GILBERT-VARSHAMOV BOUND 543 14 CONVOLUTIONAL CODES 546 14.1 GENERATOR MATRICES AND ENCODING 14.2 VITERBI DECODING 14.2.1 S TAETE DI AGRAMS 14.2.2 TRELLIS DIAGRAMS 14.2.3 THE VITERBI ALGORITHM 14.3 CANONICAL GENERATOR MATRICES 14.4 FREE DISTANCE 14.5 CATASTROPHIC ENCODERS 15 SOFT DECISION AND ITERATIVE DECODING 15.1 ADDITIVE WHITE GAUSSIAN NOISE 15.2 A SOFT DECISION VITERBI ALGORITHM 15.3 THE GENERAL VITERBI ALGORITHM 15.4 TWO-WAY APP DECODING 15.5 MESSAGE PASSING DECODING 15.6 LOW DENSITY PARITY CHECK CODES 15.7 TURBO CODES 15.8 TURBO DECODING 15.9 SOME SPACE HISTORY REFERENCES SYMBOL INDEX SUBJECT INDEX
adam_txt	FUNDAMENTALS OF ERROR-CORRECTING CODES W. CARY HUFFMAN LOYOLA UNIVERSITY OF CHICAGO AND VERA PLESS UNIVERSITY OF ILLINOIS AT CHICAGO CAMBRIDGE UNIVERSITY PRESS CONTENTS PREFACE 1 BASIC CONCEPTS OF LINEAR CODES 1.1 THREEFIELDS 1.2 LINEAR CODES, GENERATOR AND PARITY CHECK MATRICES 1.3 DUAL CODES 1.4 WEIGHTS AND DISTANCES 1.5 NEW CODES FROM OLD 1.5.1 PUNCTURING CODES 1.5.2 EXTENDING CODES 1.5.3 SHORTENING CODES 1.5.4 DIRECT SUMS 1.5.5 THE (U \| U + V) CONSTRUCTION 1.6 PERMUTATION EQUIVALENT CODES 1.7 MORE GENERAL EQUIVALENCE OF CODES 1.8 HAMMING CODES 1.9 THE GOLAY CODES 1.9.1 THE BINARY GOLAY CODES 1.9.2 THE TERNARY GOLAY CODES 1.10 REED-MULLER CODES 1.11 ENCODING, DECODING, AND SHANNON'S THEOREM 1.11.1 ENCODING 1.11.2 DECODING AND SHANNON'S THEOREM 1.12 SPHERE PACKING BOUND, COVERING RADIUS, AND PERFECT CODES 2 BOUNDS ON THE SIZE OF CODES 2.1 A Q (N,D) AND B Q {N,D) 2.2 THE PLOTKIN UPPER BOUND VIII CONTENTS 2.3 THE JOHNSON UPPER BOUNDS 2.3.1 THE RESTRICTED JOHNSON BOUND 2.3.2 THE UNRESTRICTED JOHNSON BOUND 2.3.3 THE JOHNSON BOUND FOR A Q {N, D) 2.3.4 THE NORDSTROM-ROBINSON CODE 2.3.5 NEARLY PERFECT BINARY CODES 2.4 THE SINGLETON UPPER BOUND AND MDS CODES 2.5 THE ELIAS UPPER BOUND 2.6 THE LINEAR PROGRAMMING UPPER BOUND 2.7 THE GRIESMER UPPER BOUND 2.8 THE GILBERT LOWER BOUND 2.9 THE VARSHAMOV LOWER BOUND 2.10 ASYMPTOTIC BOUNDS 2.10.1 ASYMPTOTIC SINGLETON BOUND 2.10.2 ASYMPTOTIC PLOTKIN BOUND 2.10.3 ASYMPTOTIC HAMMING BOUND 2.10.4 ASYMPTOTIC ELIAS BOUND 2.10.5 THE MRRW BOUNDS 2.10.6 ASYMPTOTIC GILBERT-VARSHAMOV BOUND 2.11 LEXICODES 3 FINITE FIELDS 3.1 INTRODUCTION 3.2 POLYNOMIALS AND THE EUCLIDEAN ALGORITHM 3.3 PRIMITIVE ELEMENTS 3.4 CONSTRUCTING HNITE FIELDS 3.5 SUBFIELDS 3.6 FIELD AUTOMORPHISMS 3.7 CYCLOTOMIC COSETS AND MINIMAL POLYNOMIALS 3.8 TRACE AND SUBFIELD SUBCODES RAUNM 4 CYCLIC CODES 4.1 FACTORING X" * 1 4.2 BASIC THEORY OF CYCLIC CODES 4.3 IDEMPOTENTS AND MULTIPLIERS 4.4 ZEROS OF A CYCLIC CODE 4.5 MINIMUM DISTANCE OF CYCLIC CODES 4.6 MEGGITT DECODING OF CYCLIC CODES 4.7 AFFINE-INVARIANT CODES IX CONTENTS FLU .HU» 5 BCH AND REED-SOLOMON CODES 168 5.1 BCH CODES 168 5.2 REED-SOLOMON CODES 173 5.3 GENERALIZED REED-SOLOMON CODES 175 5.4 DECODING BCH CODES 178 5.4.1 THE PETERSON-GORENSTEIN-ZIERLER DECODING ALGORITHM 179 5.4.2 THE BERLEKAMP-MASSEY DECODING ALGORITHM 186 5.4.3 THE SUGIYAMA DECODING ALGORITHM 190 5.4.4 THE SUDAN-GURUSWAMI DECODING ALGORITHM 195 5.5 BURST ERRORS, CONCATENATED CODES, AND INTERLEAVING 200 5.6 CODING FOR THE COMPACT DISC 203 5.6.1 ENCODING 204 5.6.2 DECODING 207 \BMAE 6 DUADIC CODES 209 6.1 DEFINITION AND BASIC PROPERTIES 209 6.2 A BIT OF NUMBER THEORY 217 6.3 EXISTENCE OF DUADIC CODES 220 6.4 ORTHOGONALITY OF DUADIC CODES 222 6.5 WEIGHTS IN DUADIC CODES 229 6.6 QUADRATIC RESIDUE CODES 237 6.6.1 QR CODES OVER FIELDS OF CHARACTERISTIC 2 238 6.6.2 QR CODES OVER FIELDS OF CHARACTERISTIC 3 241 6.6.3 EXTENDING QR CODES 245 6.6.4 AUTOMORPHISMS OF EXTENDED QR CODES 248 WEIGHT DISTRIBUTIONS 252 7.1 THE MACWILLIAMS EQUATIONS 252 7.2 EQUIVALENT FORMULATIONS 255 7.3 A UNIQUENESS RESULT 259 7.4 MDS CODES 262 7.5 COSET WEIGHT DISTRIBUTIONS 265 7.6 WEIGHT DISTRIBUTIONS OF PUNCTURED AND SBORTENED CODES 271 7.7 OTHER WEIGHT ENUMERATORS 273 7.8 CONSTRAINTS ON WEIGHTS 275 7.9 WEIGHT PRESERVING TRANSFORMATIONS 279 7.10 GENERALIZED HAMMING WEIGHTS 282 X CONTENTS 8 DESIGNS 9.1 9.2 9.3 9.4 9.5 9.6 9.7 9.8 9.9 9.10 9.11 9.12 8.1 ?-DESIGNS 8.2 INTERSECTION NUMBERS 8.3 COMPLEMENTARY, DERIVED, AND RESIDUAL DESIGNS 8.4 THE ASSMUS-MATTSON THEOREM 8.5 CODES FROM SYMMETRIE 2-DESIGNS 8.6 PROJECTIVE PLANES 8.7 CYCLIC PROJECTIVE PLANES 8.8 THE NONEXISTENCE OF A PROJECTIVE PLANE OF ORDER 10 8.9 HADAMARD MATRICES AND DESIGNS SELF-DUAL CODES THE GLEASON-PIERCE-WARD THEOREM GLEASON POLYNOMIALS UPPER BOUNDS THE BALANCE PRINCIPLE AND THE SHADOW COUNTING SELF-ORTHOGONAL CODES MASS FORMULAS CLASSIFICATION 9.7.1 THE CLASSIFICATION ALGORITHM 9.7.2 GLUING THEORY CIRCULANT CONSTRACTIONS FORMALLY SELF-DUAL CODES ADDITIVE CODES OVER F4 PROOF OF THE GLEASON-PIERCE-WARD THEOREM PROOFS OF SOME COUNTING FORMULAS 10 SOME FAVORITE SELF-DUAL CODES 10.1 THE BINARY GOLAY CODES 10.1.1 UNIQUENESS OF THE BINARY GOLAY CODES 10.1.2 PROPERTIES OF BINARY GOLAY CODES 10.2 PERMUTATION DECODING 10.3 THE HEXAEODE 10.3.1 UNIQUENESS OF THE HEXAEODE 10.3.2 PROPERTIES OF THE HEXAEODE 10.3.3 DECODING THE GOLAY CODE WITH THE HEXAEODE 10.4 THE TERNARY GOLAY CODES XI CONTENTS 10.4.1 UNIQUENESS OF THE TERNARY GOLAY CODES 413 10.4.2 PROPERTIES OF TERNARY GOLAY CODES 418 10.5 SYMMETRY CODES 420 10.6 LATTICES AND SELF-DUAL CODES 422 11 COVERING RADIUS AND COSETS 432 11.1 BASICS 432 11.2 THE NORSE BOUND AND REED-MULLER CODES 435 11.3 COVERING RADIUS OF BCH CODES 439 11.4 COVERING RADIUS OF SELF-DUAL CODES 444 11.5 THE LENGTH FUNCTION 447 11.6 COVERING RADIUS OF SUBCODES 454 11.7 ANCESTORS, DESCENDANTS, AND ORPHANS 459 12 CODES OVER Z 4 467 12.1 BASIC THEORY OF Z 4 -LINEAR CODES 467 12.2 BINARY CODES FROM ZZT-LINEAR CODES 472 12.3 CYCLIC CODES OVER Z4 475 12.3.1 FACTORING X" * 1 OVER Z4 475 12.3.2 THE RING 9T* = Z 4 [X]/(X N - 1) 480 12.3.3 GENERATING POLYNOMIALS OF CYCLIC CODES OVER Z4 482 12.3.4 GENERATING IDEMPOTENTS OF CYCLIC CODES OVER Z4 485 12.4 QUADRATIC RESIDUE CODES OVER Z4 488 12.4.1 Z4-QUADRATIC RESIDUE CODES: P = * 1 (MOD 8) 490 12.4.2 Z 4 -QUADRATIC RESIDUE CODES: P = 1 (MOD 8) 492 12.4.3 EXTENDING Z4-QUADRATIC RESIDUE CODES 492 12.5 SELF-DUAL CODES OVER Z 4 495 12.5.1 MASSFORMULAS 498 12.5.2 SELF-DUAL CYCLIC CODES 502 12.5.3 LATTICES FRORA SELF-DUAL CODES OVER Z4 503 12.6 GALOIS RINGS 505 12.7 KERDOCK CODES 509 12.8 PREPARATA CODES 515 13 CODES FROM ALGEBRAIC GEOMETRY 517 13.1 AFFINE SPACE, PROJECTIVE SPACE, AND HOMOGENIZATION 517 13.2 SOME CLASSICAL CODES 520 XII CONTENTS 13.2.1 GENERALIZED REED-SOLOMON CODES REVISITED 520 13.2.2 CLASSICAL GOPPA CODES 521 13.2.3 GENERALIZED REED-SOLOMON CODES 524 13.3 ALGEBRAIC CURVES 526 13.4 ALGEBRAIC GEOMETRY CODES 532 13.5 THE GILBERT-VARSHAMOV BOUND REVISITED 541 13.5.1 GOPPA CODES MEET THE GILBERT-VARSHAMOV BOUND 541 13.5.2 ALGEBRAIC GEOMETRY CODES EXCEED THE GILBERT-VARSHAMOV BOUND 543 14 CONVOLUTIONAL CODES 546 14.1 GENERATOR MATRICES AND ENCODING 14.2 VITERBI DECODING 14.2.1 S TAETE DI AGRAMS 14.2.2 TRELLIS DIAGRAMS 14.2.3 THE VITERBI ALGORITHM 14.3 CANONICAL GENERATOR MATRICES 14.4 FREE DISTANCE 14.5 CATASTROPHIC ENCODERS 15 SOFT DECISION AND ITERATIVE DECODING 15.1 ADDITIVE WHITE GAUSSIAN NOISE 15.2 A SOFT DECISION VITERBI ALGORITHM 15.3 THE GENERAL VITERBI ALGORITHM 15.4 TWO-WAY APP DECODING 15.5 MESSAGE PASSING DECODING 15.6 LOW DENSITY PARITY CHECK CODES 15.7 TURBO CODES 15.8 TURBO DECODING 15.9 SOME SPACE HISTORY REFERENCES SYMBOL INDEX SUBJECT INDEX
any_adam_object	1
any_adam_object_boolean	1
author	Huffman, William C. 1931- Pless, Vera 1931-2020
author_GND	(DE-588)133058263 (DE-588)133058247
author_facet	Huffman, William C. 1931- Pless, Vera 1931-2020
author_role	aut aut
author_sort	Huffman, William C. 1931-
author_variant	w c h wc wch v p vp
building	Verbundindex
bvnumber	BV023300600
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 273 ST 276
ctrlnum	(OCoLC)49558736 (DE-599)BVBBV023300600
dewey-full	005.7/2
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.7/2
dewey-search	005.7/2
dewey-sort	15.7 12
dewey-tens	000 - Computer science, information, general works
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>01899nam a2200505 c 4500</leader><controlfield tag="001">BV023300600</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080604 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080515s2003 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">bA416436</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521782805</subfield><subfield code="9">0-521-78280-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)49558736</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023300600</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA268</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7/2</subfield><subfield code="2">21</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 273</subfield><subfield code="0">(DE-625)143640:</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">Huffman, William C.</subfield><subfield code="d">1931-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133058263</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamentals of error-correcting codes</subfield><subfield code="c">W. Cary Huffman and Vera Pless</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">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 646 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">26 cm.</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="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Correctie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Fouten</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria da informação</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Error-correcting codes (Information 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">Codierungstheorie</subfield><subfield code="0">(DE-588)4139405-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)4123623-3</subfield><subfield code="a">Lehrbuch</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="1"><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">Pless, Vera</subfield><subfield code="d">1931-2020</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133058247</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=016485062&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-016485062</subfield></datafield></record></collection>
genre	(DE-588)4123623-3 Lehrbuch gnd-content
genre_facet	Lehrbuch
id	DE-604.BV023300600
illustrated	Illustrated
index_date	2024-07-02T20:46:28Z
indexdate	2024-07-09T21:15:19Z
institution	BVB
isbn	0521782805
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016485062
oclc_num	49558736
open_access_boolean
owner	DE-706
owner_facet	DE-706
physical	XVII, 646 S. graph. Darst. 26 cm.
publishDate	2003
publishDateSearch	2003
publishDateSort	2003
publisher	Cambridge Univ. Press
record_format	marc
spelling	Huffman, William C. 1931- Verfasser (DE-588)133058263 aut Fundamentals of error-correcting codes W. Cary Huffman and Vera Pless 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2003 XVII, 646 S. graph. Darst. 26 cm. txt rdacontent n rdamedia nc rdacarrier Algoritmen gtt Computers gtt Correctie gtt Fouten gtt Teoria da informação larpcal Error-correcting codes (Information theory) Fehlerkorrekturcode (DE-588)4124917-3 gnd rswk-swf Codierungstheorie (DE-588)4139405-7 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Fehlerkorrekturcode (DE-588)4124917-3 s Codierungstheorie (DE-588)4139405-7 s DE-604 Pless, Vera 1931-2020 Verfasser (DE-588)133058247 aut GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485062&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Huffman, William C. 1931- Pless, Vera 1931-2020 Fundamentals of error-correcting codes Algoritmen gtt Computers gtt Correctie gtt Fouten gtt Teoria da informação larpcal Error-correcting codes (Information theory) Fehlerkorrekturcode (DE-588)4124917-3 gnd Codierungstheorie (DE-588)4139405-7 gnd
subject_GND	(DE-588)4124917-3 (DE-588)4139405-7 (DE-588)4123623-3
title	Fundamentals of error-correcting codes
title_auth	Fundamentals of error-correcting codes
title_exact_search	Fundamentals of error-correcting codes
title_exact_search_txtP	Fundamentals of error-correcting codes
title_full	Fundamentals of error-correcting codes W. Cary Huffman and Vera Pless
title_fullStr	Fundamentals of error-correcting codes W. Cary Huffman and Vera Pless
title_full_unstemmed	Fundamentals of error-correcting codes W. Cary Huffman and Vera Pless
title_short	Fundamentals of error-correcting codes
title_sort	fundamentals of error correcting codes
topic	Algoritmen gtt Computers gtt Correctie gtt Fouten gtt Teoria da informação larpcal Error-correcting codes (Information theory) Fehlerkorrekturcode (DE-588)4124917-3 gnd Codierungstheorie (DE-588)4139405-7 gnd
topic_facet	Algoritmen Computers Correctie Fouten Teoria da informação Error-correcting codes (Information theory) Fehlerkorrekturcode Codierungstheorie Lehrbuch
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016485062&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT huffmanwilliamc fundamentalsoferrorcorrectingcodes AT plessvera fundamentalsoferrorcorrectingcodes

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Indexes

MARC

Record in the Search Index

There is no print copy available.

Similar Items