164 research outputs found
Decoding communities in networks
According to a recent information-theoretical proposal, the problem of
defining and identifying communities in networks can be interpreted as a
classical communication task over a noisy channel: memberships of nodes are
information bits erased by the channel, edges and non-edges in the network are
parity bits introduced by the encoder but degraded through the channel, and a
community identification algorithm is a decoder. The interpretation is
perfectly equivalent to the one at the basis of well-known statistical
inference algorithms for community detection. The only difference in the
interpretation is that a noisy channel replaces a stochastic network model.
However, the different perspective gives the opportunity to take advantage of
the rich set of tools of coding theory to generate novel insights on the
problem of community detection. In this paper, we illustrate two main
applications of standard coding-theoretical methods to community detection.
First, we leverage a state-of-the-art decoding technique to generate a family
of quasi-optimal community detection algorithms. Second and more important, we
show that the Shannon's noisy-channel coding theorem can be invoked to
establish a lower bound, here named as decodability bound, for the maximum
amount of noise tolerable by an ideal decoder to achieve perfect detection of
communities. When computed for well-established synthetic benchmarks, the
decodability bound explains accurately the performance achieved by the best
community detection algorithms existing on the market, telling us that only
little room for their improvement is still potentially left.Comment: 9 pages, 5 figures + Appendi
Fast-Decodable Asymmetric Space-Time Codes from Division Algebras
Multiple-input double-output (MIDO) codes are important in the near-future
wireless communications, where the portable end-user device is physically small
and will typically contain at most two receive antennas. Especially tempting is
the 4 x 2 channel due to its immediate applicability in the digital video
broadcasting (DVB). Such channels optimally employ rate-two space-time (ST)
codes consisting of (4 x 4) matrices. Unfortunately, such codes are in general
very complex to decode, hence setting forth a call for constructions with
reduced complexity.
Recently, some reduced complexity constructions have been proposed, but they
have mainly been based on different ad hoc methods and have resulted in
isolated examples rather than in a more general class of codes. In this paper,
it will be shown that a family of division algebra based MIDO codes will always
result in at least 37.5% worst-case complexity reduction, while maintaining
full diversity and, for the first time, the non-vanishing determinant (NVD)
property. The reduction follows from the fact that, similarly to the Alamouti
code, the codes will be subsets of matrix rings of the Hamiltonian quaternions,
hence allowing simplified decoding. At the moment, such reductions are among
the best known for rate-two MIDO codes. Several explicit constructions are
presented and shown to have excellent performance through computer simulations.Comment: 26 pages, 1 figure, submitted to IEEE Trans. Inf. Theory, October
201
Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code
The 3D MIMO code is a robust and efficient space-time block code (STBC) for
the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML)
decoding complexity. In this paper, we first analyze some properties of the 3D
MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that
the ML decoding performance can be achieved with a complexity of O(M^{4.5})
instead of O(M^8) in quasi static channel with M-ary square QAM modulations.
Consequently, we propose a simplified ML decoder exploiting the unique
properties of 3D MIMO code. Simulation results show that the proposed
simplified ML decoder can achieve much lower processing time latency compared
to the classical sphere decoder with Schnorr-Euchner enumeration
Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity
Construction of high rate Space Time Block Codes (STBCs) with low decoding
complexity has been studied widely using techniques such as sphere decoding and
non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with
M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs
known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the
QRDM decoders to achieve significant decoding complexity reduction without
performance loss. The block orthogonal property of the codes constructed was
however only shown via simulations. In this paper, we give analytical proofs
for the block orthogonal structure of various existing codes in literature
including the codes constructed in the paper by Ren et al. We show that codes
formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate
Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We
also provide new construction of block orthogonal codes from Cyclic Division
Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how
the block orthogonal property of the STBCs can be exploited to reduce the
decoding complexity of a sphere decoder using a depth first search approach.
Simulation results of the decoding complexity show a 30% reduction in the
number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs
without the block orthogonal structure.Comment: 16 pages, 7 figures; Minor changes in lemmas and construction
The benefit of a 1-bit jump-start, and the necessity of stochastic encoding, in jamming channels
We consider the problem of communicating a message in the presence of a
malicious jamming adversary (Calvin), who can erase an arbitrary set of up to
bits, out of transmitted bits . The capacity of such
a channel when Calvin is exactly causal, i.e. Calvin's decision of whether or
not to erase bit depends on his observations was
recently characterized to be . In this work we show two (perhaps)
surprising phenomena. Firstly, we demonstrate via a novel code construction
that if Calvin is delayed by even a single bit, i.e. Calvin's decision of
whether or not to erase bit depends only on (and
is independent of the "current bit" ) then the capacity increases to
when the encoder is allowed to be stochastic. Secondly, we show via a novel
jamming strategy for Calvin that, in the single-bit-delay setting, if the
encoding is deterministic (i.e. the transmitted codeword is a deterministic
function of the message ) then no rate asymptotically larger than is
possible with vanishing probability of error, hence stochastic encoding (using
private randomness at the encoder) is essential to achieve the capacity of
against a one-bit-delayed Calvin.Comment: 21 pages, 4 figures, extended draft of submission to ISIT 201
- …