Modern Coding Theory
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Channel models (including quantum) in information and communication theory (94A40) Modulation and demodulation in information and communication theory (94A14) Theory of error-correcting codes and error-detecting codes (94Bxx)
Recommendations
Cited in
(92)- Finding one community in a sparse graph
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
- Metastability of the Potts ferromagnet on random regular graphs
- Variational Bayes and a problem of reliable communication. II: Infinite systems
- A library for formalization of linear error-correcting codes
- A Friendly Tutorial on Mean-Field Spin Glass Techniques for Non-Physicists
- The rank of sparse random matrices
- Signalling and control of nonlinear partially observable stochastic systems: information states, sufficient statistics, and applications
- Identifying an unknown code by partial Gaussian elimination
- Spin systems on Bethe lattices
- Constrained coding and soft iterative decoding
- On local weak limit and subgraph counts for sparse random graphs
- Iterative Error Correction
- Summarizing transactional databases with overlapped hyperrectangles
- Bethe states of random factor graphs
- Rational maps and maximum likelihood decodings
- High efficiency postprocessing for continuous-variable quantum key distribution: using all raw keys for parameter estimation and key extraction
- Statistical decoding 2.0: reducing decoding to LPN
- Hypermap-homology quantum codes
- Codes based on dyadic matrices and their generalizations
- The satisfiability threshold for random linear equations
- Exact solution of the gauge symmetric \(p\)-spin glass model on a complete graph
- Toward a Unified Framework for Cognitive Maps
- Design and decoding of polar codes with large kernels: a survey
- Formalization of Error-Correcting Codes: From Hamming to Modern Coding Theory
- Theory behind quantum error correcting codes: an overview
- Phase transitions in discrete structures
- Model counting with error-correcting codes
- On Shannon's duality of a source and a channel and nonanticipative communication and communication for control
- Sparse regression codes
- Neural decoders with permutation invariant structure
- A Hopf-like formula for mean-field spin glass models
- Charting the replica symmetric phase
- Some ``good properties of LDA lattices
- Gauges, loops, and polynomials for partition functions of graphical models
- Spectral gap in random bipartite biregular graphs and applications
- The planted k-factor problem
- A toolbox for refined information-theoretic analyses
- Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation
- Reduction of recursive filters to representations by sparse matrices
- SCA-LDPC: a code-based framework for key-recovery side-channel attacks on post-quantum encryption schemes
- On decoding grid cell population codes using approximate belief propagation
- A decoding approach to fault tolerant control of linear systems with quantised disturbance input
- Design of polar codes with large kernels
- Limits of discrete distributions and Gibbs measures on random graphs
- Distributed optimal frequency control under communication packet loss in multi-agent electric energy systems
- LT-codes and phase transitions for mutual information. (Invited talk)
- Fermions and loops on graphs. I: Loop calculus for determinants
- How to recover a secret with O(n) additions
- A construction of random bigraphs and their application to error correction codes
- Charting the replica symmetric phase
- Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds
- Linear codes with few weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- The full rank condition for sparse random matrices
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation
- Strong replica symmetry in high-dimensional optimal Bayesian inference
- Binary codes from subset inclusion matrices
- Dualities and identities for entanglement-assisted quantum codes
- Generating random networks without short cycles
- Redundancy of codes with graph constraints
- Reed-Muller Codes
- Channel Codes
- The set of solutions of random XORSAT formulae
- Controllability and adaptation of linear time-invariant systems under irregular and Markovian sampling
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- The asymptotics of the clustering transition for random constraint satisfaction problems
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions
- Algebraic dynamical systems from LDPC codes satisfy a strong negation of the weak Pinsker property
- Gibbs measures and phase transitions on sparse random graphs
- Implementing gradient descent decoding
- On resolving simultaneous congruences using belief propagation
- Harnessing the Bethe free energy
- Spectral gap and stability for groups and non-local games
- The set of solutions of random XORSAT formulae
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- The non-backtracking spectrum of the universal cover of a graph
- Application of the information-percolation method to reconstruction problems on graphs
- Chains of mean-field models
- Expander graphs and their applications
- Efficient information reconciliation in quantum key distribution systems using informed design of non-binary LDPC codes
- Unsourced random access
- Message-passing algorithms for inference and optimization
- Cooperation in partly observable networked markets
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- Quantum graphical models and belief propagation
- Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures
- Satisfiability thresholds beyond k-XORSAT
- High-dimensional learning of narrow neural networks
- Extremal problems concerning ordered intersections of sets
- The curse of overparametrization in adversarial training: precise analysis of robust generalization for random features regression
This page was built for publication: Modern Coding Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503427)
