List questions from coding-theory

Published on 10 Jan 2024 - 14:49

24

Views

basic formula in Sum Product Algorithm(SPA) for decoding : $P(x_i=x | y_i)=[1+exp(-2yx/\sigma^2)]^{-1}$

Published on 22 Jan 2024 - 15:17

24

Views

Distance of 7-ary dual code

Published on 22 Jan 2024 - 19:00

100

Views

Random codes in coding theory

Published on 25 Jan 2024 - 15:28

48

Views

Huffman Code with Weight

Published on 28 Jan 2024 - 20:31

110

Views

"Manin's theorem" reference, coding theory

Published on 02 Feb 2024 - 17:12

19

Views

Weight of the error vector and syndrome vector

Published on 05 Feb 2024 - 3:29

62

Views

A good decoder must be non-linear?

Published on 05 Feb 2024 - 4:54

47

Views

Definition of smallest cyclic code in $\mathbb F_2$

Published on 06 Feb 2024 - 15:23

52

Views

Volume of Hamming ball w.r.t power-law distribution on hypercube

Published on 01 Mar 2024 - 13:10

47

Views

Inconsistency of capability of random coding in information theory and coding theory

Published on 08 Mar 2024 - 3:01

110

Views

"Encode" all $n$-permutations with the fewest number of swaps

Published on 13 Mar 2024 - 17:05

42

Views

Proof of identity on sum of powers of primitive root.

Published on 22 Feb 2026 - 23:10

33

Views

Why is the information rate of an error-correcting code defined by $\frac{\log_q\left(|\mathcal{C}|\right)}{n}$?

Published on 24 Mar 2024 - 18:20

55

Views

Bound problem of Coding Theory when distance is even

Published on 06 Jan 2015 - 12:25

List Question

Reed-Solomon Code RS16(17, 19) - Number of Correctable and Detectable Symbols

basic formula in Sum Product Algorithm(SPA) for decoding : $P(x_i=x | y_i)=[1+exp(-2yx/\sigma^2)]^{-1}$

Distance of 7-ary dual code

Random codes in coding theory

Huffman Code with Weight

"Manin's theorem" reference, coding theory

Weight of the error vector and syndrome vector

A good decoder must be non-linear?

Definition of smallest cyclic code in $\mathbb F_2$

Volume of Hamming ball w.r.t power-law distribution on hypercube

Inconsistency of capability of random coding in information theory and coding theory

"Encode" all $n$-permutations with the fewest number of swaps

Proof of identity on sum of powers of primitive root.

Why is the information rate of an error-correcting code defined by $\frac{\log_q\left(|\mathcal{C}|\right)}{n}$?

Bound problem of Coding Theory when distance is even

Trending Questions

Popular # Hahtags

Popular Questions