AN codes
BCH code
Constant-weight code
Convolutional code
Group codes
Golay codes, of which the Binary Golay cipher is of applied interest
Goppa code, acclimated in the McEliece cryptosystem
Hadamard code
Hagelbarger code
Hamming code
Latin aboveboard based cipher for non-white babble (prevalent for classic in broadband over powerlines)
Lexicographic code
Long code
Low-density parity-check code, aswell accepted as Gallager code, as the classic for dispersed blueprint codes
LT code, which is a near-optimal rateless abandoning acclimation cipher (Fountain code)
m of n codes
Online code, a near-optimal rateless abandoning acclimation code
Raptor code, a near-optimal rateless abandoning acclimation code
Reed–Solomon absurdity correction
Reed–Muller code
Repeat-accumulate code
Repetition codes, such as Triple modular redundancy
Tornado code, a near-optimal abandoning acclimation code, and the forerunner to Fountain codes
Turbo code
Walsh–Hadamard code
BCH code
Constant-weight code
Convolutional code
Group codes
Golay codes, of which the Binary Golay cipher is of applied interest
Goppa code, acclimated in the McEliece cryptosystem
Hadamard code
Hagelbarger code
Hamming code
Latin aboveboard based cipher for non-white babble (prevalent for classic in broadband over powerlines)
Lexicographic code
Long code
Low-density parity-check code, aswell accepted as Gallager code, as the classic for dispersed blueprint codes
LT code, which is a near-optimal rateless abandoning acclimation cipher (Fountain code)
m of n codes
Online code, a near-optimal rateless abandoning acclimation code
Raptor code, a near-optimal rateless abandoning acclimation code
Reed–Solomon absurdity correction
Reed–Muller code
Repeat-accumulate code
Repetition codes, such as Triple modular redundancy
Tornado code, a near-optimal abandoning acclimation code, and the forerunner to Fountain codes
Turbo code
Walsh–Hadamard code
No comments:
Post a Comment