Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A new approach to constructing CSS codes based on factor graphs
Information Sciences: an International Journal
Rateless forward error correction for topology-transparent scheduling
IEEE/ACM Transactions on Networking (TON)
Counter braids: a novel counter architecture for per-flow measurement
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Generating random graphs with large girth
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Simulation of the Sum-Product Algorithm Using Stratified Sampling
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
Instanton-based techniques for analysis and reduction of error floors of LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Predicting error floors of structured LDPC codes: deterministic bounds and estimates
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Finite-length scaling of turbo-like code ensembles on the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Capacity-achieving codes for finite-state channels with maximum-likelihood decoding
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Performance of polar codes with the construction using density evolution
IEEE Communications Letters
Doubly generalized LDPC codes over the AWGN channel
IEEE Transactions on Communications
Identical-capacity channel decomposition for design of universal LDPC codes
IEEE Transactions on Communications
IEEE Transactions on Signal Processing
Distributed in-network channel decoding
IEEE Transactions on Signal Processing
Rateless distributed source code design
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
Sharp bounds for optimal decoding of low-density parity-check codes
IEEE Transactions on Information Theory
Finite-length scaling for iteratively decoded LDPC ensembles
IEEE Transactions on Information Theory
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Time-division multiplexing for green broadcasting
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Capacity achieving codes from randomness conductors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Waterfall region performance of punctured LDPC codes over the BEC
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Analytical solution of covariance evolution for regular LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
The Aladdin-Pythagoras space-time code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Performance and construction of polar codes on symmetric binary-input memoryless channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
On unequal error protection of finite-length LDPC codes over BECs: a scaling approach
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Optimized concatenated LDPC codes for joint source-channel coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Adaptive decoding of LDPC codes with binary messages
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Iterative decoding on multiple Tanner graphs using random edge local complementation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Message passing in distributed wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Weight distributions of multi-edge type LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Lower bounds on the graphical complexity of finite-length LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Linear programming bounds on the degree distributions of LDPC code ensembles
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Bounds on the mutual informations of the binary sums of Bernoulli random variables
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Decoding network codes by message passing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Decimation algorithm based on correlations for constraint satisfaction problems on random networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
An error propagation prevention method for MIMO-OFDM RLS-DDCE-algorithms
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
High-rate random-like spherical fingerprinting codes with linear decoding complexity
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
An efficient on-the-fly encoding algorithm for binary and finite field LDPC codes
IEEE Communications Letters
Waterfall performance analysis of finite-length LDPC codes on symmetric channels
IEEE Transactions on Communications
Linear LLR approximation for iterative decoding on wireless channels
IEEE Transactions on Communications
IEEE Transactions on Communications
Fountain code design for data multicast with side information
IEEE Transactions on Wireless Communications
Embedding reject option in ECOC through LDPC codes
MCS'07 Proceedings of the 7th international conference on Multiple classifier systems
Doubly-generalized LDPC codes: stability bound over the BEC
IEEE Transactions on Information Theory
Design of irregular LDPC codes with optimized performance-complexity tradeoff
IEEE Transactions on Communications
Joint nonlinear channel equalization and soft LDPC decoding with Gaussian processes
IEEE Transactions on Signal Processing
LP decoding meets LP decoding: a connection between channel coding and compressed sensing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The compound capacity of polar codes
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Can iterative decoding for erasure correlated sources be universal?
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
LDPC codes for the cascaded BSC-BAWGN channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Interference networks with local view: a distributed optimization approach
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Cooperative uplink of two mobile stations with network coding based on the WiMax LDPC code
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Behavior of hybrid optical/RF channels over varying link distances
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient ranking of rate-compatible puncturing patterns for a given LDPC code matrix
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
LDPC codes for physical layer security
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Error resilient non-asymmetric Slepian-Wolf coding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A low complexity iterative technique for soft decision decoding of reed-solomon codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Message passing resource allocation for the uplink of multicarrier systems
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Robust MAC-lite and soft header recovery for packetized multimedia transmission
IEEE Transactions on Communications
On the undetected error probability of binary matrix ensembles
IEEE Transactions on Information Theory
IEEE Transactions on Wireless Communications
Two edge type LDPC codes for the wiretap channel
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Capacity regions of two new classes of two-receiver broadcast channels
IEEE Transactions on Information Theory
Low-density parity-check codes for nonergodic block-fading channels
IEEE Transactions on Information Theory
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
IEEE Transactions on Information Theory
Cooperation in the low power regime for the MAC using multiplexed rateless codes
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Algorithms and theory of computation handbook
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
LDPC code design considerations for non-uniform channels
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Analysis and construction of full-diversity joint network-LDPC codes for cooperative communications
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Signal shaping for bit-interleaved coded modulation on the AWGN channel
IEEE Transactions on Communications
IEEE Transactions on Communications
UEP concepts in modulation and coding
Advances in Multimedia
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
SIAM Journal on Control and Optimization
Summarizing transactional databases with overlapped hyperrectangles
Data Mining and Knowledge Discovery
LT-codes and phase transitions for mutual information
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Reducing Repair Traffic in P2P Backup Systems: Exact Regenerating Codes on Hierarchical Codes
ACM Transactions on Storage (TOS)
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bounds on threshold of regular random k-SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
What can coding theory do for storage systems?
ACM SIGACT News
Efficient crowdsourcing for multi-class labeling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel
Quantum Information & Computation
Dualities and identities for entanglement-assisted quantum codes
Quantum Information Processing
Hi-index | 0.86 |
Having trouble deciding which coding scheme to employ, how to design a new scheme, or how to improve an existing system? This summary of the state-of-the-art in iterative coding makes this decision more straightforward. With emphasis on the underlying theory, techniques to analyse and design practical iterative coding systems are presented. Using Gallager's original ensemble of LDPC codes, the basic concepts are extended for several general codes, including the practically important class of turbo codes. The simplicity of the binary erasure channel is exploited to develop analytical techniques and intuition, which are then applied to general channel models. A chapter on factor graphs helps to unify the important topics of information theory, coding and communication theory. Covering the most recent advances, this text is ideal for graduate students in electrical engineering and computer science, and practitioners. Additional resources, including instructor's solutions and figures, available online: www.cambridge.org/9780521852296.