Live briefing
Everything about Sparse graph code
Code represented by sparse graph
A sparse graph code is a code which is represented by a sparse graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sparse graph codeA 5-minute orientation
- Pick up a classic book: Data structures and algorithms in JavaThe most-reprinted book on the subject
- Read the landmark paper: Impact of Factor Graph on Average Sum Rate for Uplink Sparse Code Multiple Access SystemsCited 25 times
- Go sideways: Low-density parity-check codeA closely related topic
- Go sideways: Parity bitA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Impact of Factor Graph on Average Sum Rate for Uplink Sparse Code Multiple Access Systems
Sub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems
Designing a Good Low-Rate Sparse-Graph Code
Joint sparse graph over GF( q ) for code division multiple access systems
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes
Active learning for hyperspectral image classification using sparse code histogram and graph-based spatial refinement
Next-Generation Passive Optical Network Based on Sparse Code Multiple Access and Graph Neural Networks
Fast Convergent LDPC-like BP List Decoding Algorithm for Polar Code Based on Partially Permutation Sparse Graph
📚 Books worth reading
Data structures and algorithms in JavaAdam Drozdek · 2001
An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
Computer algorithmsEllis Horowitz · 1997
Information Theory, Inference & Learning AlgorithmsDavid J.C. MacKay · 2003
Mathematical Methodologies in Pattern Recognition and Machine LearningPedro Latorre Carmona · 2012
Data structures, algorithms, and applications in C++Sartaj Sahni · 1998
Emerging Technologies for Information Systems, Computing, and ManagementW. Eric Wong · 2013
Coding the MatrixPhilip N. Klein · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Low-density parity-check code Low-density parity-check (LDPC) codes, also known as Gallager codes, are a class of error-correction codes first proposed in 1960. Together with the closely…
- Parity bit A parity bit, or check bit, is a bit added to a string of binary code. Parity bits are a simple form of error detecting code. Parity bits are generally…
- List of algebraic coding theory topics This is a list of algebraic coding theory topics. ARQ Adler-32 Algebraic geometry code BCH code BCJR algorithm Belief propagation Berger code Berlekamp–Massey…
- Hamming code In computer science and telecommunications, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors…
- Hybrid automatic repeat request Hybrid automatic repeat request (hybrid ARQ or HARQ) is a combination of high-rate forward error correction (FEC) and automatic repeat request (ARQ) error-contr…
- Error detection and correction In information theory and coding theory with applications in computer science and telecommunications, error detection and correction (EDAC) or error control…
- Sudoku code Sudoku codes are non-linear forward error correcting codes following rules of sudoku puzzles designed for an erasure channel. Based on this model, the…
- Error correction code In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling…