상세정보

Information, Coding and Mathematics is a classic reference for both professional and academic researchers working in error-correction coding and decoding, Shannon theory, cryptography, digital communications, information security, and electronic engineering.
The work represents a collection of contributions from leading experts in turbo coding, cryptography and sequences, Shannon theory and coding bounds, and decoding theory and applications. All of the contributors have individually and collectively dedicated their work as a tribute to the outstanding work of Robert J. McEliece.
Information, Coding and Mathematics covers the latest advances in the widely used and rapidly developing field of information and communication technology.

Information, Coding and Mathematics is a classic reference for both professional and academic researchers working in error-correction coding and decoding, Shannon theory, cryptography, digital communications, information security, and electronic engineering.
The work represents a collection of contributions from leading experts in turbo coding, cryptography and sequences, Shannon theory and coding bounds, and decoding theory and applications. All of the contributors have individually and collectively dedicated their work as a tribute to the outstanding work of Robert J. McEliece.
Information, Coding and Mathematics covers the latest advances in the widely used and rapidly developing field of information and communication technology.

정보제공 :

Preface. 1. A Computational Theory of Surprise; P. Baldi. 2. Dynamic Key Distribution Using MDS Codes; L. Xu. 3. Worst-Case Mutual Information Trajectories in Concatenated Codes with Asymptotic Interleavers; D. Divsalar, S. Shamai. 4. Results to get Maximal Quasihermitian Curves. New possibilities for AG Codes; R.J. McEliece, M.C. Rodriguez-Palanquex. 5. On Asymmetric Error Detection with Feedback; P. Oprisan, B. Bose. 6. Cryptanalysis of Block Ciphers and Weight Divisibility of Some Binary Codes; A. Canteaut, et al. 7. Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece Public-Key Cryptosystem; E.R. Verheul, et al. 8. Reducible Rank Codes and Applications to Cryptography; E.M. Gabidulin, et al. 9. On a Boolean Maximization Problem; S.W. Golomb, W. Chu. 10. On the Security of the McEliece Public-Key Cryptosystem; N. Sendrier. 11. Performance of MIMO Space Time-Coding with Discrete Modulations on Flat Fading Channels; J.-F. Chen. 12. Coding for Slow-Frequency-Hop Transmission: Variations on a Theme of McEliece; T.G. Macdonald, M.B. Pursley. 13. On Graph Constructions for LDPC Codes by Quasi-Cyclic Extension; R.M. Tanner. 14. On the Channel Memory-Diversity Tradeoff in Communication Systems; A.P. Worthen, W.E. Stark. 15. Duality, Dirty Paper Coding, and Capacity for Multiuser Wireless Channels; N. Jindal, et al. 16. Stability Analysis of the Turbo Decoding Algorithm Using Max-Log-MAP; W.-S. Wu, et al. 17. Recursive List Decoding for Reed-Muller Codesand their Subcodes; I. Dumer, K. Shabunov. 18. Adaptive Soft-Decision Decoding In Two Dimensions; X.-H. Peng, et al. 19. On the Theory of Linear Trellises; R. Koetter, A. Vardy. 20. Coding Over Graphs; A. Jiang, J. Bruck. 21. On Approaching the Capacity of Finite-State Intersymbol Interference Channels; J.B. Soriaga, et al.

정보제공 :