sharick

Displaying 1-33 of 33 results

  • White Papers // Nov 2013

    Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Quantum Attacks

    The authors construct statistical zero-knowledge authentication protocols for smart cards based on general assumptions. The main protocol is only secure against active attacks, but they present a modification based on trapdoor commitments that can resist concurrent attacks as well. Both protocols are instantiated using lattice-based primitives, which are secure against...

    Provided By sharick

  • White Papers // Oct 2013

    A Provable Secure Anonymous Proxy Signature Scheme without Random Oracles

    In order to protect the proxy signers' privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random oracle model has received a lot of criticism, there is no provable secure anonymous proxy signature scheme without random oracles....

    Provided By sharick

  • White Papers // Sep 2013

    Secure Channel Coding Schemes Based on Polar Codes

    In this paper, the authors propose two new frameworks for joint encryption encoding schemes based on polar codes, namely efficient and secure joint secret/public key encryption channel coding schemes. The issue of using new coding structure, i.e. polar codes in McEliece-like and RN-like schemes is addressed. Cryptanalysis methods show that...

    Provided By sharick

  • White Papers // Aug 2013

    Low Data Complexity Biclique Cryptanalysis of Block Ciphers with Application to Piccolo and HIGHT

    In this paper, the authors present a framework for biclique cryptanalysis of block ciphers with an extremely low data complexity. To that end, they enjoy a new representation of biclique attack. Then an algorithm for choosing two differential characteristics is also presented to simultaneously minimize the data complexity and control...

    Provided By sharick

  • White Papers // Jun 2013

    A Secure and Efficient Elliptic Curve Based Authentication and Key Agreement Protocol Suitable for WSN

    Wireless Sensor Network (WSN) is composed of many low-cost and small wireless sensor nodes distributed in a designated region. Their positions need not be engineered or pre-determined so that they can be randomly deployed in inaccessible terrains and adverse area. Authentication and key agreement protocols play an important role in...

    Provided By sharick

  • White Papers // Apr 2013

    Convolutional Network-Coded Cooperation Scheme

    One of the most important and intrinsic features of the wireless networks is fading. This phenomenon induces many adverse effects in the networks, and considerably reduces the performance. Diversity is a well-known technique to deal with fading. The authors propose a novel cooperative transmission scheme called Convolutional Network-Coded Cooperation (CNCC)...

    Provided By sharick

  • White Papers // Feb 2013

    Capacity Bounds for Wireless Ergodic Fading Broadcast Channels with Partial CSIT

    The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic yields a full control over how much state information is available, from perfect to no information....

    Provided By sharick

  • White Papers // Feb 2013

    The Capacity Region of the Wireless Ergodic Fading Interference Channel with Partial CSIT to Within One Bit

    Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel state (this model yields a full control over how much state information is available). One of...

    Provided By sharick

  • White Papers // Feb 2013

    Analysis and Improvement of the Securing RFID Systems Conforming to EPC Class 1 Generation 2 Standard

    Radio Frequency IDentification (RFID) technology is a wireless identification method in which security and privacy are important parameters for public acceptance and widespread use. In order to thwart such security and privacy problems, a wide variety of authentication protocols have been proposed in the literature. In 2010, researcher proposed a...

    Provided By sharick

  • White Papers // Jan 2013

    Incorporating Betweenness Centrality in Compressive Sensing for Congestion Detection

    This paper presents a new Compressive Sensing (CS) scheme for detecting network congested links. The authors focus on decreasing the required number of measurements to detect all congested links in the context of network tomography. They have expanded the LASSO objective function by adding a new term corresponding to the...

    Provided By sharick

  • White Papers // Sep 2012

    Desynchronization Attack on RAPP Ultralightweight Authentication Protocol

    RAPP (RFID Authentication Protocol with Permutation) is a recently proposed efficient ultra-lightweight authentication protocol. The operation used in this protocol is totally different from the other existing ultra-lightweight protocols due to the use of new introduced data dependent permutations and avoidances of modular arithmetic operations and biased logical operations such...

    Provided By sharick

  • White Papers // Sep 2012

    A Survey on Web Spam Detection Methods: Taxonomy

    Web spam refers to some techniques, which try to manipulate search engine ranking algorithms in order to raise web page position in search engine results. In the best case, spammers encourage viewers to visit their sites, and provide undeserved advertisement gains to the page owner. In the worst case, they...

    Provided By sharick

  • White Papers // Aug 2012

    Recursive Linear and Differential Cryptanalysis of Ultralightweight Authentication Protocols

    Privacy is faced to serious challenges in the ubiquitous computing world. In order to handle this problem, some researches in recent years have focused on design and analysis of privacy friendly ultra-lightweight authentication protocols. In less than a decade, many ultra-lightweight authentication protocols are proposed. Though, successful cryptanalysis are proposed...

    Provided By sharick

  • White Papers // Jun 2012

    A Non-Delegatable Identity-Based Designated Verifier Signature Scheme without Bilinear Pairings

    Up to now, several non-delegatable identity-based (strong) designated verifier signature schemes using bilinear pairings are proposed. In these identity-based (strong) designated verifier signature schemes, bilinear pairings are employed either in signing and verifying steps or only in the verifying step. However, the computation cost of pairings at a security level...

    Provided By sharick

  • White Papers // Jun 2012

    An Anonymous Proxy Signature Scheme without Random Oracles

    The concept of proxy signature was introduced in 1996, up to now many proxy signature schemes have been proposed. In order to protect the proxy signer's privacy, the concept of anonymous proxy signature, which is also called proxy ring signature, was introduced in 2003. Some anonymous proxy signature schemes, which...

    Provided By sharick

  • White Papers // May 2012

    Rate Adaptation and Power Allocation for Time-Correlated MISO Rayleigh Fading Channel With Delay-Limited HARQ

    In this paper, the authors consider the problem of optimum rate adaptation and power allocation to maximize the Delay-Limited Throughput (DLT) in a time-correlated 2x1 MISO Rayleigh fading channel with Hybrid ARQ in Chase-Combining mode (HARQ-CC). To this aim, they have first formulated the DLT equation based on the outage...

    Provided By sharick

  • White Papers // May 2012

    A Novel Strong Designated Verifier Signature Scheme without Random Oracles

    In this paper, a novel pairing based strong designated verifier signature scheme based on non-interactive zero knowledge proofs is proposed. The security of the proposal is presented by sequences of games without random oracles; furthermore, this scheme has a security proof for the property of privacy of the signer's identity...

    Provided By sharick

  • White Papers // May 2012

    Temporal Scalable Live Video Streaming Over Hybrid CDN-P2P Architecture

    Most of currently deployed live video streaming systems don't consider heterogeneous bandwidth of peers. To address this issue, many researches combine P2P solution with scalable video streaming, however none of the existing hybrid CDN-P2P consider it. This paper presents the combination of Hybrid CDN-P2P and temporal scalable streaming. The main...

    Provided By sharick

  • White Papers // Mar 2012

    Secure Tracking in Sensor Networks Using Adaptive Extended Kalman Filter

    Location information of sensor nodes has become an essential part of many applications in Wireless Sensor Networks (WSN). The importance of location estimation and object tracking has made them the target of many security attacks. Various methods have tried to provide location information with high accuracy, while lots of them...

    Provided By sharick

  • White Papers // Mar 2012

    Distributed Subband, Rate and Power Allocation in OFDMA Based Two-Tier Femtocell Networks Using Fractional Frequency Reuse

    Femtocell has appeared as a solution to increase both coverage and capacity of cellular networks. However, interference problem between the macrocell and the femtocell must be solved before any deployment. In this paper, the authors deal with the problem of joint sub-band, rate, and power allocation in OFDMA based two-tier...

    Provided By sharick

  • White Papers // Feb 2012

    On Marton's Inner Bound for Broadcast Channels

    Marton's inner bound is the best known achievable region for a general discrete memory less broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and auxiliary random variables. The optimizers turn out to be structured in...

    Provided By sharick

  • White Papers // Dec 2011

    Multispectral Palmprint Recognition Using a Hybrid Feature

    Personal identification problem has been a major field of research in recent years. Biometrics-based technologies that exploit fingerprints, iris, face, voice and Palmprints, have been in the center of attention to solve this problem. Palmprints can be used instead of fingerprints that have been of the earliest of these biometrics...

    Provided By sharick

  • White Papers // Aug 2011

    Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices

    In this paper, the authors prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover,...

    Provided By sharick

  • White Papers // Aug 2011

    Designated Verifier Threshold Proxy Signature Scheme without Random Oracles

    In a (t; n) designated verifier threshold proxy signature scheme, an original signer can delegate his/her signing power to n proxy signers such that any t or more out of n proxy signers can sign messages on behalf of the original signer but t-1 or less of the proxy signers...

    Provided By sharick

  • White Papers // Jun 2011

    On Marton's Inner Bound for the General Broadcast Channel

    The authors establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. They show that unlike the Gaussian case, Marton's coding scheme without superposition coding is not optimal in general even for a degraded broadcast channel with no...

    Provided By sharick

  • White Papers // May 2011

    Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources

    Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper, the authors introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. They also...

    Provided By sharick

  • White Papers // Apr 2011

    Using RLS Adaptive Algorithm for Packet Loss Replacement in VOIP

    In this paper, a low order recursive Linear Prediction method and Recursive Least Square as an adaptive filter (LP-RLS) are introduced to predict the speech and the excitation signals. In real-time packet-based communication systems, one major problem is misrouted or delayed packets which results in degraded perceived voice quality. If...

    Provided By sharick

  • White Papers // Mar 2010

    A Logical Approach for Implementing Dynamic Business Rules

    Business Rules are operational rules based on data that business organizations follow to perform various activities. Regarding problem domains in the organization, Business Rules (BR) are classified into two groups: Static and Dynamic. A static business rule is a constraint (integrity) or derivation rule that applies to each individual state...

    Provided By sharick

  • White Papers // Sep 2009

    Generalized Secure Distributed Source Coding with Side Information

    In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie intend to transmit information to Bob via channels with limited capacity so...

    Provided By sharick

  • White Papers // May 2009

    Joint Distributed Source and Network Coding for Multiple Wireless Unicast Sessions

    Few works has been focused on the problem of joint distributed data compression and network coding. In this paper, the authors give some examples showing the advantage of broadcast nature of wireless environment as a basis for joint codes design. Also they show that joint coding is possible in the...

    Provided By sharick

  • White Papers // Mar 2009

    A Related Key Attack on the Feistel Type Block Ciphers

    In this paper, the authors show that Biham's chosen key attack can be generalized to include any block cipher and they give a low complexity chosen key attack on any Feistel type cipher. Then they show that the irregularities in the shift pattern of DES key schedule algorithm is not...

    Provided By sharick

  • White Papers // Feb 2009

    A New Achievable Rate for a Stochastic Two Relay Network With No Interference

    Recently there has been much interest in studying relay networks and wireless relay communication scenarios. Wireless networks with base stations (cell networks) are relatively well understood by considering the multiple access and the broadcast channels. However, the networks without base stations (adhoc networks) in which any node can act both...

    Provided By sharick

  • White Papers // Dec 2008

    Capacity of a More General Class of Relay Channels

    Capacity has been found for degraded, reversely degraded, full feedback, semi-deterministic, orthogonal relay channels, also for a class of deterministic relay channels and a class of modulo sum relay channels. The authors indicate what the relay decodes and forwards with one auxiliary random variable having bounded cardinality and attempt to...

    Provided By sharick

  • White Papers // May 2012

    Rate Adaptation and Power Allocation for Time-Correlated MISO Rayleigh Fading Channel With Delay-Limited HARQ

    In this paper, the authors consider the problem of optimum rate adaptation and power allocation to maximize the Delay-Limited Throughput (DLT) in a time-correlated 2x1 MISO Rayleigh fading channel with Hybrid ARQ in Chase-Combining mode (HARQ-CC). To this aim, they have first formulated the DLT equation based on the outage...

    Provided By sharick

  • White Papers // Mar 2012

    Distributed Subband, Rate and Power Allocation in OFDMA Based Two-Tier Femtocell Networks Using Fractional Frequency Reuse

    Femtocell has appeared as a solution to increase both coverage and capacity of cellular networks. However, interference problem between the macrocell and the femtocell must be solved before any deployment. In this paper, the authors deal with the problem of joint sub-band, rate, and power allocation in OFDMA based two-tier...

    Provided By sharick

  • White Papers // Sep 2009

    Generalized Secure Distributed Source Coding with Side Information

    In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie intend to transmit information to Bob via channels with limited capacity so...

    Provided By sharick

  • White Papers // Sep 2013

    Secure Channel Coding Schemes Based on Polar Codes

    In this paper, the authors propose two new frameworks for joint encryption encoding schemes based on polar codes, namely efficient and secure joint secret/public key encryption channel coding schemes. The issue of using new coding structure, i.e. polar codes in McEliece-like and RN-like schemes is addressed. Cryptanalysis methods show that...

    Provided By sharick

  • White Papers // Nov 2013

    Efficient Statistical Zero-Knowledge Authentication Protocols for Smart Cards Secure Against Active & Concurrent Quantum Attacks

    The authors construct statistical zero-knowledge authentication protocols for smart cards based on general assumptions. The main protocol is only secure against active attacks, but they present a modification based on trapdoor commitments that can resist concurrent attacks as well. Both protocols are instantiated using lattice-based primitives, which are secure against...

    Provided By sharick

  • White Papers // Oct 2013

    A Provable Secure Anonymous Proxy Signature Scheme without Random Oracles

    In order to protect the proxy signers' privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random oracle model has received a lot of criticism, there is no provable secure anonymous proxy signature scheme without random oracles....

    Provided By sharick

  • White Papers // Feb 2013

    Analysis and Improvement of the Securing RFID Systems Conforming to EPC Class 1 Generation 2 Standard

    Radio Frequency IDentification (RFID) technology is a wireless identification method in which security and privacy are important parameters for public acceptance and widespread use. In order to thwart such security and privacy problems, a wide variety of authentication protocols have been proposed in the literature. In 2010, researcher proposed a...

    Provided By sharick

  • White Papers // Mar 2009

    A Related Key Attack on the Feistel Type Block Ciphers

    In this paper, the authors show that Biham's chosen key attack can be generalized to include any block cipher and they give a low complexity chosen key attack on any Feistel type cipher. Then they show that the irregularities in the shift pattern of DES key schedule algorithm is not...

    Provided By sharick

  • White Papers // Dec 2008

    Capacity of a More General Class of Relay Channels

    Capacity has been found for degraded, reversely degraded, full feedback, semi-deterministic, orthogonal relay channels, also for a class of deterministic relay channels and a class of modulo sum relay channels. The authors indicate what the relay decodes and forwards with one auxiliary random variable having bounded cardinality and attempt to...

    Provided By sharick

  • White Papers // Feb 2009

    A New Achievable Rate for a Stochastic Two Relay Network With No Interference

    Recently there has been much interest in studying relay networks and wireless relay communication scenarios. Wireless networks with base stations (cell networks) are relatively well understood by considering the multiple access and the broadcast channels. However, the networks without base stations (adhoc networks) in which any node can act both...

    Provided By sharick

  • White Papers // Sep 2012

    A Survey on Web Spam Detection Methods: Taxonomy

    Web spam refers to some techniques, which try to manipulate search engine ranking algorithms in order to raise web page position in search engine results. In the best case, spammers encourage viewers to visit their sites, and provide undeserved advertisement gains to the page owner. In the worst case, they...

    Provided By sharick

  • White Papers // May 2011

    Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding With Correlated Sources

    Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper, the authors introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. They also...

    Provided By sharick

  • White Papers // Mar 2012

    Secure Tracking in Sensor Networks Using Adaptive Extended Kalman Filter

    Location information of sensor nodes has become an essential part of many applications in Wireless Sensor Networks (WSN). The importance of location estimation and object tracking has made them the target of many security attacks. Various methods have tried to provide location information with high accuracy, while lots of them...

    Provided By sharick

  • White Papers // Apr 2011

    Using RLS Adaptive Algorithm for Packet Loss Replacement in VOIP

    In this paper, a low order recursive Linear Prediction method and Recursive Least Square as an adaptive filter (LP-RLS) are introduced to predict the speech and the excitation signals. In real-time packet-based communication systems, one major problem is misrouted or delayed packets which results in degraded perceived voice quality. If...

    Provided By sharick

  • White Papers // May 2009

    Joint Distributed Source and Network Coding for Multiple Wireless Unicast Sessions

    Few works has been focused on the problem of joint distributed data compression and network coding. In this paper, the authors give some examples showing the advantage of broadcast nature of wireless environment as a basis for joint codes design. Also they show that joint coding is possible in the...

    Provided By sharick

  • White Papers // Jun 2011

    On Marton's Inner Bound for the General Broadcast Channel

    The authors establish several new results on Marton's coding scheme and its corresponding inner bound on the capacity region of the general broadcast channel. They show that unlike the Gaussian case, Marton's coding scheme without superposition coding is not optimal in general even for a degraded broadcast channel with no...

    Provided By sharick

  • White Papers // Feb 2012

    On Marton's Inner Bound for Broadcast Channels

    Marton's inner bound is the best known achievable region for a general discrete memory less broadcast channel. To compute Marton's inner bound one has to solve an optimization problem over a set of joint distributions on the input and auxiliary random variables. The optimizers turn out to be structured in...

    Provided By sharick

  • White Papers // Aug 2011

    Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices

    In this paper, the authors prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check matrices. Moreover,...

    Provided By sharick

  • White Papers // Apr 2013

    Convolutional Network-Coded Cooperation Scheme

    One of the most important and intrinsic features of the wireless networks is fading. This phenomenon induces many adverse effects in the networks, and considerably reduces the performance. Diversity is a well-known technique to deal with fading. The authors propose a novel cooperative transmission scheme called Convolutional Network-Coded Cooperation (CNCC)...

    Provided By sharick

  • White Papers // Mar 2010

    A Logical Approach for Implementing Dynamic Business Rules

    Business Rules are operational rules based on data that business organizations follow to perform various activities. Regarding problem domains in the organization, Business Rules (BR) are classified into two groups: Static and Dynamic. A static business rule is a constraint (integrity) or derivation rule that applies to each individual state...

    Provided By sharick

  • White Papers // Jun 2013

    A Secure and Efficient Elliptic Curve Based Authentication and Key Agreement Protocol Suitable for WSN

    Wireless Sensor Network (WSN) is composed of many low-cost and small wireless sensor nodes distributed in a designated region. Their positions need not be engineered or pre-determined so that they can be randomly deployed in inaccessible terrains and adverse area. Authentication and key agreement protocols play an important role in...

    Provided By sharick

  • White Papers // Dec 2011

    Multispectral Palmprint Recognition Using a Hybrid Feature

    Personal identification problem has been a major field of research in recent years. Biometrics-based technologies that exploit fingerprints, iris, face, voice and Palmprints, have been in the center of attention to solve this problem. Palmprints can be used instead of fingerprints that have been of the earliest of these biometrics...

    Provided By sharick

  • White Papers // Aug 2013

    Low Data Complexity Biclique Cryptanalysis of Block Ciphers with Application to Piccolo and HIGHT

    In this paper, the authors present a framework for biclique cryptanalysis of block ciphers with an extremely low data complexity. To that end, they enjoy a new representation of biclique attack. Then an algorithm for choosing two differential characteristics is also presented to simultaneously minimize the data complexity and control...

    Provided By sharick

  • White Papers // Sep 2012

    Desynchronization Attack on RAPP Ultralightweight Authentication Protocol

    RAPP (RFID Authentication Protocol with Permutation) is a recently proposed efficient ultra-lightweight authentication protocol. The operation used in this protocol is totally different from the other existing ultra-lightweight protocols due to the use of new introduced data dependent permutations and avoidances of modular arithmetic operations and biased logical operations such...

    Provided By sharick

  • White Papers // Aug 2012

    Recursive Linear and Differential Cryptanalysis of Ultralightweight Authentication Protocols

    Privacy is faced to serious challenges in the ubiquitous computing world. In order to handle this problem, some researches in recent years have focused on design and analysis of privacy friendly ultra-lightweight authentication protocols. In less than a decade, many ultra-lightweight authentication protocols are proposed. Though, successful cryptanalysis are proposed...

    Provided By sharick

  • White Papers // Aug 2011

    Designated Verifier Threshold Proxy Signature Scheme without Random Oracles

    In a (t; n) designated verifier threshold proxy signature scheme, an original signer can delegate his/her signing power to n proxy signers such that any t or more out of n proxy signers can sign messages on behalf of the original signer but t-1 or less of the proxy signers...

    Provided By sharick

  • White Papers // Jun 2012

    A Non-Delegatable Identity-Based Designated Verifier Signature Scheme without Bilinear Pairings

    Up to now, several non-delegatable identity-based (strong) designated verifier signature schemes using bilinear pairings are proposed. In these identity-based (strong) designated verifier signature schemes, bilinear pairings are employed either in signing and verifying steps or only in the verifying step. However, the computation cost of pairings at a security level...

    Provided By sharick

  • White Papers // Jun 2012

    An Anonymous Proxy Signature Scheme without Random Oracles

    The concept of proxy signature was introduced in 1996, up to now many proxy signature schemes have been proposed. In order to protect the proxy signer's privacy, the concept of anonymous proxy signature, which is also called proxy ring signature, was introduced in 2003. Some anonymous proxy signature schemes, which...

    Provided By sharick

  • White Papers // May 2012

    A Novel Strong Designated Verifier Signature Scheme without Random Oracles

    In this paper, a novel pairing based strong designated verifier signature scheme based on non-interactive zero knowledge proofs is proposed. The security of the proposal is presented by sequences of games without random oracles; furthermore, this scheme has a security proof for the property of privacy of the signer's identity...

    Provided By sharick

  • White Papers // Jan 2013

    Incorporating Betweenness Centrality in Compressive Sensing for Congestion Detection

    This paper presents a new Compressive Sensing (CS) scheme for detecting network congested links. The authors focus on decreasing the required number of measurements to detect all congested links in the context of network tomography. They have expanded the LASSO objective function by adding a new term corresponding to the...

    Provided By sharick

  • White Papers // May 2012

    Temporal Scalable Live Video Streaming Over Hybrid CDN-P2P Architecture

    Most of currently deployed live video streaming systems don't consider heterogeneous bandwidth of peers. To address this issue, many researches combine P2P solution with scalable video streaming, however none of the existing hybrid CDN-P2P consider it. This paper presents the combination of Hybrid CDN-P2P and temporal scalable streaming. The main...

    Provided By sharick

  • White Papers // Feb 2013

    Capacity Bounds for Wireless Ergodic Fading Broadcast Channels with Partial CSIT

    The two-user wireless ergodic fading Broadcast Channel (BC) with partial Channel State Information at the Transmitter (CSIT) is considered. The CSIT is given by an arbitrary deterministic function of the channel state. This characteristic yields a full control over how much state information is available, from perfect to no information....

    Provided By sharick

  • White Papers // Feb 2013

    The Capacity Region of the Wireless Ergodic Fading Interference Channel with Partial CSIT to Within One Bit

    Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel state (this model yields a full control over how much state information is available). One of...

    Provided By sharick