The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Filters
Applications of LDPC Codes to the Wiretap Channel
[article]
2007
arXiv
pre-print
We provide an alternative view of the proof for secrecy capacity of wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. ...
linear-time decodable secrecy codes based on LDPC codes that achieve secrecy. ...
In summary, we have shown that secrecy capacity can be achieved for certain wire tap channels using codes that achieve capacity over the wire tapper's channel. ...
arXiv:cs/0411003v3
fatcat:hfggzri6ljfovfrkh5omdj72aq
Non-Systematic Codes for Physical Layer Security
[article]
2010
arXiv
pre-print
This paper is a first study on the topic of achieving physical layer security by exploiting non-systematic channel codes. ...
In this paper, we show that the same target can also be achieved by using non-systematic codes, able to scramble information bits within the transmitted codeword. ...
A lot of literature is devoted to studying the wire-tap channel capacity and how to achieve it. ...
arXiv:1004.4520v1
fatcat:cwa3bvqqhvelrl24aarvlpvi4i
Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels
2015
EURASIP Journal on Wireless Communications and Networking
It is known that the error rate can be used as a measure of reliability and security over the wire-tap channel when practical, finite length codes are used for transmission, and the security gap is an ...
We consider two kinds of wire-tap channels: the flat and the fast fading wire-tap channels with additive white Gaussian noise. ...
Acknowledgements This work was supported in part by the MIUR project ESCAPADE (Grant RBFR105NLC) under the "FIRB-Futuro in Ricerca 2010" funding program. ...
doi:10.1186/s13638-015-0463-6
fatcat:zov3h5wsyjbero3gltyyrmr7fu
Increasing Physical Layer Security through Scrambled Codes and ARQ
[article]
2011
arXiv
pre-print
We develop the proposal of non-systematic channel codes on the AWGN wire-tap channel. ...
Such coding technique, based on scrambling, achieves high transmission security with a small degradation of the eavesdropper's channel with respect to the legitimate receiver's channel. ...
In this study, we are interested in the Additive White Gaussian Noise (AWGN) wire-tap channel, for which the secrecy capacity equals the difference between the two channel capacities [2] . ...
arXiv:1109.0908v1
fatcat:uyyactwpqrabtc4hjtldm7wuda
Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis
2012
IEEE Transactions on Information Forensics and Security
This study examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise (AWGN) wire-tap channel. ...
We have focused on some examples of Bose-Chaudhuri-Hocquenghem (BCH) and low-density parity-check (LDPC) codes to estimate the security gap, which we have used as a measure of physical layer security, ...
on the security gap over the AWGN wire-tap channel. ...
doi:10.1109/tifs.2012.2187515
fatcat:6hk3ylklm5auboa463okynslwm
Secrecy Capacity of the Gaussian Wire-Tap Channel with Finite Complex Constellation Input
[article]
2010
arXiv
pre-print
The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. ...
It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a fixed noise variance of the eavesdropper's channel has a global maximum at an internal point. ...
The plots, we feel, might also be used to compare the performances of some of the existing coding schemes like the one based on LDPC in [11] . ...
arXiv:1010.1163v1
fatcat:dqb2br3iyjewtdbuteo5zejixm
Statistical mechanics of broadcast channels using low density parity check codes
2003
IEEE International Symposium on Information Theory, 2003. Proceedings.
We investigate the use of Gallager's low-density parity-check (LDPC) codes in a degraded broadcast channel, one of the fundamental models in network information theory. ...
The statistical physics based analysis shows that the practical performance of the suggested method, achieved by employing the belief propagation algorithm, is superior to that of LDPC based time sharing ...
Acknowledgments Support by Grants-in-aid, MEXT (13680400 and 13780208) and JSPS (YK), The Royal Society and EPSRC-GR/N63178 (DS) is acknowledged. ...
doi:10.1109/isit.2003.1228309
fatcat:k3p7jdab5fe7blgtkhzdjhxnfa
Rate-Equivocation Optimal Spatially Coupled LDPC Codes for the BEC Wiretap Channel
[article]
2011
arXiv
pre-print
We use convolutional LDPC ensembles based on the coset encoding scheme. More precisely, we consider regular two edge type convolutional LDPC ensembles. ...
We show that such a construction achieves the whole rate-equivocation region of the BEC wiretap channel. ...
Our two main motivations for considering code constructions for the wire-tap channel based on spatially coupled codes is that these codes perform very well already for modest code lengths and that they ...
arXiv:1010.1669v2
fatcat:rn3qzyqxlfalfpqjfymwlaa6lu
Power minimization algorithm for high-speed access over copper: Multichannel approach
2009
2009 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing
The proposed method reduces the total power consumption by properly partitioning the channel into few sub-channels and using lower complexity coding schemes for the sub-channel with less insertion loss ...
High-complexity coding schemes employed for multi-gigabits transmission systems for higher reliability, e.g., system margin, is one of the major sources of power dissipation. ...
The authors gratefully acknowledge the Nexans's kind support and the tools and services of CICTR and high performance computing services at the Pennsylvania State University. ...
doi:10.1109/pacrim.2009.5291395
fatcat:alhhgcdmxjcyzlpcc4cw6gqiqu
Practical LDPC coded modulation schemes for the fading broadcast channel with confidential messages
2014
2014 IEEE International Conference on Communications Workshops (ICC)
We show that some conditions exist on the system feasibility, and that some outage probability must be tolerated to cope with the fading nature of the channel. ...
In this paper, we consider a quasi-static fading channel in which both public and private messages must be sent from the transmitter to the receivers, and we aim at designing suitable coding and modulation ...
This way, practical coding schemes can be easily assessed and compared, as we have already done for the Gaussian wire-tap channel [17] - [19] . ...
doi:10.1109/iccw.2014.6881291
dblp:conf/icc/BaldiMRC14
fatcat:u4bqs25oanhynmqk7diqtiahau
On secrecy above secrecy capacity
2012
2012 IEEE International Conference on Communication Systems (ICCS)
In this paper we provide schemes that achieve rates above the 'secrecy capacity' region on a Gaussian wire-tap channel. ...
We show that any rate 0 < R < C = 0.5 log(1 + P/N ) is achievable for this case using the usual random coding-decoding scheme. ...
This is achieved by the above water filling policy.
VI. CONCLUSIONS This paper uses a new notion of secrecy for improving the rates in a Gaussian wire-tap channel. ...
doi:10.1109/iccs.2012.6406111
dblp:conf/iccoms/RajeshSS12
fatcat:vngh4znvkjbldeuu5yqc27zm3m
Information-theoretic Physical Layer Security for Satellite Channels
[article]
2017
arXiv
pre-print
From our analysis we discuss the potential of keyless information theoretic physical layer security for satellite channels based on wiretap coding. ...
In this paper we review the concept of wiretap coding from the satellite channel viewpoint. ...
ACKNOWLEDGMENTS The first author would like to acknowledge the European Space Agency for partially funding her work on physical layer security for satellite communications under contract SATNEX IV CoO1 ...
arXiv:1610.07252v3
fatcat:crahyalzd5flxfkaw2qrgxnp74
Asynchronous Physical-Layer Network Coding with Quasi-Cyclic Codes
[article]
2014
arXiv
pre-print
It is shown that the IDT allows one to design the delays so that quasi-cyclic (QC) codes with a proper shifting constraint can be used accordingly. ...
When used in conjunction with QC codes, IDT provides significantly better performance than existing schemes relying solely on cyclic codes. ...
For the point-to-point case, one can easily achieve the capacity by using a capacity-achieving code since τ is known and can be easily compensated. ...
arXiv:1312.4003v2
fatcat:nyu3yeimg5cppajxdpy4yhccy4
On Secrecy above Secrecy Capacity
[article]
2014
arXiv
pre-print
We show that the "confusion" caused to the Eve when the rate of transmission is above capacity of the Eve's channel is similar to the confusion caused by using the wiretap channel codes used below the ...
The usual channel codes are considered for transmission. The rates obtained can reach the channel capacity. ...
CONCLUSIONS This paper uses a new notion of secrecy for improving the rates in a Gaussian wire-tap channel. ...
arXiv:1203.2456v3
fatcat:qx2jjjg2hjb2zbs3o6zljdd6aa
An Overview of Physical Layer Security with Finite-Alphabet Signaling
[article]
2018
arXiv
pre-print
The vast majority of the existing studies in the area of physical layer security focus exclusively on the scenarios where the channel inputs are Gaussian distributed. ...
We explore transmit signal design algorithms for single-antenna as well as multi-antenna wiretap channels under different assumptions on the channel state information at the transmitter. ...
has also been considered in [39] and [40] .August 10, 2018 DRAFT
The authors in [139] provide a coding scheme for an AWGN channel, which satisfy strong secrecy using capacity approaching codes ...
arXiv:1802.06401v2
fatcat:ribkfxbb7bgklf4zvqp2llhayy
« Previous
Showing results 1 — 15 out of 163 results