Containing data on number theory, encryption schemes, and cyclic codes, this highly successful textbook, proven by the authors in a popular two-quarter course, presents coding theory, construction, encoding, and decoding of specific code families in an qeasy-to-useq manner appropriate for students with only a basic background in mathematics offering revised and updated material on the Berlekamp-Massey decoding algorithm and convolutional codes. Introducing the mathematics as it is needed and providing exercises with solutions, this edition includes an extensive section on cryptography, designed for an introductory course on the subject.The rth order Reed-Muller code of length 2a#39;a will be denoted by RM (r, m), 0 5 r 5 m. ... [G(m a1, m)] 0. . .01 Example 3.8.2 The generator matrices for RM (0, 1) and RM (1, 1) are G(O, l) :[1 1]and G(l, l) I Example 3.8.3 Let m = 2, then the length isanbsp;...
|Title||:||Coding Theory and Cryptography|
|Author||:||D.C. Hankerson, Gary Hoffman, D.A. Leonard, Charles C. Lindner, K.T. Phelps, C.A. Rodger, J.R. Wall|
|Publisher||:||CRC Press - 2000-08-04|