Sparse graph code

A Sparse graph code is a code which is represented by a sparse graph. ^[1]

Ask AI

Table of Contents

1. 9 relations: Bit, Code, David J. C. MacKay, Dense graph, Error correction code, Linear code, Low-density parity-check code, Noisy-channel coding theorem, Robert G. Gallager.

Bit

The bit is the most basic unit of information in computing and digital communication.

See Sparse graph code and Bit

Code

In communications and information processing, code is a system of rules to convert information—such as a letter, word, sound, image, or gesture—into another form, sometimes shortened or secret, for communication through a communication channel or storage in a storage medium.

See Sparse graph code and Code

David J. C. MacKay

Sir David John Cameron MacKay (22 April 1967 – 14 April 2016) was a British physicist, mathematician, and academic.

See Sparse graph code and David J. C. MacKay

Dense graph

In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge).

See Sparse graph code and Dense graph

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels.

See Sparse graph code and Error correction code

Linear code

In coding theory, a linear code is an error-correcting code for which any linear combination of codewords is also a codeword.

See Sparse graph code and Linear code

Low-density parity-check code

In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel.

See Sparse graph code and Low-density parity-check code

Noisy-channel coding theorem

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible (in theory) to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel.

See Sparse graph code and Noisy-channel coding theorem

Robert G. Gallager

Robert Gray Gallager (born May 29, 1931) is an American electrical engineer known for his work on information theory and communications networks.

See Sparse graph code and Robert G. Gallager

References

[1] https://en.wikipedia.org/wiki/Sparse_graph_code

Also known as Sparse graph codes.

Unionpedia is a concept map or semantic network organized like an encyclopedia – dictionary. It gives a brief definition of each concept and its relationships.

This is a giant online mental map that serves as a basis for concept diagrams. It's free to use and each article or document can be downloaded. It's a tool, resource or reference for study, research, education, learning or teaching, that can be used by teachers, educators, pupils or students; for the academic world: for school, primary, secondary, high school, middle, technical degree, college, university, undergraduate, master's or doctoral degrees; for papers, reports, projects, ideas, documentation, surveys, summaries, or thesis. Here is the definition, explanation, description, or the meaning of each significant on which you need information, and a list of their associated concepts as a glossary. Available in English, Spanish, Portuguese, Japanese, Chinese, French, German, Italian, Polish, Dutch, Russian, Arabic, Hindi, Swedish, Ukrainian, Hungarian, Catalan, Czech, Hebrew, Danish, Finnish, Indonesian, Norwegian, Romanian, Turkish, Vietnamese, Korean, Thai, Greek, Bulgarian, Croatian, Slovak, Lithuanian, Filipino, Latvian, Estonian and Slovenian. More languages soon.

The information is based on Wikipedia articles and other Wikimedia projects, and it's available under the Creative Commons Attribution-ShareAlike License.

Unionpedia is not endorsed by or affiliated with the Wikimedia Foundation.

Google Play, Android and the Google Play logo are trademarks of Google Inc.

Privacy Policy