Introduction of info theory basis for image/video coding, especially, entropy, rate-distortion theory,
entropy coding, huffman coding, arithmetic coding
Bounds on the Achievable Rates of Faded Dirty Paper Channel IJCNCJournal
Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the
interference signal but not its fading coefficients are given. We generalize the analysis which were studied
in [1] and [4] so that their results are special cases of our analysis. We enforce our bounds by simulations
in which many numerical examples are drawn and investigated under different cases.
Detailed cryptographic analysis of contact tracing protocolsChristian Spolaore
A detailed description of DP3T, Google/Apple and PEP-PT
contact tracing protocols. After a brief mathematical introduction on modern cryptography, the primitives used in the protocols are specifically taken into consideration. Then, they are described in details and linked to the standard goals of information security, analyzing if the proposed designs reach them or not. Finally, there can be found a quick but interesting description of the main issues regarding BLE Technology and an example of a secret sharing scheme which could be used to prevent local attacks to the system (refer also to: https://www.slideshare.net/ChristianSpolaore1/introduction-to-contact-tracing-apps-and-privacy-issues).
A New Key Agreement Protocol Using BDP and CSP in Non Commutative GroupsEswar Publications
The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.
Introduction of info theory basis for image/video coding, especially, entropy, rate-distortion theory,
entropy coding, huffman coding, arithmetic coding
Bounds on the Achievable Rates of Faded Dirty Paper Channel IJCNCJournal
Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the
interference signal but not its fading coefficients are given. We generalize the analysis which were studied
in [1] and [4] so that their results are special cases of our analysis. We enforce our bounds by simulations
in which many numerical examples are drawn and investigated under different cases.
Detailed cryptographic analysis of contact tracing protocolsChristian Spolaore
A detailed description of DP3T, Google/Apple and PEP-PT
contact tracing protocols. After a brief mathematical introduction on modern cryptography, the primitives used in the protocols are specifically taken into consideration. Then, they are described in details and linked to the standard goals of information security, analyzing if the proposed designs reach them or not. Finally, there can be found a quick but interesting description of the main issues regarding BLE Technology and an example of a secret sharing scheme which could be used to prevent local attacks to the system (refer also to: https://www.slideshare.net/ChristianSpolaore1/introduction-to-contact-tracing-apps-and-privacy-issues).
A New Key Agreement Protocol Using BDP and CSP in Non Commutative GroupsEswar Publications
The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Introduction to Channel Capacity | DCNIT-LDTalks-1Arunabha Saha
DCNIT-LDTalks-1
Here I have discussed the channel capacity for noiseless and noisy channels. How Nyquist capacity and Shannon capacity play a key role in the noiseless and noisy channels are discussed in detail. We will see the several expressions of SNR_dB in terms of power and amplitude and try to understand how both the capacity are different from each other. For extreme values of SNR, we will deduce the Shannon capacity formula to understand the bandwidth-limited region and power-limited region. Here I have used a few numerical examples to understand the concept clearly. In the last section of the talk, I have deduced the Shannon capacity formula from scratch to get better exposure and will understand how these ideas contribute to its mathematical framework.
Course: CMS-A-CC-4-8
youtube: https://www.youtube.com/watch?v=1OjlMqHWq6o
This chapter provides an introductory lecture note on the Error Control Coding techniques. Before one goes into the details of different types of Coding schemes, this note will acquaint the readers with all the terms related and associated to Error Control Coding. It is highly recommended that one goes through this article before delving deep into the coding schemes.
![INFORMATION THEORY ,[object Object],[object Object]](https://image.slidesharecdn.com/lecture1-100904011125-phpapp01/85/Lecture1-1-320.jpg)
![[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)