- Applied mathematics
- >
- Algorithms
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Discrete mathematics
- >
- Coding theory
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Information theory
- >
- Coding theory
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Mathematical logic
- >
- Algorithms
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Statistical theory
- >
- Information theory
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Theoretical computer science
- >
- Algorithms
- >
- Error detection and correction
- >
- Capacity-approaching codes

- Theoretical computer science
- >
- Information theory
- >
- Error detection and correction
- >
- Capacity-approaching codes

Turbo code

In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in 1993. They we

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. An LDPC code is constructed using

Fountain code

In coding theory, fountain codes (also known as rateless erasure codes) are a class of erasure codes with the property that a potentially limitless sequence of encoding symbols can be generated from a

Polar code (coding theory)

In information theory, a polar code is a linear block error-correcting code. The code construction is based on a multiple recursive concatenation of a short kernel code which transforms the physical c

Tornado code

In coding theory, Tornado codes are a class of erasure codes that support error correction. Tornado codes require a constant C more redundant blocks than the more data-efficient Reed–Solomon erasure c

Expander code

In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs.Along with Justesen codes, expander codes are of particular interest since t

© 2023 Useful Links.