User user1936752

4 votes

3 answers

803 views

If a problem is not in NP, prove that every NP problem can be efficiently reduced to it

asked Oct 23, 2019 at 20:41

3 votes

0 answers

244 views

Capacity of channels: Why do we need Blahut-Arimoto algorithms?

asked Apr 22, 2020 at 12:55

2 votes

1 answer

112 views

Shared randomness does not increase capacity of a noisy channel - Why?

asked Jan 26, 2021 at 5:11

2 votes

0 answers

30 views

Information theory - Expurgation step to go from average error to worst case error in the large error regime

asked Sep 22, 2021 at 12:16

2 votes

1 answer

125 views

Are hash functions really quantum resistant for commitment schemes?

asked Oct 10, 2018 at 12:59

2 votes

1 answer

271 views

Is the capacity achieving input of a discrete memoryless channel unique?

asked Jul 3, 2019 at 14:58

2 votes

1 answer

1k views

Collision entropy definition

asked Feb 12, 2020 at 11:44

1 vote

0 answers

29 views

Auxiliary random variables in the analysis of the private information of wiretap channels

asked Feb 27, 2020 at 19:24

1 vote

0 answers

80 views

Example of channel where capacity is achieved without a uniform distribution on the output alphabet

asked Jul 30, 2019 at 15:00

1 vote

1 answer

56 views

Reaching Shannon capacity of a channel

asked May 15, 2019 at 11:12

1 vote

1 answer

33 views

Why, for Reed-Solomon codes, does the alphabet size depend on block length?

asked Dec 11, 2023 at 23:18

0 votes

0 answers

26 views

Grover's search on cryptographic hash functions - how can we build the oracle? [duplicate]

asked Feb 21, 2018 at 15:44

Stack Exchange Network

12 Questions

If a problem is not in NP, prove that every NP problem can be efficiently reduced to it

Capacity of channels: Why do we need Blahut-Arimoto algorithms?

Shared randomness does not increase capacity of a noisy channel - Why?

Information theory - Expurgation step to go from average error to worst case error in the large error regime

Are hash functions really quantum resistant for commitment schemes?

Is the capacity achieving input of a discrete memoryless channel unique?

Collision entropy definition

Auxiliary random variables in the analysis of the private information of wiretap channels

Example of channel where capacity is achieved without a uniform distribution on the output alphabet

Reaching Shannon capacity of a channel

Why, for Reed-Solomon codes, does the alphabet size depend on block length?

Grover's search on cryptographic hash functions - how can we build the oracle? [duplicate]