Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Vera Pless"'
Autor:
W. Cary Huffman, Vera Pless
Fundamentals of Error Correcting Codes is an in-depth introduction to coding theory from both an engineering and mathematical viewpoint. As well as covering classical topics, there is much coverage of techniques which could only be found in specialis
Autor:
Janet Beissinger, Vera Pless
Join the Cryptokids as they apply basic mathematics to make and break secret codes. This book has many hands-on activities that have been tested in both classrooms and informal settings. Classic coding methods are discussed, such as Caesar, substitut
Autor:
Vera Pless
Publikováno v:
The Cryptoclub Workbook ISBN: 9780429061752
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57840d445d5c7877ff2c4cccd1ebf1c2
https://doi.org/10.1201/b10693-4
https://doi.org/10.1201/b10693-4
Autor:
Vera Pless
Publikováno v:
The Cryptoclub Workbook ISBN: 9780429061752
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::908e221b53e334e2f1027cb5443ddd70
https://doi.org/10.1201/b10693-19
https://doi.org/10.1201/b10693-19
Publikováno v:
IEEE Transactions on Information Theory. 50:2378-2388
Low-density parity-check (LDPC) codes are serious contenders to turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m/s
Publikováno v:
Discrete Mathematics. 264:55-73
The main purpose of this paper is to decode the binary Reed–Muller [32,16,8] code R(2,5) by hand by two methods. One, the representation decoding method, is the analogue of the method used to decode the Golay code [8]. The other is the syndrome dec
Autor:
Jon-Lark Kim, Vera Pless
Publikováno v:
Designs, Codes and Cryptography. 30:187-199
The purpose of this paper is to study designs in additive codes over GF(4). There are two types of designs. One is a classical t-design with repeated blocks. In this case we have an analog of the Assmus–Mattson Theorem for additive codes over GF(4)
Publikováno v:
SIAM Journal on Discrete Mathematics. 16:591-603
We study certain projections of binary linear codes onto larger fields. These projections include the well-known projection of the extended Golay [24,12,8] code onto the hexacode over $\mbox{GF}(4)$ and the projection of the Reed--Muller code R(2,5)