Cargando…

Elements of algebraic coding systems /

This book serves as an introductory text to algebraic coding theory. The contents are suitable for final year undergraduate and first year graduate courses in electrical and computer engineering, and will give the reader knowledge of coding fundamentals that is essential for a deeper understanding o...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Rocha, Valdemar C. da, 1947- (Autor)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York [New York] (222 East 46th Street, New York, NY 10017) : Momentum Press, 2014.
Colección:Communications and signal processing collection.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000 i 4500
001 EBSCO_ocn885199308
003 OCoLC
005 20231017213018.0
006 m eo d
007 cr cn||||m|||a
008 140804s2014 nyu foab 001 0 eng d
040 |a NYMPP  |b eng  |e rda  |e pn  |c NYMPP  |d OCLCO  |d N$T  |d E7B  |d MYG  |d OCLCF  |d YDXCP  |d EBLCP  |d IDEBK  |d DEBSZ  |d CN3GA  |d OCLCQ  |d NRC  |d AGLDB  |d OTZ  |d OCLCQ  |d MERUC  |d OCLCQ  |d UPM  |d VTS  |d STF  |d LOA  |d CUY  |d ZCU  |d ICG  |d K6U  |d VT2  |d U3W  |d CNCEN  |d OCLCQ  |d WYU  |d G3B  |d LVT  |d S8J  |d S9I  |d TKN  |d D6H  |d DKC  |d OCLCQ  |d M8D  |d UKAHL  |d OCLCQ  |d OCLCO  |d OCLCQ 
019 |a 884015374  |a 1148135951 
020 |a 9781606505755  |q (electronic bk.) 
020 |a 1606505750  |q (electronic bk.) 
020 |a 1606505742  |q (Trade Paper) 
020 |a 9781606505748 
020 |z 9781606505748  |q (print) 
024 3 |a 9781606505748 
024 7 |a 10.5643/9781606505755  |2 doi 
029 1 |a AU@  |b 000054659238 
029 1 |a DEBBG  |b BV042995234 
029 1 |a DEBBG  |b BV043035081 
029 1 |a DEBSZ  |b 410562742 
029 1 |a DEBSZ  |b 429949782 
029 1 |a DKDLA  |b 820120-katalog:999931355405765 
029 1 |a AU@  |b 000073102176 
035 |a (OCoLC)885199308  |z (OCoLC)884015374  |z (OCoLC)1148135951 
037 |b 01463640 
050 4 |a TK5102.92  |b .R634 2014 
072 7 |a SCI  |x 064000  |2 bisacsh 
072 7 |a TEC  |x 029000  |2 bisacsh 
082 0 4 |a 003.54  |2 23 
049 |a UAMI 
100 1 |a Rocha, Valdemar C. da,  |d 1947-  |e author. 
245 1 0 |a Elements of algebraic coding systems /  |c Valdemar Cardoso da Rocha, Jr. 
264 1 |a New York [New York] (222 East 46th Street, New York, NY 10017) :  |b Momentum Press,  |c 2014. 
300 |a 1 online resource (1 PDF (xi, 188 pages)) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Communications and signal processing collection 
500 |a Title from PDF title page (viewed on August 1, 2014). 
504 |a Includes bibliographical references (pages 179-182) and index. 
505 0 |a 1. Basic concepts -- 1.1 Introduction -- 1.2 Types of errors -- 1.3 Channel models -- 1.4 Linear codes and non-linear codes -- 1.5 Block codes and convolutional codes -- 1.6 Problems with solutions. 
505 8 |a 2. Block codes -- 2.1 Introduction -- 2.2 Matrix representation -- 2.3 Minimum distance -- 2.4 Error syndrome and decoding -- 2.4.1 Maximum likelihood decoding -- 2.4.2 Decoding by systematic search -- 2.4.3 Probabilistic decoding -- 2.5 Simple codes -- 2.5.1 Repetition codes -- 2.5.2 Single parity-check codes -- 2.5.3 Hamming codes -- 2.6 Low-density parity-check codes -- 2.7 Problems with solutions. 
505 8 |a 3. Cyclic codes -- 3.1 Matrix representation of a cyclic code -- 3.2 Encoder with n -- k shift-register stages -- 3.3 Cyclic Hamming codes -- 3.4 Maximum-length-sequence codes -- 3.5 Bose-Chaudhuri-Hocquenghem codes -- 3.6 Reed-Solomon codes -- 3.7 Golay codes -- 3.7.1 The binary (23, 12, 7) Golay code -- 3.7.2 The ternary (11, 6, 5) Golay code -- 3.8 Reed-Muller codes -- 3.9 Quadratic residue codes -- 3.10 Alternant codes -- 3.11 Problems with solutions. 
505 8 |a 4. Decoding cyclic codes -- 4.1 Meggitt decoder -- 4.2 Error-trapping decoder -- 4.3 Information set decoding -- 4.4 Threshold decoding -- 4.5 Algebraic decoding -- 4.5.1 Berlekamp-Massey time domain decoding -- 4.5.2 Euclidean frequency domain decoding -- 4.6 Soft-decision decoding -- 4.6.1 Decoding LDPC codes -- 4.7 Problems with solutions. 
505 8 |a 5. Irreducible polynomials over finite fields -- 5.1 Introduction -- 5.2 Order of a polynomial -- 5.3 Factoring xqn -- x -- 5.4 Counting monic irreducible q-ary polynomials -- 5.5 The Moebius inversion technique -- 5.5.1 The additive Moebius inversion formula -- 5.5.2 The multiplicative Moebius inversion formula -- 5.5.3 The number of irreducible polynomials of degree n over GF(q) -- 5.6 Chapter citations -- 5.7 Problems with solutions. 
505 8 |a 6. Finite field factorization of polynomials -- 6.1 Introduction -- 6.2 Cyclotomic polynomials -- 6.3 Canonical factorization -- 6.4 Eliminating repeated factors -- 6.5 Irreducibility of ̲[phi]n(x) over GF(q) -- 6.6 Problems with solutions. 
505 8 |a 7. Constructing f-reducing polynomials -- 7.1 Introduction -- 7.2 Factoring polynomials over large finite fields -- 7.2.1 Resultant -- 7.2.2 Algorithm for factorization based on the resultant -- 7.2.3 The Zassenhaus algorithm -- 7.3 Finding roots of polynomials over finite fields -- 7.3.1 Finding roots when p is large -- 7.3.2 Finding roots when q = pm is large but p is small -- 7.4 Problems with solutions. 
505 8 |a 8. Linearized polynomials -- 8.1 Introduction -- 8.2 Properties of L(x) -- 8.3 Properties of the roots of L(x) -- 8.4 Finding roots of L(x) -- 8.5 Affine q-polynomials -- 8.6 Problems with solutions. 
505 8 |a 9. Goppa codes -- 9.1 Introduction -- 9.2 Parity-check equations -- 9.3 Parity-check matrix of Goppa codes -- 9.4 Algebraic decoding of Goppa codes -- 9.4.1 The Patterson algorithm -- 9.4.2 The Blahut algorithm -- 9.5 The asymptotic Gilbert bound -- 9.6 Quadratic equations over GF(2m) -- 9.7 Adding an overall parity-check digit -- 9.8 Affine transformations -- 9.9 Cyclic binary double-error correcting -- 10. Extended Goppa codes -- 9.10 Extending the Patterson algorithm for decoding Goppa codes -- 9.11 Problems with solutions. 
505 8 |a 10. Coding-based cryptosystems -- 10.1 Introduction -- 10.2 McEliece's public-key cryptosystem -- 10.2.1 Description of the cryptosystem -- 10.2.2 Encryption -- 10.2.3 Decryption -- 10.2.4 Cryptanalysis -- 10.2.5 Trapdoors -- 10.3 Secret-key algebraic coding systems -- 10.3.1 A (possible) known-plaintext attack -- 10.3.2 A chosen-plaintext attack -- 10.3.3 A modified scheme -- 10.4 Problems with solutions. 
505 8 |a 11. Majority logic decoding -- 11.1 Introduction -- 11.2 One-step majority logic decoding -- 11.3 Multiple-step majority logic decoding I -- 11.4 Multiple-step majority logic decoding II -- 11.5 Reed-Muller codes -- 11.6 Affine permutations and code construction -- 11.7 A class of one-step decodable codes -- 11.8 Generalized Reed-Muller codes -- 11.9 Euclidean geometry codes -- 11.10 Projective geometry codes -- 11.11 Problems with solutions. 
505 8 |a Appendices -- A. The Gilbert bound -- A.1. Introduction -- A.2. The binary asymptotic Gilbert bound -- A.3. Gilbert bound for linear codes -- B. MacWilliams' identity for linear codes -- B.1. Introduction -- B.2. The binary symmetric channel -- B.3. Binary linear codes and error detection -- B.4. The q-ary symmetric channel -- B.5. Linear codes over GF(q) -- B.6. The binomial expansion -- B.7. Digital transmission using N regenerative repeaters -- C. Frequency domain decoding tools -- C.1. Finite field Fourier transform -- C.2. The Euclidean algorithm. 
504 |a Bibliography-About the author-Index. 
520 3 |a This book serves as an introductory text to algebraic coding theory. The contents are suitable for final year undergraduate and first year graduate courses in electrical and computer engineering, and will give the reader knowledge of coding fundamentals that is essential for a deeper understanding of state-of-the-art coding systems. This book will also serve as a quick reference for those who need it for specific applications, like in cryptography and communications. Eleven chapters cover linear error-correcting block codes from elementary principles, going through cyclic codes and then covering some finite field algebra, Goppa codes, algebraic decoding algorithms, and applications in public-key cryptography and secret-key cryptography. At the end of each chapter a section containing problems and solutions is included. Three appendices cover the Gilbert bound and some related derivations, a derivation of the MacWilliams' identities based on the probability of undetected error, and two important tools for algebraic decoding, namely, the finite field Fourier transform and the Euclidean algorithm for polynomials. 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Coding theory. 
650 7 |a SCIENCE  |x System Theory.  |2 bisacsh 
650 7 |a TECHNOLOGY & ENGINEERING  |x Operations Research.  |2 bisacsh 
650 7 |a Coding theory.  |2 fast  |0 (OCoLC)fst00866237 
653 |a codes 
653 |a BCH codes 
653 |a Goppa codes 
653 |a decoding 
653 |a majority logic decoding 
653 |a time domain decoding 
653 |a frequency domain decoding 
653 |a Finite fields 
653 |a polynomial factorization 
653 |a error-correcting codes 
653 |a algebraic codes 
653 |a cyclic 
776 0 8 |i Print version:  |z 9781606505748 
830 0 |a Communications and signal processing collection. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=812965  |z Texto completo 
936 |a BATCHLOAD 
938 |a Askews and Holts Library Services  |b ASKH  |n AH34378906 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL1740857 
938 |a ebrary  |b EBRY  |n ebr10899238 
938 |a EBSCOhost  |b EBSC  |n 812965 
938 |a ProQuest MyiLibrary Digital eBook Collection  |b IDEB  |n cis28707725 
938 |a Momentum Press  |b NYMP  |n 9781606505755 
938 |a YBP Library Services  |b YANK  |n 11977984 
994 |a 92  |b IZTAP