The Resource Coding theory and cryptography : the essentials, D.R. Hankerson [and others]

Coding theory and cryptography : the essentials, D.R. Hankerson [and others]

Label
Coding theory and cryptography : the essentials
Title
Coding theory and cryptography
Title remainder
the essentials
Statement of responsibility
D.R. Hankerson [and others]
Contributor
Subject
Language
eng
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
LC call number
QA268
LC item number
.C69 2000
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Hankerson, Darrel R
http://library.link/vocab/subjectName
  • Coding theory
  • Cryptography
  • Teoría de la codificación
  • Codage
  • Cryptographie
  • Coding theory
  • Cryptography
  • Kryptologie
  • Codierung
Label
Coding theory and cryptography : the essentials, D.R. Hankerson [and others]
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. 335-342) and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • 1.4
  • 3.9
  • Fast decoding for RM(1, m)
  • 88
  • 4
  • Cyclic Linear Codes
  • 91
  • 4.1
  • Polynomials and words
  • 91
  • 4.2
  • Information rate
  • Introduction to cyclic codes
  • 96
  • 4.3
  • Generating and parity check matrices for cyclic codes
  • 101
  • 4.4
  • Finding cyclic codes
  • 104
  • 4.5
  • Dual cyclic codes
  • 6
  • 109
  • 5
  • BCH Codes
  • 111
  • 5.1
  • Finite fields
  • 111
  • 5.2
  • Minimal polynomials
  • 115
  • 1.5
  • 5.3
  • Cyclic Hamming codes
  • 118
  • 5.4
  • BCH codes
  • 120
  • 5.5
  • Decoding 2 error-correcting BCH code
  • 122
  • 6
  • Effects of error correction and detection
  • Reed-Solomon Codes
  • 127
  • 6.1
  • Codes over GF(2[superscript r])
  • 127
  • 6.2
  • Reed-Solomon codes
  • 129
  • 6.3
  • Decoding Reed-Solomon codes
  • 7
  • 135
  • 6.4
  • Transform approach to Reed-Solomon codes
  • 141
  • 6.5
  • Berlekamp-Massey algorithm
  • 148
  • 6.6
  • Erasures
  • 153
  • 1.6
  • 7
  • Burst Error-Correcting Codes
  • 159
  • 7.2
  • Interleaving
  • 163
  • 7.3
  • Application to compact discs
  • 170
  • 8
  • Finding the most likely codeword transmitted
  • Convolutional Codes
  • 173
  • 8.1
  • Shift registers and polynomials
  • 173
  • 8.2
  • Encoding convolutional codes
  • 179
  • 8.3
  • Decoding convolutional codes
  • 8
  • 186
  • 8.4
  • Truncated Viterbi decoding
  • 193
  • 9
  • Reed-Muller and Preparata Codes
  • 205
  • 9.1
  • Reed-Muller codes
  • 205
  • 1.7
  • 9.2
  • Decoding Reed-Muller codes
  • 208
  • 9.3
  • Extended Preparata codes
  • 213
  • 9.4
  • Encoding extended Preparata codes
  • 219
  • 9.5
  • Part I
  • Some basic algebra
  • Decoding extended Preparata codes
  • 222
  • Part II
  • Cryptography
  • 10
  • Classical Cryptography
  • 227
  • 10.1
  • Encryption schemes
  • 228
  • 10
  • 10.2
  • Symmetric-key encryption
  • 230
  • 10.3
  • Feistel ciphers and DES
  • 238
  • 10.3.1
  • New Data Seal
  • 240
  • 10.3.2
  • 1.8
  • Data Encryption Standard
  • 243
  • 11
  • Topics in Algebra and Number Theory
  • 253
  • 11.1
  • Algorithms, complexity, and modular arithmetic
  • 253
  • 11.2
  • Quadratic residues
  • Weight and distance
  • 260
  • 11.3
  • Primality testing
  • 264
  • 11.4
  • Factoring and square roots
  • 267
  • 11.4.1
  • Pollard's rho
  • 267
  • 11
  • 11.4.2
  • Random squares
  • 269
  • 11.4.3
  • Square roots
  • 271
  • 11.5
  • Discrete logarithms
  • 274
  • 11.5.1
  • 1.9
  • Baby-step giant-step
  • 274
  • 11.5.2
  • Index calculus
  • 275
  • 12
  • Public-key Cryptography
  • 279
  • 12.1
  • One-way and hash functions
  • Maximum likelihood decoding
  • 280
  • 12.2
  • RSA
  • 284
  • 12.3
  • Provable security
  • 290
  • 12.4
  • ElGamal
  • 293
  • 12
  • 12.5
  • Cryptographic protocols
  • 297
  • 12.5.1
  • Diffie-Hellman key agreement
  • 298
  • 12.5.2
  • Zero-knowledge proofs
  • 299
  • 12.5.3
  • 1.10
  • Coin-tossing and mental poker
  • 301
  • A Euclidean Algorithm
  • 307
  • B
  • Factorization of 1 + x[superscript n]
  • 311
  • C
  • Example of Compact Disc Encoding
  • 313
  • Reliability of MLD
  • Coding Theory
  • 16
  • 1.11
  • Error-detecting codes
  • 18
  • 1.12
  • Error-correcting codes
  • 22
  • 2
  • Linear Codes
  • 27
  • 1
  • 2.2
  • Two important subspaces
  • 28
  • 2.3
  • Independence, basis, dimension
  • 30
  • 2.4
  • Matrices
  • 35
  • 2.5
  • Introduction to Coding Theory
  • Bases for C = <S> and C[superscript perpendicular, bottom]
  • 37
  • 2.6
  • Generating matrices and encoding
  • 41
  • 2.7
  • Parity-check matrices
  • 45
  • 2.8
  • Equivalent codes
  • 1
  • 48
  • 2.9
  • Distance of a linear code
  • 52
  • 2.10
  • Cosets
  • 53
  • 2.11
  • MLD for linear codes
  • 57
  • 1.3
  • 2.12
  • Reliability of IMLD for linear codes
  • 62
  • 3
  • Perfect and Related Codes
  • 65
  • 3.1
  • Some bounds for codes
  • 65
  • 3.2
  • Correcting and detecting error patterns
  • Perfect codes
  • 70
  • 3.3
  • Hamming codes
  • 72
  • 3.4
  • Extended codes
  • 75
  • 3.5
  • Extended Golay code
  • 4
  • 77
  • 3.6
  • Decoding the extended Golay code
  • 79
  • 3.7
  • Golay code
  • 82
  • 3.8
  • Reed-Muller codes
  • 84
Dimensions
24 cm.
Edition
2nd ed., rev. and expanded.
Extent
x, 350 pages
Isbn
9780824704650
Isbn Type
(alk. paper)
Lccn
00060106
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
System control number
  • (OCoLC)44669778
  • (OCoLC)ocm44669778
Label
Coding theory and cryptography : the essentials, D.R. Hankerson [and others]
Publication
Bibliography note
Includes bibliographical references (p. 335-342) and index
Carrier category
volume
Carrier category code
nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • 1.4
  • 3.9
  • Fast decoding for RM(1, m)
  • 88
  • 4
  • Cyclic Linear Codes
  • 91
  • 4.1
  • Polynomials and words
  • 91
  • 4.2
  • Information rate
  • Introduction to cyclic codes
  • 96
  • 4.3
  • Generating and parity check matrices for cyclic codes
  • 101
  • 4.4
  • Finding cyclic codes
  • 104
  • 4.5
  • Dual cyclic codes
  • 6
  • 109
  • 5
  • BCH Codes
  • 111
  • 5.1
  • Finite fields
  • 111
  • 5.2
  • Minimal polynomials
  • 115
  • 1.5
  • 5.3
  • Cyclic Hamming codes
  • 118
  • 5.4
  • BCH codes
  • 120
  • 5.5
  • Decoding 2 error-correcting BCH code
  • 122
  • 6
  • Effects of error correction and detection
  • Reed-Solomon Codes
  • 127
  • 6.1
  • Codes over GF(2[superscript r])
  • 127
  • 6.2
  • Reed-Solomon codes
  • 129
  • 6.3
  • Decoding Reed-Solomon codes
  • 7
  • 135
  • 6.4
  • Transform approach to Reed-Solomon codes
  • 141
  • 6.5
  • Berlekamp-Massey algorithm
  • 148
  • 6.6
  • Erasures
  • 153
  • 1.6
  • 7
  • Burst Error-Correcting Codes
  • 159
  • 7.2
  • Interleaving
  • 163
  • 7.3
  • Application to compact discs
  • 170
  • 8
  • Finding the most likely codeword transmitted
  • Convolutional Codes
  • 173
  • 8.1
  • Shift registers and polynomials
  • 173
  • 8.2
  • Encoding convolutional codes
  • 179
  • 8.3
  • Decoding convolutional codes
  • 8
  • 186
  • 8.4
  • Truncated Viterbi decoding
  • 193
  • 9
  • Reed-Muller and Preparata Codes
  • 205
  • 9.1
  • Reed-Muller codes
  • 205
  • 1.7
  • 9.2
  • Decoding Reed-Muller codes
  • 208
  • 9.3
  • Extended Preparata codes
  • 213
  • 9.4
  • Encoding extended Preparata codes
  • 219
  • 9.5
  • Part I
  • Some basic algebra
  • Decoding extended Preparata codes
  • 222
  • Part II
  • Cryptography
  • 10
  • Classical Cryptography
  • 227
  • 10.1
  • Encryption schemes
  • 228
  • 10
  • 10.2
  • Symmetric-key encryption
  • 230
  • 10.3
  • Feistel ciphers and DES
  • 238
  • 10.3.1
  • New Data Seal
  • 240
  • 10.3.2
  • 1.8
  • Data Encryption Standard
  • 243
  • 11
  • Topics in Algebra and Number Theory
  • 253
  • 11.1
  • Algorithms, complexity, and modular arithmetic
  • 253
  • 11.2
  • Quadratic residues
  • Weight and distance
  • 260
  • 11.3
  • Primality testing
  • 264
  • 11.4
  • Factoring and square roots
  • 267
  • 11.4.1
  • Pollard's rho
  • 267
  • 11
  • 11.4.2
  • Random squares
  • 269
  • 11.4.3
  • Square roots
  • 271
  • 11.5
  • Discrete logarithms
  • 274
  • 11.5.1
  • 1.9
  • Baby-step giant-step
  • 274
  • 11.5.2
  • Index calculus
  • 275
  • 12
  • Public-key Cryptography
  • 279
  • 12.1
  • One-way and hash functions
  • Maximum likelihood decoding
  • 280
  • 12.2
  • RSA
  • 284
  • 12.3
  • Provable security
  • 290
  • 12.4
  • ElGamal
  • 293
  • 12
  • 12.5
  • Cryptographic protocols
  • 297
  • 12.5.1
  • Diffie-Hellman key agreement
  • 298
  • 12.5.2
  • Zero-knowledge proofs
  • 299
  • 12.5.3
  • 1.10
  • Coin-tossing and mental poker
  • 301
  • A Euclidean Algorithm
  • 307
  • B
  • Factorization of 1 + x[superscript n]
  • 311
  • C
  • Example of Compact Disc Encoding
  • 313
  • Reliability of MLD
  • Coding Theory
  • 16
  • 1.11
  • Error-detecting codes
  • 18
  • 1.12
  • Error-correcting codes
  • 22
  • 2
  • Linear Codes
  • 27
  • 1
  • 2.2
  • Two important subspaces
  • 28
  • 2.3
  • Independence, basis, dimension
  • 30
  • 2.4
  • Matrices
  • 35
  • 2.5
  • Introduction to Coding Theory
  • Bases for C = <S> and C[superscript perpendicular, bottom]
  • 37
  • 2.6
  • Generating matrices and encoding
  • 41
  • 2.7
  • Parity-check matrices
  • 45
  • 2.8
  • Equivalent codes
  • 1
  • 48
  • 2.9
  • Distance of a linear code
  • 52
  • 2.10
  • Cosets
  • 53
  • 2.11
  • MLD for linear codes
  • 57
  • 1.3
  • 2.12
  • Reliability of IMLD for linear codes
  • 62
  • 3
  • Perfect and Related Codes
  • 65
  • 3.1
  • Some bounds for codes
  • 65
  • 3.2
  • Correcting and detecting error patterns
  • Perfect codes
  • 70
  • 3.3
  • Hamming codes
  • 72
  • 3.4
  • Extended codes
  • 75
  • 3.5
  • Extended Golay code
  • 4
  • 77
  • 3.6
  • Decoding the extended Golay code
  • 79
  • 3.7
  • Golay code
  • 82
  • 3.8
  • Reed-Muller codes
  • 84
Dimensions
24 cm.
Edition
2nd ed., rev. and expanded.
Extent
x, 350 pages
Isbn
9780824704650
Isbn Type
(alk. paper)
Lccn
00060106
Media category
unmediated
Media MARC source
rdamedia
Media type code
n
Other physical details
illustrations
System control number
  • (OCoLC)44669778
  • (OCoLC)ocm44669778

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...