Information, Coding and Mathematics
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Computational Theory of Surprise
Dynamic Group Key Distribution Using MDS Codes
WorstCase Mutual Information Trajectories in Concatenated Codes with Asymptotic Interleaves
Results to get Maximal Quasihermitian Curves New possibilities for AG Codes
On Asymmetric Error Detection with Feedback
Cryptanalysis of block ciphers and weight divisibility of some binary codes
Sloppy Alice attacks Adaptive chosen ciphertext attacks on the McEliece PublicKey Cryptosystem
Reducible Rank Codes and Applications to Cryptography
Variations on a Theme of McEliece
On Graph Constructions for LDPC Codes by QuasiCyclic Extension
On the Channel MemoryDiversity Tradeoff in Communication Systems
Duality Dirty Paper Coding and Capacity for Multiuser Wireless Channels
Stability Analysis of the Turbo Decoding Algorithm Using MaxLogMAP
Recursive List Decoding for ReedMuller Codes and Their Subcodes
Adaptive SoftDecision Decoding In Two Dimensions
On the Theory of Linear Trellises
On a Boolean Maximization Problem
On the Security of the McEliece PublicKey Cryptosystem
Performance of MIMO SpaceTime Coding with Discrete Modulations
Coding Over Graphs
On Approaching the Capacity of FiniteState Intersymbol Interference Channels
Other editions - View all
achieve attacks binary block ciphers bound capacity region channel estimation ciphertext codes of length codeword column communication computation convergence corresponding cryptanalysis cryptosystem cutoff cycle decoding algorithm defined denote differential cryptanalysis dwell interval edge encoding encryption error probability fading channels frequency-hop Gaussian given Goppa codes hard-decision Hermitian codes hop length IEEE IEEE Trans information rate Information Theory input integers iterative decoding key distribution label sequence layered diversity coloring LDPC Lemma linear code linear cryptanalysis linear trellis matrix McEliece cryptosystem MDS code minimum distance minimum rate capacity multicast node noise obtained optimal output parameters partial-band performance permutation polynomial public-key quasi-descendants R. J. McEliece random received recursive reduced Reed-Muller codes Reed-Solomon codes rekeying RM codes scheme Section session key side information soft-decision decoding symbols syndrome tail-biting trellises TDA using Max-Log-MAP Theorem transmitted trellis turbo codes values vertices weight