نتایج جستجو برای: achievable secrecy rate region

تعداد نتایج: 1470136  

2013
Arun Padakandla S. Sandeep Pradhan

We derive a new achievable rate region for the problem of communicating over a multiple access channel with states. Our coding technique is based on the ensemble of nested coset codes and the technique of typicality decoding. Exploiting structure in this ensemble, we analyze a more efficient decoding strategy to improve upon the rate region achievable using unstructured codes. We identify examp...

2011
Raef Bassily

Title of dissertation: ALIGNMENT AND COOPERATION FOR SECRECY IN MULTI-USER CHANNELS Raef Bassily Doctor of Philosophy, 2011 Dissertation directed by: Professor Şennur Ulukuş Department of Electrical and Computer Engineering The study of the physical layer has offered a new perspective to the problem of communication security. This led to the development of a vast set of ideas and techniques roo...

Journal: :CoRR 2012
Arun Padakandla Sandeep S. Pradhan

We propose a new coding technique based on nested coset codes and derive a new achievable rate region for a general three user discrete memoryless broadcast channel (DMBC). We identify an example of a three user binary broadcast channel for which the proposed achievable rate region strictly outperforms that obtained by a natural extension of Marton’s [1] rate region. As a step towards deriving ...

Journal: :IEEE Trans. Information Theory 2003
Sriram Vishwanath Nihar Jindal Andrea J. Goldsmith

Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...

Journal: :CoRR 2009
Arunkumar Subramanian Steven W. McLaughlin

This paper considers the problem of perfectly secure communication on a modified version of Wyner’s wiretap channel II where both the main and wiretapper’s channels have some erasures. A secret message is to be encoded into n channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly n− ν erasures, where the positions of...

Journal: :IEEE Transactions on Information Forensics and Security 2021

This paper considered an energy-harvesting based secure two-way relay (EH-STWR) network, where two users exchanged information with the assistance of one buffer-aided that harvested energy from users. To realize confidential message exchange between in presence a potential eavesdropper, bidirectional relaying scheme on time division broadcast (TDBC) was proposed, user sent artificial noise to s...

Journal: :CoRR 2009
Li-Chia Choo Kai-Kit Wong

In this paper, bounds to the secrecy capacity region for the general 3-receiver broadcast channel with 3 degraded message sets, are presented for confidential messages sent to be kept secret from one of the receivers. This model is a more general model than 2-receiver broadcast channels with confidential messages with an external wiretapper, and recently studied 3-receiver degraded broadcast ch...

Journal: :EURASIP J. Wireless Comm. and Networking 2014
John Tadrous Mohammed Nafie

An achievable rate region for a primary multiple access network coexisting with a secondary link of one transmitter and a corresponding receiver is analyzed. The rate region depicts the sum primary rate versus the secondary rate and is established assuming that the secondary link performs rate splitting. The achievable rate region is the union of two types of rate regions. The first type is a r...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید