Question

Hadamard code, for fixed $x \in \{0,1\}^k$, how many $y \in \{0,1\}^k$ s.t $\langle x,y \rangle = 1$

score 97 · Answer 1 · 2017-12-01 16:02:49

97

Views

Hadamard code, for fixed $x \in \{0,1\}^k$, how many $y \in \{0,1\}^k$ s.t $\langle x,y \rangle = 1$

Published on 01 Dec 2017 - 16:02

score 1.2k · Answer 2 · 2026-04-02 01:24:33

1.2k

Views

Let $C$ be a $[n,k]_q$ code. Then: $d = n - k + 1$ iff the generator matrix $G$ contains respectively $k$ linear independent columns (MDS code)

Published on 02 Apr 2026 - 1:24

score 41 · Answer 3 · 2017-12-03 21:24:57

41

Views

How to bound a difference between two statistical terms

Published on 03 Dec 2017 - 21:24

score 7k · Answer 4 · 2026-03-31 01:02:48

7k

Views

Mutual Information Chain Rule

Published on 31 Mar 2026 - 1:02

score 1.3k · Answer 5 · 2026-03-31 05:16:16

1.3k

Views

Uniformly random number on $[0,1]$ has zero entropy?

Published on 31 Mar 2026 - 5:16

score 551 · Answer 6 · 2026-03-31 01:02:24

551

Views

minimizing mutual information vs. maximizing negentropy

Published on 31 Mar 2026 - 1:02

score 178 · Answer 7 · 2017-12-08 23:25:51

178

Views

Intuition about $P(\hat {x}|x)$ in rate distortion R(D)

Published on 08 Dec 2017 - 23:25

score 510 · Answer 8 · 2017-12-10 21:44:13

510

Views

What are the meaning and intuition behind I(X, Y) in information theory?

Published on 10 Dec 2017 - 21:44

score 100 · Answer 9 · 2026-04-02 01:29:53

100

Views

Make $3$ errors so CRC algorithm will result false positive

Published on 02 Apr 2026 - 1:29

score 42 · Answer 10 · 2017-12-16 19:43:30

42

Views

Strange syntax in information theory

Published on 16 Dec 2017 - 19:43

score 280 · Answer 11 · 2017-12-19 08:37:42

280

Views

How to make the encoding of symbols needs only $\sqrt{2}$ bits/symbol in theory?

Published on 19 Dec 2017 - 8:37

score 36 · Answer 12 · 2026-03-31 05:18:36

36

Views

How to prove the following relation for the conditional entropy

Published on 31 Mar 2026 - 5:18

score 151 · Answer 13 · 2026-03-31 05:23:57

151

Views

How to prove the following step in the proof of conditional entropy

Published on 31 Mar 2026 - 5:23

score 464 · Answer 14 · 2017-12-31 17:44:49

464

Views

Less unsymmetric difference measure for probabilities than KL divergence?

Published on 31 Dec 2017 - 17:44

score 58 · Answer 15 · 2018-01-05 21:38:38

58

Views

Relay channel: Multihop lower bound

Published on 05 Jan 2018 - 21:38

List Question

Hadamard code, for fixed $x \in \{0,1\}^k$, how many $y \in \{0,1\}^k$ s.t $\langle x,y \rangle = 1$

Let $C$ be a $[n,k]_q$ code. Then: $d = n - k + 1$ iff the generator matrix $G$ contains respectively $k$ linear independent columns (MDS code)

How to bound a difference between two statistical terms

Mutual Information Chain Rule

Uniformly random number on $[0,1]$ has zero entropy?

minimizing mutual information vs. maximizing negentropy

Intuition about $P(\hat {x}|x)$ in rate distortion R(D)

What are the meaning and intuition behind I(X, Y) in information theory?

Make $3$ errors so CRC algorithm will result false positive

Strange syntax in information theory

How to make the encoding of symbols needs only $\sqrt{2}$ bits/symbol in theory?

How to prove the following relation for the conditional entropy

How to prove the following step in the proof of conditional entropy

Less unsymmetric difference measure for probabilities than KL divergence?

Relay channel: Multihop lower bound

Trending Questions

Popular # Hahtags

Popular Questions