id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
0901.0734 | SPARLS: A Low Complexity Recursive $\mathcal{L}_1$-Regularized Least
Squares Algorithm | cs.IT math.IT | We develop a Recursive $\mathcal{L}_1$-Regularized Least Squares (SPARLS)
algorithm for the estimation of a sparse tap-weight vector in the adaptive
filtering setting. The SPARLS algorithm exploits noisy observations of the
tap-weight vector output stream and produces its estimate using an
Expectation-Maximization ty... |
0901.0749 | Quantized Compressive Sensing | cs.IT math.IT | We study the average distortion introduced by scalar, vector, and entropy
coded quantization of compressive sensing (CS) measurements. The asymptotic
behavior of the underlying quantization schemes is either quantified exactly or
characterized via bounds. We adapt two benchmark CS reconstruction algorithms
to accommo... |
0901.0753 | Distributed Preemption Decisions: Probabilistic Graphical Model,
Algorithm and Near-Optimality | cs.LG | Cooperative decision making is a vision of future network management and
control. Distributed connection preemption is an important example where nodes
can make intelligent decisions on allocating resources and controlling traffic
flows for multi-class service networks. A challenge is that nodal decisions are
spatial... |
0901.0760 | A Theoretical Analysis of Joint Manifolds | cs.LG cs.CV | The emergence of low-cost sensor architectures for diverse modalities has
made it possible to deploy sensor arrays that capture a single event from a
large number of vantage points and using multiple modalities. In many
scenarios, these sensors acquire very high-dimensional data such as audio
signals, images, and vid... |
0901.0763 | Distributed Power Allocation in Multi-User Multi-Channel Relay Networks | cs.IT math.IT | This paper has been withdrawn by the authors as they feel it inappropriate to
publish this paper for the time being.
|
0901.0786 | Approximate inference on planar graphs using Loop Calculus and Belief
Propagation | cs.AI | We introduce novel results for approximate inference on planar graphical
models using the loop calculus framework. The loop calculus (Chertkov and
Chernyak, 2006) allows to express the exact partition function of a graphical
model as a finite sum of terms that can be evaluated once the belief
propagation (BP) solutio... |
0901.0824 | A Characterization of Max-Min SIR-Balanced Power Allocation with
Applications | cs.IT math.IT | We consider a power-controlled wireless network with an established network
topology in which the communication links (transmitter-receiver pairs) are
corrupted by the co-channel interference and background noise. We have fairly
general power constraints since the vector of transmit powers is confined to
belong to an... |
0901.0825 | A new muscle fatigue and recovery model and its ergonomics application
in human simulation | cs.RO | Although automatic techniques have been employed in manufacturing industries
to increase productivity and efficiency, there are still lots of manual
handling jobs, especially for assembly and maintenance jobs. In these jobs,
musculoskeletal disorders (MSDs) are one of the major health problems due to
overload and cum... |
0901.0834 | Simple Channel Coding Bounds | cs.IT math.IT | New channel coding converse and achievability bounds are derived for a single
use of an arbitrary channel. Both bounds are expressed using a quantity called
the "smooth 0-divergence", which is a generalization of Renyi's divergence of
order 0. The bounds are also studied in the limit of large block-lengths. In
partic... |
0901.0948 | A New Universal Random-Coding Bound for Average Probability Error
Exponent for Multiple-Access Channels | cs.IT math.IT | In this work, a new upper bound for average error probability of a two-user
discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound
can be universally obtained for all discrete memoryless MACs with given input
and output alphabets. This is the first bound of this type that explicitly uses
the me... |
0901.1043 | The Symmetries of the $\pi$-metric | cs.IT cs.DM math.CO math.IT math.MG | Let V be an n-dimensional vector space over a finite field F_q. We consider
on V the $\pi$-metric recently introduced by K. Feng, L. Xu and F. J.
Hickernell. In this short note we give a complete description of the group of
symmetries of V under the $\pi$-metric.
|
0901.1084 | When do nonlinear filters achieve maximal accuracy? | math.PR cs.IT math.IT | The nonlinear filter for an ergodic signal observed in white noise is said to
achieve maximal accuracy if the stationary filtering error vanishes as the
signal to noise ratio diverges. We give a general characterization of the
maximal accuracy property in terms of various systems theoretic notions. When
the signal st... |
0901.1144 | Bayesian Inference Based on Stationary Fokker-Planck Sampling | cond-mat.dis-nn cs.NE physics.data-an | A novel formalism for Bayesian learning in the context of complex inference
models is proposed. The method is based on the use of the Stationary
Fokker--Planck (SFP) approach to sample from the posterior density. Stationary
Fokker--Planck sampling generalizes the Gibbs sampler algorithm for arbitrary
and unknown cond... |
0901.1152 | A nonclassical symbolic theory of working memory, mental computations,
and mental set | cs.AI cs.NE | The paper tackles four basic questions associated with human brain as a
learning system. How can the brain learn to (1) mentally simulate different
external memory aids, (2) perform, in principle, any mental computations using
imaginary memory aids, (3) recall the real sensory and motor events and
synthesize a combin... |
0901.1162 | Folded Algebraic Geometric Codes From Galois Extensions | cs.IT math.IT | We describe a new class of list decodable codes based on Galois extensions of
function fields and present a list decoding algorithm. These codes are obtained
as a result of folding the set of rational places of a function field using
certain elements (automorphisms) from the Galois group of the extension. This
work i... |
0901.1230 | Logical Algorithms meets CHR: A meta-complexity result for Constraint
Handling Rules with rule priorities | cs.PL cs.AI cs.CC | This paper investigates the relationship between the Logical Algorithms
language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR).
We present a translation schema from LA to CHR-rp: CHR with rule priorities,
and show that the meta-complexity theorem for LA can be applied to a subset of
CHR-rp via ... |
0901.1244 | Constructions of Quasi-Twisted Two-Weight Codes | cs.IT math.IT | A code is said to be two-weight if the non-zero codewords have only two
different a weight w1 and w2. Two-weight codes are closely related to strongly
regular graphs. In this paper. It is shown that a consta-cyclic code of
composite length can be put in the quasi-twisted form. Based on this
transformation, a new cons... |
0901.1287 | Infinite families of recursive formulas generating power moments of
Kloosterman sums: O^- (2n, 2^r) case | math.NT cs.IT math.IT | In this paper, we construct eight infinite families of binary linear codes
associated with double cosets with respect to certain maximal parabolic
subgroup of the special orthogonal group $SO^-(2n,2^r)$. Then we obtain four
infinite families of recursive formulas for the power moments of Kloosterman
sums and four tho... |
0901.1288 | Power-Controlled Feedback and Training for Two-way MIMO Channels | cs.IT math.IT | Most communication systems use some form of feedback, often related to
channel state information. The common models used in analyses either assume
perfect channel state information at the receiver and/or noiseless state
feedback links. However, in practical systems, neither is the channel estimate
known perfectly at ... |
0901.1289 | N-norm and N-conorm in Neutrosophic Logic and Set, and the Neutrosophic
Topologies | cs.AI | In this paper we present the N-norms/N-conorms in neutrosophic logic and set
as extensions of T-norms/T-conorms in fuzzy logic and set. Also, as an
extension of the Intuitionistic Fuzzy Topology we present the Neutrosophic
Topologies.
|
0901.1315 | Stochastic Volatility Models Including Open, Close, High and Low Prices | q-fin.ST cs.CE cs.NA | Mounting empirical evidence suggests that the observed extreme prices within
a trading period can provide valuable information about the volatility of the
process within that period. In this paper we define a class of stochastic
volatility models that uses opening and closing prices along with the minimum
and maximum... |
0901.1408 | A Message-Passing Approach for Joint Channel Estimation, Interference
Mitigation and Decoding | cs.IT math.IT | Channel uncertainty and co-channel interference are two major challenges in
the design of wireless systems such as future generation cellular networks.
This paper studies receiver design for a wireless channel model with both
time-varying Rayleigh fading and strong co-channel interference of similar form
as the desir... |
0901.1444 | Algebraic gossip on Arbitrary Networks | cs.IT math.IT | Consider a network of nodes where each node has a message to communicate to
all other nodes. For this communication problem, we analyze a gossip based
protocol where coded messages are exchanged. This problem was studied by Aoyama
and Shah where a bound to the dissemination time based on the spectral
properties of th... |
0901.1473 | Communication over Individual Channels | cs.IT math.IT | We consider the problem of communicating over a channel for which no
mathematical model is specified. We present achievable rates as a function of
the channel input and output known a-posteriori for discrete and continuous
channels, as well as a rate-adaptive scheme employing feedback which achieves
these rates asymp... |
0901.1492 | An information inequality for the BSSC channel | cs.IT math.IT | We establish an information theoretic inequality concerning the binary
skew-symmetric broadcast channel that was conjectured by one of the authors.
This inequality helps to quantify the gap between the sum rate obtained by the
inner bound and outer bound for the binary skew-symmetric broadcast channel.
|
0901.1503 | A Greedy Omnidirectional Relay Scheme | cs.IT math.IT | A greedy omnidirectional relay scheme is developed, and the corresponding
achievable rate region is obtained for the all-source all-cast problem. The
discussions are first based on the general discrete memoryless channel model,
and then applied to the additive white Gaussian noise (AWGN) models, with both
full-duplex... |
0901.1610 | Towards a Framework for Observing Artificial Evolutionary Systems | cs.NE cs.MA | Establishing the emergence of evolutionary behavior as a defining
characteristic of 'life' is a major step in the Artificial life (ALife)
studies. We present here an abstract formal framework for this aim based upon
the notion of high-level observations made on the ALife model at hand during
its simulations. An obser... |
0901.1655 | Multishot Codes for Network Coding: Bounds and a Multilevel Construction | cs.IT math.IT | The subspace channel was introduced by Koetter and Kschischang as an adequate
model for the communication channel from the source node to a sink node of a
multicast network that performs random linear network coding. So far, attention
has been given to one-shot subspace codes, that is, codes that use the subspace
cha... |
0901.1683 | New Bounds for Binary and Ternary Overloaded CDMA | cs.IT cs.DM math.CO math.IT | In this paper, we study binary and ternary matrices that are used for CDMA
applications that are injective on binary or ternary user vectors. In other
words, in the absence of additive noise, the interference of overloaded CDMA
can be removed completely. Some new algorithms are proposed for constructing
such matrices... |
0901.1694 | Degrees of Freedom of a Communication Channel: Using Generalised
Singular Values | cs.IT math.IT | A fundamental problem in any communication system is: given a communication
channel between a transmitter and a receiver, how many "independent" signals
can be exchanged between them? Arbitrary communication channels that can be
described by linear compact channel operators mapping between normed spaces are
examined ... |
0901.1695 | On the Degrees-of-Freedom of the K-User Gaussian Interference Channel | cs.IT math.IT | The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has
been defined to be the multiple of (1/2)log_2(P) at which the maximum sum of
achievable rates grows with increasing P. In this paper, we establish that the
degrees-of-freedom of three or more user, real, scalar GIFCs, viewed as a
function of ... |
0901.1703 | Pilot Contamination and Precoding in Multi-Cell TDD Systems | cs.IT math.IT | This paper considers a multi-cell multiple antenna system with precoding used
at the base stations for downlink transmission. For precoding at the base
stations, channel state information (CSI) is essential at the base stations. A
popular technique for obtaining this CSI in time division duplex (TDD) systems
is uplin... |
0901.1705 | Rate-Distortion with Side-Information at Many Decoders | cs.IT math.IT | We present a new inner bound for the rate region of the $t$-stage
successive-refinement problem with side-information. We also present a new
upper bound for the rate-distortion function for lossy-source coding with
multiple decoders and side-information. Characterising this rate-distortion
function is a long-standing... |
0901.1708 | A statistical mechanical interpretation of instantaneous codes | cs.IT math.IT | In this paper we develop a statistical mechanical interpretation of the
noiseless source coding scheme based on an absolutely optimal instantaneous
code. The notions in statistical mechanics such as statistical mechanical
entropy, temperature, and thermal equilibrium are translated into the context
of noiseless sourc... |
0901.1732 | Feedback Communication over Individual Channels | cs.IT math.IT | We consider the problem of communicating over a channel for which no
mathematical model is specified. We present achievable rates as a function of
the channel input and output sequences known a-posteriori for discrete and
continuous channels. Furthermore we present a rate-adaptive scheme employing
feedback which achi... |
0901.1737 | Power Adaptive Feedback Communication over an Additive Individual Noise
Sequence Channel | cs.IT math.IT | We consider a real-valued additive channel with an individual unknown noise
sequence. We present a simple sequential communication scheme based on the
celebrated Schalkwijk-Kailath scheme, which varies the transmit power according
to the power of the sequence, so that asymptotically the relation between the
SNR and t... |
0901.1753 | A Channel Coding Perspective of Recommendation Systems | cs.IT math.IT | Motivated by recommendation systems, we consider the problem of estimating
block constant binary matrices (of size $m \times n$) from sparse and noisy
observations. The observations are obtained from the underlying block constant
matrix after unknown row and column permutations, erasures, and errors. We
derive upper ... |
0901.1762 | A Tight Estimate for Decoding Error-Probability of LT Codes Using
Kovalenko's Rank Distribution | cs.IT cs.DM math.CO math.IT | A new approach for estimating the Decoding Error-Probability (DEP) of LT
codes with dense rows is derived by using the conditional Kovalenko's rank
distribution. The estimate by the proposed approach is very close to the DEP
approximated by Gaussian Elimination, and is significantly less complex. As a
key application... |
0901.1821 | Semidefinite representation of convex hulls of rational varieties | math.OC cs.SY math.AG | Using elementary duality properties of positive semidefinite moment matrices
and polynomial sum-of-squares decompositions, we prove that the convex hull of
rationally parameterized algebraic varieties is semidefinite representable
(that is, it can be represented as a projection of an affine section of the
cone of pos... |
0901.1824 | A Highly Nonlinear Differentially 4 Uniform Power Mapping That Permutes
Fields of Even Degree | cs.IT math.IT | Functions with low differential uniformity can be used as the s-boxes of
symmetric cryptosystems as they have good resistance to differential attacks.
The AES (Advanced Encryption Standard) uses a differentially-4 uniform function
called the inverse function. Any function used in a symmetric cryptosystem
should be a ... |
0901.1827 | Triple-Error-Correcting BCH-Like Codes | cs.IT math.IT | The binary primitive triple-error-correcting BCH code is a cyclic code of
minimum distance 7 with generator polynomial having zeros $\alpha$, $\alpha^3$
and $\alpha^5$ where $\alpha$ is a primitive root of unity. The zero set of the
code is said to be {1,3,5}. In the 1970's Kasami showed that one can construct
simila... |
0901.1853 | Binary Causal-Adversary Channels | cs.IT math.IT | In this work we consider the communication of information in the presence of
a causal adversarial jammer. In the setting under study, a sender wishes to
communicate a message to a receiver by transmitting a codeword x=(x_1,...,x_n)
bit-by-bit over a communication channel. The adversarial jammer can view the
transmitt... |
0901.1864 | Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using
Reactive Tabu Search | cs.IT math.IT | Non-orthogonal space-time block codes (STBC) with {\em large dimensions} are
attractive because they can simultaneously achieve both high spectral
efficiencies (same spectral efficiency as in V-BLAST for a given number of
transmit antennas) {\em as well as} full transmit diversity. Decoding of
non-orthogonal STBCs wi... |
0901.1866 | Capacity Achieving Codes From Randomness Condensers | cs.IT math.IT | We establish a general framework for construction of small ensembles of
capacity achieving linear codes for a wide range of (not necessarily
memoryless) discrete symmetric channels, and in particular, the binary erasure
and symmetric channels. The main tool used in our constructions is the notion
of randomness extrac... |
0901.1867 | Belief Propagation Based Decoding of Large Non-Orthogonal STBCs | cs.IT math.IT | In this paper, we present a belief propagation (BP) based algorithm for
decoding non-orthogonal space-time block codes (STBC) from cyclic division
algebras (CDA) having {\em large dimensions}. The proposed approach involves
message passing on Markov random field (MRF) representation of the STBC MIMO
system. Adoption ... |
0901.1869 | Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs Using PDA | cs.IT math.IT | Non-orthogonal space-time block codes (STBC) from cyclic division algebras
(CDA) having large dimensions are attractive because they can simultaneously
achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST
for a given number of transmit antennas) {\em as well as} full transmit
diversity. Dec... |
0901.1886 | Efficient erasure decoding of Reed-Solomon codes | cs.IT cs.DS math.IT | We present a practical algorithm to decode erasures of Reed-Solomon codes
over the q elements binary field in O(q \log_2^2 q) time where the constant
implied by the O-notation is very small. Asymptotically fast algorithms based
on fast polynomial arithmetic were already known, but even if their complexity
is similar,... |
0901.1892 | A New Achievable Rate Region for the Discrete Memoryless Multiple-Access
Channel with Noiseless Feedback | cs.IT math.IT | A new single-letter achievable rate region is proposed for the two-user
discrete memoryless multiple-access channel(MAC) with noiseless feedback. The
proposed region includes the Cover-Leung rate region [1], and it is shown that
the inclusion is strict. The proof uses a block-Markov superposition strategy
based on th... |
0901.1898 | Efficient and Guaranteed Rank Minimization by Atomic Decomposition | math.NA cs.IT math.IT | Recht, Fazel, and Parrilo provided an analogy between rank minimization and
$\ell_0$-norm minimization. Subject to the rank-restricted isometry property,
nuclear norm minimization is a guaranteed algorithm for rank minimization. The
resulting semidefinite formulation is a convex problem but in practice the
algorithms... |
0901.1900 | Performance bounds on compressed sensing with Poisson noise | cs.IT math.IT | This paper describes performance bounds for compressed sensing in the
presence of Poisson noise when the underlying signal, a vector of Poisson
intensities, is sparse or compressible (admits a sparse approximation). The
signal-independent and bounded noise models used in the literature to analyze
the performance of c... |
0901.1904 | Joint universal lossy coding and identification of stationary mixing
sources with general alphabets | cs.IT cs.LG math.IT | We consider the problem of joint universal variable-rate lossy coding and
identification for parametric classes of stationary $\beta$-mixing sources with
general (Polish) alphabets. Compression performance is measured in terms of
Lagrangians, while identification performance is measured by the variational
distance be... |
0901.1905 | Achievability results for statistical learning under communication
constraints | cs.IT cs.LG math.IT | The problem of statistical learning is to construct an accurate predictor of
a random variable as a function of a correlated random variable on the basis of
an i.i.d. training sample from their joint distribution. Allowable predictors
are constrained to lie in some specified class, and the goal is to approach
asympto... |
0901.1924 | Interference Avoidance Game in the Gaussian Interference Channel:
Sub-Optimal and Optimal Schemes | cs.IT math.IT | This paper considers a distributed interference avoidance problem employing
frequency assignment in the Gaussian interference channel (IC). We divide the
common channel into several subchannels and each user chooses the subchannel
with less amount of interference from other users as the transmit channel. This
mechani... |
0901.1936 | A Lower Bound on the Capacity of Wireless Erasure Networks with Random
Node Locations | cs.IT cs.NI math.IT math.PR | In this paper, a lower bound on the capacity of wireless ad hoc erasure
networks is derived in closed form in the canonical case where $n$ nodes are
uniformly and independently distributed in the unit area square. The bound
holds almost surely and is asymptotically tight. We assume all nodes have fixed
transmit power... |
0901.1945 | A mathematical proof of the existence of trends in financial time series | q-fin.ST cs.CE math.CA math.PR q-fin.CP stat.AP | We are settling a longstanding quarrel in quantitative finance by proving the
existence of trends in financial time series thanks to a theorem due to P.
Cartier and Y. Perrin, which is expressed in the language of nonstandard
analysis (Integration over finite sets, F. & M. Diener (Eds): Nonstandard
Analysis in Practi... |
0901.1954 | Two-Way Relay Channels: Error Exponents and Resource Allocation | cs.IT math.IT | In a two-way relay network, two terminals exchange information over a shared
wireless half-duplex channel with the help of a relay. Due to its fundamental
and practical importance, there has been an increasing interest in this
channel. However, surprisingly, there has been little work that characterizes
the fundament... |
0901.1964 | Optimal Detector for Channels with Non-Gaussian Interference | cs.IT math.IT | The detection problem in the Gaussian interference channel is addressed, when
transmitters employ non-Gaussian schemes designed for the single-user Gaussian
channel. A structure consisting of a separate symbol-by-symbol detector and a
hard decoder is considered. Given this structure, an optimal detector is
presented ... |
0901.1971 | Decoding Frequency Permutation Arrays under Infinite norm | cs.IT math.IT | A frequency permutation array (FPA) of length $n=m\lambda$ and distance $d$
is a set of permutations on a multiset over $m$ symbols, where each symbol
appears exactly $\lambda$ times and the distance between any two elements in
the array is at least $d$. FPA generalizes the notion of permutation array. In
this paper,... |
0901.1988 | Many-Help-One Problem for Gaussian Sources with a Tree Structure on
their Correlation | cs.IT math.IT | In this paper we consider the separate coding problem for $L+1$ correlated
Gaussian memoryless sources. We deal with the case where $L$ separately encoded
data of sources work as side information at the decoder for the reconstruction
of the remaining source. The determination problem of the rate distortion
region for... |
0901.2042 | Average Capacity Analysis of Continuous-Time Frequency-Selective
Rayleigh Fading Channels with Correlated Scattering Using Majorization | cs.IT math.IT | Correlated scattering occurs naturally in frequency-selective fading channels
and its impact on the performance needs to be understood. In particular, we
answer the question whether the uncorrelated scattering model leads to an
optimistic or pessimistic estimation of the actual average capacity. In the
paper, we use ... |
0901.2062 | Notes on Reed-Muller Codes | cs.IT math.IT | In this paper, we consider the Reed-Muller (RM) codes. For the first order RM
code, we prove that it is unique in the sense that any linear code with the
same length, dimension and minimum distance must be the first order RM code;
For the second order RM code, we give a constructive linear sub-code family for
the cas... |
0901.2082 | On Source-Channel Separation in Networks | cs.IT math.IT | This paper has been withdrawn.
|
0901.2090 | Two-Bit Message Passing Decoders for LDPC Codes Over the Binary
Symmetric Channel | cs.IT math.IT | In this paper, we consider quantized decoding of LDPC codes on the binary
symmetric channel. The binary message passing algorithms, while allowing
extremely fast hardware implementation, are not very attractive from the
perspective of performance. More complex decoders such as the ones based on
belief propagation exh... |
0901.2094 | The Sensing Capacity of Sensor Networks | cs.IT math.IT | This paper demonstrates fundamental limits of sensor networks for detection
problems where the number of hypotheses is exponentially large. Such problems
characterize many important applications including detection and classification
of targets in a geographical area using a network of sensors, and detecting
complex ... |
0901.2120 | Invertible Extractors and Wiretap Protocols | cs.IT math.IT | A wiretap protocol is a pair of randomized encoding and decoding functions
such that knowledge of a bounded fraction of the encoding of a message reveals
essentially no information about the message, while knowledge of the entire
encoding reveals the message using the decoder. In this paper we study the
notion of eff... |
0901.2130 | Hiding Quiet Solutions in Random Constraint Satisfaction Problems | cond-mat.stat-mech cond-mat.dis-nn cs.AI cs.CC | We study constraint satisfaction problems on the so-called 'planted' random
ensemble. We show that for a certain class of problems, e.g. graph coloring,
many of the properties of the usual random ensemble are quantitatively
identical in the planted random ensemble. We study the structural phase
transitions, and the e... |
0901.2140 | Efficient reconciliation protocol for discrete-variable quantum key
distribution | cs.IT math.IT quant-ph | Reconciliation is an essential part of any secret-key agreement protocol and
hence of a Quantum Key Distribution (QKD) protocol, where two legitimate
parties are given correlated data and want to agree on a common string in the
presence of an adversary, while revealing a minimum amount of information.
In this paper... |
0901.2143 | Coding for Parallel Links to Maximize Expected Decodable-Message Value | cs.IT math.IT | Future communication scenarios for NASA spacecraft may involve multiple
communication links and relay nodes, so that there is essentially a network in
which there may be multiple paths from a sender to a destination. The
availability of individual links may be uncertain. In this paper, scenarios are
considered in whi... |
0901.2147 | Bit Precision Analysis for Compressed Sensing | cs.IT math.IT | This paper studies the stability of some reconstruction algorithms for
compressed sensing in terms of the bit precision. Considering the fact that
practical digital systems deal with discretized signals, we motivate the
importance of the total number of accurate bits needed from the measurement
outcomes in addition t... |
0901.2160 | Analysis of Uncoordinated Opportunistic Two-Hop Wireless Ad Hoc Systems | cs.IT math.IT | We consider a time-slotted two-hop wireless system in which the sources
transmit to the relays in the even time slots (first hop) and the relays
forward the packets to the destinations in the odd time slots (second hop).
Each source may connect to multiple relays in the first hop. In the presence of
interference and ... |
0901.2164 | Cooperative Multiplexing in the Multiple Antenna Half Duplex Relay
Channel | cs.IT math.IT | Cooperation between terminals has been proposed to improve the reliability
and throughput of wireless communication. While recent work has shown that
relay cooperation provides increased diversity, increased multiplexing gain
over that offered by direct link has largely been unexplored. In this work we
show that coop... |
0901.2192 | On Optimal Secure Message Transmission by Public Discussion | cs.CR cs.IT math.IT | In a secure message transmission (SMT) scenario a sender wants to send a
message in a private and reliable way to a receiver. Sender and receiver are
connected by $n$ vertex disjoint paths, referred to as wires, $t$ of which can
be controlled by an adaptive adversary with unlimited computational resources.
In Eurocry... |
0901.2194 | Iterative Spectrum Shaping with Opportunistic Multiuser Detection | cs.IT math.IT | This paper studies a new decentralized resource allocation strategy, named
iterative spectrum shaping (ISS), for the multi-carrier-based multiuser
communication system, where two coexisting users independently and sequentially
update transmit power allocations over parallel subcarriers to maximize their
individual tr... |
0901.2198 | Feasible alphabets for communicating the sum of sources over a network | cs.IT math.IT | We consider directed acyclic {\em sum-networks} with $m$ sources and $n$
terminals where the sources generate symbols from an arbitrary alphabet field
$F$, and the terminals need to recover the sum of the sources over $F$. We show
that for any co-finite set of primes, there is a sum-network which is solvable
only ove... |
0901.2204 | Finite-Length Analysis of Irregular Expurgated LDPC Codes under Finite
Number of Iterations | cs.IT math.IT | Communication over the binary erasure channel (BEC) using low-density
parity-check (LDPC) codes and belief propagation (BP) decoding is considered.
The average bit error probability of an irregular LDPC code ensemble after a
fixed number of iterations converges to a limit, which is calculated via
density evolution, a... |
0901.2207 | Performance and Construction of Polar Codes on Symmetric Binary-Input
Memoryless Channels | cs.IT math.IT | Channel polarization is a method of constructing capacity achieving codes for
symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the
original paper, the construction complexity is exponential in the blocklength.
In this paper, a new construction method for arbitrary symmetric binary
memoryless chann... |
0901.2216 | Discovering Global Patterns in Linguistic Networks through Spectral
Analysis: A Case Study of the Consonant Inventories | cs.CL physics.data-an | Recent research has shown that language and the socio-cognitive phenomena
associated with it can be aptly modeled and visualized through networks of
linguistic entities. However, most of the existing works on linguistic networks
focus only on the local properties of the networks. This study is an attempt to
analyze t... |
0901.2218 | Slepian-Wolf Coding over Cooperative Networks | cs.IT math.IT | We present sufficient conditions for multicasting a set of correlated sources
over cooperative networks. We propose joint source-Wyner-Ziv
encoding/sliding-window decoding scheme, in which each receiver considers an
ordered partition of other nodes. Subject to this scheme, we obtain a set of
feasibility constraints f... |
0901.2224 | Concept-Oriented Model and Query Language | cs.DB | We describe a new approach to data modeling, called the concept-oriented
model (COM), and a novel concept-oriented query language (COQL). The model is
based on three principles: duality principle postulates that any element is a
couple consisting of one identity and one entity, inclusion principle
postulates that any... |
0901.2270 | A Plotkin-Alamouti Superposition Coding Scheme for Cooperative
Broadcasting in Wireless Networks | cs.IT math.IT | This paper deals with superposition coding for cooperative broadcasting in
the case of two coordinated source nodes, as introduced in the seminal work of
Bergmans and Cover in 1974. A scheme is introduced for two classes of
destination (or relay) nodes: Close nodes and far nodes, as ranked by their
spatial distances ... |
0901.2321 | The Redundancy of a Computable Code on a Noncomputable Distribution | stat.ML cs.IT math.IT | We introduce new definitions of universal and superuniversal computable
codes, which are based on a code's ability to approximate Kolmogorov complexity
within the prescribed margin for all individual sequences from a given set.
Such sets of sequences may be singled out almost surely with respect to certain
probabilit... |
0901.2333 | Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum
Throughput and Low Delay in Wireless Networks | cs.NI cs.IT math.IT | Recently, it has been shown that CSMA-type random access algorithms can
achieve the maximum possible throughput in ad hoc wireless networks. However,
these algorithms assume an idealized continuous-time CSMA protocol where
collisions can never occur. In addition, simulation results indicate that the
delay performance... |
0901.2349 | Beyond word frequency: Bursts, lulls, and scaling in the temporal
distributions of words | cs.CL cond-mat.dis-nn physics.data-an physics.soc-ph | Background: Zipf's discovery that word frequency distributions obey a power
law established parallels between biological and physical processes, and
language, laying the groundwork for a complex systems perspective on human
communication. More recent research has also identified scaling regularities in
the dynamics u... |
0901.2356 | Information-Theoretic Bounds for Multiround Function Computation in
Collocated Networks | cs.IT math.IT | We study the limits of communication efficiency for function computation in
collocated networks within the framework of multi-terminal block source coding
theory. With the goal of computing a desired function of sources at a sink,
nodes interact with each other through a sequence of error-free, network-wide
broadcast... |
0901.2367 | An Implementable Scheme for Universal Lossy Compression of Discrete
Markov Sources | cs.IT math.IT | We present a new lossy compressor for discrete sources. For coding a source
sequence $x^n$, the encoder starts by assigning a certain cost to each
reconstruction sequence. It then finds the reconstruction that minimizes this
cost and describes it losslessly to the decoder via a universal lossless
compressor. The cost... |
0901.2370 | Performance of Polar Codes for Channel and Source Coding | cs.IT math.IT | Polar codes, introduced recently by Ar\i kan, are the first family of codes
known to achieve capacity of symmetric channels using a low complexity
successive cancellation decoder. Although these codes, combined with successive
cancellation, are optimal in this respect, their finite-length performance is
not record br... |
0901.2376 | A Limit Theorem in Singular Regression Problem | cs.LG | In statistical problems, a set of parameterized probability distributions is
used to estimate the true probability distribution. If Fisher information
matrix at the true distribution is singular, then it has been left unknown what
we can estimate about the true distribution from random samples. In this paper,
we stud... |
0901.2391 | Weight Distribution of A p-ary Cyclic Code | cs.IT cs.DM math.IT | For an odd prime $p$ and two positive integers $n\geq 3$ and $k$ with
$\frac{n}{{\rm gcd}(n,k)}$ being odd, the paper determines the weight
distribution of a $p$-ary cyclic code $\mathcal{C}$ over $\mathbb{F}_{p}$ with
nonzeros $\alpha^{-1}$, $\alpha^{-(p^k+1)}$ and $\alpha^{-(p^{3k}+1)}$, where
$\alpha$ is a primiti... |
0901.2396 | Joint Source-Channel Coding at the Application Layer for Parallel
Gaussian Sources | cs.IT math.IT | In this paper the multicasting of independent parallel Gaussian sources over
a binary erasure broadcasted channel is considered. Multiresolution embedded
quantizer and layered joint source-channel coding schemes are used in order to
serve simultaneously several users at different channel capacities. The convex
nature... |
0901.2401 | MIMO Broadcast Channel Optimization under General Linear Constraints | cs.IT math.IT | The optimization of the transmit parameters (power allocation and steering
vectors) for the MIMO BC under general linear constraints is treated under the
optimal DPC coding strategy and the simple suboptimal linear zero-forcing
beamforming strategy. In the case of DPC, we show that "SINR duality" and
"min-max duality... |
0901.2410 | On the Energy Benefit of Network Coding for Wireless Multiple Unicast | cs.IT math.IT | We consider the energy savings that can be obtained by employing network
coding instead of plain routing in wireless multiple unicast problems. We
establish lower bounds on the benefit of network coding, defined as the maximum
of the ratio of the minimum energy required by routing and network coding
solutions, where ... |
0901.2483 | Fast Encoding and Decoding of Gabidulin Codes | cs.IT math.IT | Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a
major role in practical error control for network coding. This paper presents
new encoding and decoding algorithms for Gabidulin codes based on
low-complexity normal bases. In addition, a new decoding algorithm is proposed
based on a transfo... |
0901.2538 | Capacity Scaling of SDMA in Wireless Ad Hoc Networks | cs.IT math.IT | We consider an ad hoc network in which each multi-antenna transmitter sends
independent streams to multiple receivers in a Poisson field of interferers. We
provide the outage probability and transmission capacity scaling laws, aiming
at investigating the fundamental limits of Space Division Multiple Access
(SDMA). We... |
0901.2545 | On the Capacity of the Discrete-Time Channel with Uniform Output
Quantization | cs.IT math.IT | This paper provides new insight into the classical problem of determining
both the capacity of the discrete-time channel with uniform output quantization
and the capacity achieving input distribution. It builds on earlier work by
Gallager and Witsenhausen to provide a detailed analysis of two particular
quantization ... |
0901.2586 | Information geometries and Microeconomic Theories | q-fin.GN cs.IT math.IT | More than thirty years ago, Charnes, Cooper and Schinnar (1976) established
an enlightening contact between economic production functions (EPFs) -- a
cornerstone of neoclassical economics -- and information theory, showing how a
generalization of the Cobb-Douglas production function encodes homogeneous
functions.
A... |
0901.2588 | The MIMO Wireless Switch: Relaying Can Increase the Multiplexing Gain | cs.IT math.IT | This paper considers an interference network composed of K half-duplex
single-antenna pairs of users who wish to establish bi-directional
communication with the aid of a multi-input-multi-output (MIMO) half-duplex
relay node. This channel is referred to as the "MIMO Wireless Switch" since,
for the sake of simplicity,... |
0901.2606 | Capacity Bounds of Half-Duplex Gaussian Cooperative Interference Channel | cs.IT math.IT | In this paper, we investigate the half-duplex cooperative communication
scheme of a two user Gaussian interference channel. We develop achievable
region and outer bound for the case when the system allow either transmitter or
receiver cooperation. We show that by using our transmitter cooperation scheme,
there is sig... |
0901.2616 | On the Delay Limited Secrecy Capacity of Fading Channels | cs.IT cs.CR math.IT | In this paper, the delay limited secrecy capacity of the flat fading channel
is investigated under two different assumptions on the available transmitter
channel state information (CSI). The first scenario assumes perfect prior
knowledge of both the main and eavesdropper channel gains. Here, upper and
lower bounds on... |
0901.2665 | A Density Matrix-based Algorithm for Solving Eigenvalue Problems | cs.CE cs.MS | A new numerical algorithm for solving the symmetric eigenvalue problem is
presented. The technique deviates fundamentally from the traditional Krylov
subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other
Davidson-Jacobi techniques, and takes its inspiration from the contour
integration and den... |
0901.2684 | Distributed Large Scale Network Utility Maximization | cs.IT cs.DC math.IT math.OC | Recent work by Zymnis et al. proposes an efficient primal-dual interior-point
method, using a truncated Newton method, for solving the network utility
maximization (NUM) problem. This method has shown superior performance relative
to the traditional dual-decomposition approach. Other recent work by Bickson et
al. sho... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.