Modern Coding Theory
From MaRDI portal
Publication:3503427
DOI10.1017/CBO9780511791338zbMath1188.94001OpenAlexW1536930200MaRDI QIDQ3503427
Thomas J. Richardson, Ruediger Urbanke
Publication date: 5 June 2008
Full work available at URL: https://doi.org/10.1017/cbo9780511791338
Channel models (including quantum) in information and communication theory (94A40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of error-correcting codes and error-detecting codes (94Bxx) Modulation and demodulation in information and communication theory (94A14)
Related Items (72)
Spectral gap in random bipartite biregular graphs and applications ⋮ Phase transitions in discrete structures ⋮ Exact solution of the gauge symmetric \(p\)-spin glass model on a complete graph ⋮ Satisfiability Thresholds beyond k −XORSAT ⋮ Strong replica symmetry in high-dimensional optimal Bayesian inference ⋮ On Shannon’s Duality of a Source and a Channel and Nonanticipative Communication and Communication for Control ⋮ On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\) ⋮ Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds ⋮ The asymptotics of the clustering transition for random constraint satisfaction problems ⋮ Limits of discrete distributions and Gibbs measures on random graphs ⋮ Application of the information-percolation method to reconstruction problems on graphs ⋮ Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory ⋮ Finding one community in a sparse graph ⋮ Harnessing the Bethe free energy ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Summarizing transactional databases with overlapped hyperrectangles ⋮ Cooperation in partly observable networked markets ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ A Friendly Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists ⋮ Design and decoding of polar codes with large kernels: a survey ⋮ Theory behind quantum error correcting codes: an overview ⋮ Neural decoders with permutation invariant structure ⋮ Controllability and adaptation of linear time-invariant systems under irregular and Markovian sampling ⋮ Metastability of the Potts ferromagnet on random regular graphs ⋮ Reduction of recursive filters to representations by sparse matrices ⋮ Distributed optimal frequency control under communication packet loss in multi-agent electric energy systems ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Convergence and Correctness of Max-Product Belief Propagation for Linear Programming ⋮ How to recover a secret with \(O(n)\) additions ⋮ Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases ⋮ Expander graphs and their applications ⋮ A library for formalization of linear error-correcting codes ⋮ On Resolving Simultaneous Congruences Using Belief Propagation ⋮ On Decoding Grid Cell Population Codes Using Approximate Belief Propagation ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Message-passing algorithms for inference and optimization ⋮ Dualities and identities for entanglement-assisted quantum codes ⋮ Quantum graphical models and belief propagation ⋮ Bethe states of random factor graphs ⋮ Variational Bayes and a problem of reliable communication: II. Infinite systems ⋮ Chains of mean-field models ⋮ Charting the replica symmetric phase ⋮ Charting the replica symmetric phase ⋮ Some ``good properties of LDA lattices ⋮ Rational maps and maximum likelihood decodings ⋮ Hypermap-homology quantum codes ⋮ The satisfiability threshold for random linear equations ⋮ Spin systems on Bethe lattices ⋮ Model counting with error-correcting codes ⋮ Gibbs measures and phase transitions on sparse random graphs ⋮ Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes ⋮ Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition ⋮ Extremal problems concerning ordered intersections of sets ⋮ The curse of overparametrization in adversarial training: precise analysis of robust generalization for random features regression ⋮ SCA-LDPC: a code-based framework for key-recovery side-channel attacks on post-quantum encryption schemes ⋮ Redundancy of codes with graph constraints ⋮ The set of solutions of random XORSAT formulae ⋮ Generating Random Networks Without Short Cycles ⋮ Toward a Unified Framework for Cognitive Maps ⋮ Implementing gradient descent decoding ⋮ Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions ⋮ Fermions and loops on graphs: I. Loop calculus for determinants ⋮ The non-backtracking spectrum of the universal cover of a graph ⋮ A decoding approach to fault tolerant control of linear systems with quantised disturbance input ⋮ MB iterative decoding algorithm on systematic LDGM codes: performance evaluation ⋮ Gauges, loops, and polynomials for partition functions of graphical models ⋮ Unnamed Item ⋮ On local weak limit and subgraph counts for sparse random graphs ⋮ The rank of sparse random matrices ⋮ High efficiency postprocessing for continuous-variable quantum key distribution: using all raw keys for parameter estimation and key extraction ⋮ Reed-Muller Codes ⋮ The planted k-factor problem
This page was built for publication: Modern Coding Theory
