Loading...
Search for:
network-information-theory
0.015 seconds
New Approaches for Achievability Proof in Network Information Theory: Asymptotic Regime and Beyond
, Ph.D. Dissertation Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
Two new frameworks for achievability proof in network information theory (NIT) are introduced . The first framework which we call it OSRB (Output Statistics of Random Binning) framework, uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the OSRB framework uses pmf approximation arguments instead of counting and typicality which are used widely in conventional achievability proofs in NIT. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the
distribution of random variables need to be satisfied. These statistical conditions include independence between messages and...
distribution of random variables need to be satisfied. These statistical conditions include independence between messages and...
Achievability proof via output statistics of random binning
, Article IEEE Transactions on Information Theory ; Vol. 60, issue. 11 , July , 2014 , pages 6760-6786 ; 21578095 ; 978-1-4673-2580-6 ; Aref, M. R ; Gohari, A ; Sharif University of Technology
Abstract
This paper introduces a new and ubiquitous framework for establishing achievability results in network information theory problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in...
Coordination Among Nodes of a Network: an Information Theoretic
Perspective
,
M.Sc. Thesis
Sharif University of Technology
;
Aminzadeh Gohari, Amin
(Supervisor)
Abstract
In this work, we consider a zero error coordination problem wherein the nodes of a network exchange messages to be able to perfectly coordinate their actions with the individual observations of each other. While previous works on coordination commonly assume an asymptotically vanishing error, we assume exact, zero error coordination. Furthermore, unlike previous works that employ the empirical or strong notions of coordination, we define and use a notion of set coordination. This notion of coordination bears similarities with the empirical notion of coordination. We observe that set coordination, in its special case of two nodes with a one-way communication link is equivalent with the “Hide...
An Application of Repeated Games in Network Information Theory
, M.Sc. Thesis Sharif University of Technology ; Aminzadeh Gohari, Amin (Supervisor)
Abstract
Information Theory, as an important part of communication theory, tries to find inner and outer bounds for reliable rate of information transmission in communication networks. In Network Information Theory, It is usually assumed that the channel statistics is known to everyone. However, in some practical situations, we might not know the statistics. The compound channel and the arbitrarily varying channel (AVC) are two categories of models which have considered this problem. In this thesis, in order to have a more general model regarding information transfer in the presence of channel uncertainty, we propose a model which is essentially a combination of compound channel and AVC. In our...
Delay-optimal static relaying policy in a slotted aloha wireless network
, Article 2018 Iran Workshop on Communication and Information Theory, IWCIT 2018, 25 April 2018 through 26 April 2018 ; 2018 , Pages 1-6 ; 9781538641491 (ISBN) ; Ashtiani, F ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2018
Abstract
We consider a slotted Aloha-based wireless communication network comprising a source and an active relay, both transmitting to a common destination. The relay node is able to relay the unsuccessfully transmitted packets of the source node, if it can detect them. We find the analytical closed form optimal static relaying policy in order to minimize the average transmission delay (ATD) of source packets, while ATD of its own packets is constrained. A static relaying policy is determined by acceptance and relaying probabilities of the relay node. According to acceptance probability, the relay node decides whether to accept an unsuccessfully transmitted packet from source or not, while the...
Analysis of Side Information in Series Relay Network
, M.Sc. Thesis Sharif University of Technology ; Aref, Mohammad Reza (Supervisor) ; Ashtiani, Farid (Supervisor)
Abstract
In this dissertation we discuss various results presented in the literature on single user channels with causal or noncausal side information and multiuser channels with side information such as multiple access channel and broadcast channel. The Series Relay Networks (SRN) with delays, with and without channel state information (CSI) are investigated from an information theoretic point of view. For SRN with unlimited look ahead where the relays can use the whole received block to encode, upper and lower bounds on the capacity are derived which are tight for the degraded case. For SRN without-delay where the relays have access to the present received symbols in addition to the past symbols,...
New Approaches for Achievability Proof in Network Information Theory: Asymptotic Regime and Beyond
, Ph.D. Dissertation Sharif University of Technology ; Aref, Mohammad Reza (Supervisor)
Abstract
Two new frameworks for achievability proof in network information theory (NIT) are introduced . The first framework which we call it OSRB (Output Statistics of Random Binning) framework, uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the OSRB framework uses pmf approximation arguments instead of counting and typicality which are used widely in conventional achievability proofs in NIT. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and...
Achievability proof via output statistics of random binning
, Article IEEE International Symposium on Information Theory - Proceedings ; 2012 , Pages 1044-1048 ; 9781467325790 (ISBN) ; Aref, M. R ; Gohari, A ; Sharif University of Technology
Abstract
This paper presents a new and ubiquitous framework for establishing achievability results in network information theory (NIT) problems. The framework is used to prove various new results. To express the main tool, consider a set of discrete memoryless correlated sources (DMCS). Assume that each source (except one, Z n) is randomly binned at a finite rate. We find sufficient conditions on these rates such that the bin indices are nearly mutually independent of each other and of Z n. This is used in conjunction with the Slepian-Wolf (S-W) result to set up the framework. We begin by illustrating this method via examples from channel coding and rate-distortion (or covering problems). Next, we...
Utilizing network coding for file dessimination in peer-to-peer systems
, Article 3rd International Conference on New Technologies, Mobility and Security, NTMS 2009, 20 December 2009 through 23 December 2009, Cairo ; 2009 ; 9781424462735 (ISBN) ; Movaghar, A ; Sadat Bathaee, N ; Sharif University of Technology
Abstract
Network coding was first introduced in information theory for increasing the multicast rate in the networks with directed links. We can model many of the content distribution networks and overlay networks with such a network. Therefore, the solutions introduced in information theory can be used in these networks. In this paper, we analyze using of network coding in uncoordinated cooperative content distribution systems. Reaching the optimum performance in an uncoordinated system needs blocks of the system to be "equally important". In that case, we can retrieve the whole data without need of central controller or complex algorithms. In part of this paper, we exactly define the concept of...
Sample complexity of classification with compressed input
, Article Neurocomputing ; Volume 415 , 2020 , Pages 286-294 ; Kasaei, S ; Soleymani Baghshah, M ; Sharif University of Technology
Elsevier B.V
2020
Abstract
One of the most studied problems in machine learning is finding reasonable constraints that guarantee the generalization of a learning algorithm. These constraints are usually expressed as some simplicity assumptions on the target. For instance, in the Vapnik–Chervonenkis (VC) theory the space of possible hypotheses is considered to have a limited VC dimension One way to formulate the simplicity assumption is via information theoretic concepts. In this paper, the constraint on the entropy H(X) of the input variable X is studied as a simplicity assumption. It is proven that the sample complexity to achieve an ∊-δ Probably Approximately Correct (PAC) hypothesis is bounded by [Formula...