Question

Show that for any n ≥ 1, there is an error-detecting set of strings of length n, using the digits 0, 1, and 2, that has 3n−1 strings?

score 100 · Answer 1 · 2016-10-11 19:43:54

100

Views

Show that for any n ≥ 1, there is an error-detecting set of strings of length n, using the digits 0, 1, and 2, that has 3n−1 strings?

Published on 11 Oct 2016 - 19:43

score 55 · Answer 2 · 2016-10-23 15:22:38

55

Views

How many bit-strings can be formed with ones and zeros?*

Published on 23 Oct 2016 - 15:22

score 721 · Answer 3 · 2016-11-20 20:43:40

Given binary string of length n with k bit sets, how many permutations have x consecutive ones and no y consecutive ones where y > x

score 56 · Answer 4 · 2016-12-07 21:21:59

56

Views

The average length of strings in finite free set

Published on 07 Dec 2016 - 21:21

score 213 · Answer 5 · 2016-12-10 06:22:35

213

Views

What will be the value of least significant byte?

Published on 10 Dec 2016 - 6:22

score 125 · Answer 6 · 2017-02-27 16:25:29

125

Views

Prove that the number of bits in a positive $m$-bit integer $n$ is $n-\sum_{k=1}^{m-1} \lfloor n/2^k \rfloor$

Published on 27 Feb 2017 - 16:25

score 1.1k · Answer 7 · 2017-03-02 19:38:39

1.1k

Views

XOR Combinations

Published on 02 Mar 2017 - 19:38

score 288 · Answer 8 · 2017-03-03 20:12:33

288

Views

Notation for the set $\{0,1\}$

Published on 03 Mar 2017 - 20:12

score 643 · Answer 9 · 2017-03-08 17:37:24

643

Views

Bit string functions

Published on 08 Mar 2017 - 17:37

score 183 · Answer 10 · 2017-03-10 07:42:20

183

Views

Multiplying strings as polynomials

Published on 10 Mar 2017 - 7:42

score 467 · Answer 11 · 2017-03-12 10:37:45

467

Views

Count number of exact matching sequences

Published on 12 Mar 2017 - 10:37

score 51 · Answer 12 · 2017-03-24 21:12:38

51

Views

Deduce patterns of divisibility in bit strings

Published on 24 Mar 2017 - 21:12

score 724 · Answer 13 · 2017-03-31 12:10:58

724

Views

Number of q-ary strings of length m which do not contain k consecutive zeros

Published on 31 Mar 2017 - 12:10

score 163 · Answer 14 · 2017-04-03 16:27:42

163

Views

Propositional logic as sets of bit-vectors

Published on 03 Apr 2017 - 16:27

score 1.3k · Answer 15 · 2017-04-06 23:29:27

1.3k

Views

Counting Binary Strings (No block decompositions)

Published on 06 Apr 2017 - 23:29

List Question

Show that for any n ≥ 1, there is an error-detecting set of strings of length n, using the digits 0, 1, and 2, that has 3n−1 strings?

How many bit-strings can be formed with ones and zeros?*

Given binary string of length n with k bit sets, how many permutations have x consecutive ones and no y consecutive ones where y > x

The average length of strings in finite free set

What will be the value of least significant byte?

Prove that the number of bits in a positive $m$-bit integer $n$ is $n-\sum_{k=1}^{m-1} \lfloor n/2^k \rfloor$

XOR Combinations

Notation for the set $\{0,1\}$

Bit string functions

Multiplying strings as polynomials

Count number of exact matching sequences

Deduce patterns of divisibility in bit strings

Number of q-ary strings of length m which do not contain k consecutive zeros

Propositional logic as sets of bit-vectors

Counting Binary Strings (No block decompositions)

Trending Questions

Popular # Hahtags

Popular Questions