Question

How to show that the extended code of cyclic binary hamming code can fix single and two adjacent positions errors?

score 1.3k · Answer 1 · 2013-09-02 14:22:02

How to show that the extended code of cyclic binary hamming code can fix single and two adjacent positions errors?

score 242 · Answer 2 · 2013-09-02 19:44:39

242

Views

Constructing a Cyclic code of length p-1 with minimal distance d<=p-1 if p is prime

Published on 02 Sep 2013 - 19:44

score 136 · Answer 3 · 2013-09-04 21:49:35

136

Views

Constructing a cyclic code of a given minimum distance

Published on 04 Sep 2013 - 21:49

score 1.7k · Answer 4 · 2013-09-10 09:11:34

1.7k

Views

Structure of Parity Check Matrix of Non-Systematic Tensor Product Codes

Published on 10 Sep 2013 - 9:11

score 1.2k · Answer 5 · 2013-09-11 15:11:58

1.2k

Views

Number of pairs of Binary Strings of Length n with Hamming Distance b

Published on 11 Sep 2013 - 15:11

score 1k · Answer 6 · 2013-09-16 10:08:30

1k

Views

How should I understand the concept of Hamming Distance with $d(u,v)=|\{i;u_i\neq v_i,1\leq i \leq n\}|$?

Published on 16 Sep 2013 - 10:08

score 1.6k · Answer 7 · 2013-09-17 21:20:29

1.6k

Views

Prove that Hamming cube has a Hamiltonian cycle

Published on 17 Sep 2013 - 21:20

score 2k · Answer 8 · 2013-09-20 15:42:45

2k

Views

Checking if linear code exists

Published on 20 Sep 2013 - 15:42

score 531 · Answer 9 · 2013-09-22 01:01:50

531

Views

Proof of Kraft-McMillan

Published on 22 Sep 2013 - 1:01

score 2k · Answer 10 · 2013-09-22 17:45:51

2k

Views

Generator Matrix from a Parity check matrix

Published on 22 Sep 2013 - 17:45

score 296 · Answer 11 · 2013-09-24 17:25:55

296

Views

Trivial Perfect Code

Published on 24 Sep 2013 - 17:25

score 1.9k · Answer 12 · 2013-09-24 18:48:01

1.9k

Views

Hamming spheres

Published on 24 Sep 2013 - 18:48

score 743 · Answer 13 · 2013-09-25 12:28:22

743

Views

Checking if a linear code exists - singleton , hamming and gilbert-varshamov bounds do not help.

Published on 25 Sep 2013 - 12:28

score 170 · Answer 14 · 2013-09-25 12:54:56

170

Views

showing a code exists given the lower bound of its dimension (with respect to its length and distance)

Published on 25 Sep 2013 - 12:54

score 2.3k · Answer 15 · 2013-09-26 16:58:44

2.3k

Views

Prove there doesn't exist [10,5,4] linear binary and self-dual code.

Published on 26 Sep 2013 - 16:58

List Question

How to show that the extended code of cyclic binary hamming code can fix single and two adjacent positions errors?

Constructing a Cyclic code of length p-1 with minimal distance d<=p-1 if p is prime

Constructing a cyclic code of a given minimum distance

Structure of Parity Check Matrix of Non-Systematic Tensor Product Codes

Number of pairs of Binary Strings of Length n with Hamming Distance b

How should I understand the concept of Hamming Distance with $d(u,v)=|\{i;u_i\neq v_i,1\leq i \leq n\}|$?

Prove that Hamming cube has a Hamiltonian cycle

Checking if linear code exists

Proof of Kraft-McMillan

Generator Matrix from a Parity check matrix

Trivial Perfect Code

Hamming spheres

Checking if a linear code exists - singleton , hamming and gilbert-varshamov bounds do not help.

showing a code exists given the lower bound of its dimension (with respect to its length and distance)

Prove there doesn't exist [10,5,4] linear binary and self-dual code.

Trending Questions

Popular # Hahtags

Popular Questions