293 research outputs found
Repairable Block Failure Resilient Codes
In large scale distributed storage systems (DSS) deployed in cloud computing,
correlated failures resulting in simultaneous failure (or, unavailability) of
blocks of nodes are common. In such scenarios, the stored data or a content of
a failed node can only be reconstructed from the available live nodes belonging
to available blocks. To analyze the resilience of the system against such block
failures, this work introduces the framework of Block Failure Resilient (BFR)
codes, wherein the data (e.g., file in DSS) can be decoded by reading out from
a same number of codeword symbols (nodes) from each available blocks of the
underlying codeword. Further, repairable BFR codes are introduced, wherein any
codeword symbol in a failed block can be repaired by contacting to remaining
blocks in the system. Motivated from regenerating codes, file size bounds for
repairable BFR codes are derived, trade-off between per node storage and repair
bandwidth is analyzed, and BFR-MSR and BFR-MBR points are derived. Explicit
codes achieving these two operating points for a wide set of parameters are
constructed by utilizing combinatorial designs, wherein the codewords of the
underlying outer codes are distributed to BFR codeword symbols according to
projective planes
Polar Coding for Secure Transmission and Key Agreement
Wyner's work on wiretap channels and the recent works on information
theoretic security are based on random codes. Achieving information theoretical
security with practical coding schemes is of definite interest. In this note,
the attempt is to overcome this elusive task by employing the polar coding
technique of Ar{\i}kan. It is shown that polar codes achieve non-trivial
perfect secrecy rates for binary-input degraded wiretap channels while enjoying
their low encoding-decoding complexity. In the special case of symmetric main
and eavesdropper channels, this coding technique achieves the secrecy capacity.
Next, fading erasure wiretap channels are considered and a secret key agreement
scheme is proposed, which requires only the statistical knowledge of the
eavesdropper channel state information (CSI). The enabling factor is the
creation of advantage over Eve, by blindly using the proposed scheme over each
fading block, which is then exploited with privacy amplification techniques to
generate secret keys.Comment: Proceedings of the 21st Annual IEEE International Symposium on
Personal, Indoor, and Mobile Radio Communications (PIMRC 2010), Sept. 2010,
Istanbul, Turke
Polar Coding for Fading Channels
A polar coding scheme for fading channels is proposed in this paper. More
specifically, the focus is Gaussian fading channel with a BPSK modulation
technique, where the equivalent channel could be modeled as a binary symmetric
channel with varying cross-over probabilities. To deal with variable channel
states, a coding scheme of hierarchically utilizing polar codes is proposed. In
particular, by observing the polarization of different binary symmetric
channels over different fading blocks, each channel use corresponding to a
different polarization is modeled as a binary erasure channel such that polar
codes could be adopted to encode over blocks. It is shown that the proposed
coding scheme, without instantaneous channel state information at the
transmitter, achieves the capacity of the corresponding fading binary symmetric
channel, which is constructed from the underlying fading AWGN channel through
the modulation scheme.Comment: 6 pages, 4 figures, conferenc
Lossy Compression of Exponential and Laplacian Sources using Expansion Coding
A general method of source coding over expansion is proposed in this paper,
which enables one to reduce the problem of compressing an analog
(continuous-valued source) to a set of much simpler problems, compressing
discrete sources. Specifically, the focus is on lossy compression of
exponential and Laplacian sources, which is subsequently expanded using a
finite alphabet prior to being quantized. Due to decomposability property of
such sources, the resulting random variables post expansion are independent and
discrete. Thus, each of the expanded levels corresponds to an independent
discrete source coding problem, and the original problem is reduced to coding
over these parallel sources with a total distortion constraint. Any feasible
solution to the optimization problem is an achievable rate distortion pair of
the original continuous-valued source compression problem. Although finding the
solution to this optimization problem at every distortion is hard, we show that
our expansion coding scheme presents a good solution in the low distrotion
regime. Further, by adopting low-complexity codes designed for discrete source
coding, the total coding complexity can be tractable in practice.Comment: 8 pages, 3 figure
Exploiting Full-duplex Receivers for Achieving Secret Communications in Multiuser MISO Networks
We consider a broadcast channel, in which a multi-antenna transmitter (Alice)
sends confidential information signals to legitimate users (Bobs) in
the presence of eavesdroppers (Eves). Alice uses MIMO precoding to generate
the information signals along with her own (Tx-based) friendly jamming.
Interference at each Bob is removed by MIMO zero-forcing. This, however, leaves
a "vulnerability region" around each Bob, which can be exploited by a nearby
Eve. We address this problem by augmenting Tx-based friendly jamming (TxFJ)
with Rx-based friendly jamming (RxFJ), generated by each Bob. Specifically,
each Bob uses self-interference suppression (SIS) to transmit a friendly
jamming signal while simultaneously receiving an information signal over the
same channel. We minimize the powers allocated to the information, TxFJ, and
RxFJ signals under given guarantees on the individual secrecy rate for each
Bob. The problem is solved for the cases when the eavesdropper's channel state
information is known/unknown. Simulations show the effectiveness of the
proposed solution. Furthermore, we discuss how to schedule transmissions when
the rate requirements need to be satisfied on average rather than
instantaneously. Under special cases, a scheduling algorithm that serves only
the strongest receivers is shown to outperform the one that schedules all
receivers.Comment: IEEE Transactions on Communication
- …