IEEE Transactions on Information Theory

We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along multiple paths to the destination. Assuming the network has a cell partitioned structure and users move according to a simplified independent and identically distributed (i.i.d.) mobility model, we compute the exact networ... View full abstract»

We study the stability and capacity problems in regular wireless networks. In the first part of the paper, we provide a general approach to characterizing the capacity region of arbitrary networks, find an outer bound to the capacity region in terms of the transport capacity, and discuss connections between the capacity formulation and the stability of node buffers. In the second part of the paper... View full abstract»

We design transmission strategies for medium access control (MAC) layer multicast that maximize the utilization of available bandwidth. Bandwidth efficiency of wireless multicast can be improved substantially by exploiting the feature that a single transmission can be intercepted by several receivers at the MAC layer. The multicast nature of transmissions, however, changes the fundamental relation... View full abstract»

The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t. Recently, it has been shown that this rate can also be achieved for multicasting to several sinks provided that the intermediate nodes are allowed to re-encode the information they receive. We demonstrate examples of ... View full abstract»

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are considered. A generic multiuser detector in the form of the posterior mean estimator is applied before single-user decoding. The generic detector can be particularized t... View full abstract»

The capacity region of code-division multiple access (CDMA) is determined by the set of transmission rates combined with quality-of-service (QoS) requirements which allow for a feasible power allocation scheme for n mobiles in a cellular network. The geometrical and topological properties of the capacity region are investigated in the present paper for the case of unlimited and limited power, resp... View full abstract»

We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission/reception duplexing at the relay node and on the synchronization between the source node and the relay no... View full abstract»

The use of the spatial dimension is known to greatly increase the reliability of quasi-static (i.e., nonergodic) wireless channels. In this paper, it is demonstrated that most of this gain can also be achieved through collaborative communications with single-antenna/multiple-antenna nodes when there is one receiving agent. In particular, for the single-antenna case, communication is considered to ... View full abstract»

The capacity of the multiple-input multiple-output (MIMO) wireless channel with uniform linear arrays (ULAs) of antennas at the transmitter and receiver is investigated. It is assumed that the receiver knows the channel perfectly but that the transmitter knows only the channel statistics. The analysis is carried out using an equivalent virtual representation of the channel that is obtained via a s... View full abstract»

A conditionally Gaussian channel is a vector channel in which the channel output, given the channel input, has a Gaussian distribution with (well-behaved) input-dependent mean and covariance. We study the capacity-achieving probability measure for conditionally Gaussian channels subject to bounded-input constraints and average cost constraints. Many practical communication systems, including addit... View full abstract»

In this paper, error-correcting codes from perfect nonlinear mappings are constructed, and then employed to construct secret sharing schemes. The error-correcting codes obtained in this paper are very good in general, and many of them are optimal or almost optimal. The secret sharing schemes obtained in this paper have two types of access structures. The first type is democratic in the sense that ... View full abstract»

A bound on the minimum distance of a binary error-correcting code is established given constraints on the computational time-space complexity of its encoder where the encoder is modeled as a branching program. The bound obtained asserts that if the encoder uses linear time and sublinear memory in the most general sense, then the minimum distance of the code cannot grow linearly with the block leng... View full abstract»

The construction of algebraic-geometry (AG) codes can be seen as a distinctly geometric process, and yet decoding procedures tend to rely on algebraic ideas that have no direct geometric interpretation. Recently, however, Trygve Johnsen observed that decoding can be viewed in abstract terms of a class of vector bundles on the underlying curve. The present paper describes these objects at a concret... View full abstract»

We consider two-dimensional error-correcting codes capable of correcting a single arbitrary cluster of errors of size b. We provide optimal 2-cluster-correcting codes in several connectivity models, as well as optimal, or nearly optimal, 2-cluster-correcting codes in all dimensions. We also construct 3-cluster-correcting codes and b-straight-cluster-correcting codes. We conclude by improving the R... View full abstract»

We present novel realizations of the transitive signature primitive introduced by Micali and Rivest, enlarging the set of assumptions on which this primitive can be based, and also providing performance improvements over existing schemes. More specifically, we propose new schemes based on factoring, the hardness of the one-more discrete logarithm problem, and gap Diffie-Hellman (DH) groups. All th... View full abstract»

We investigate label efficient prediction, a variant, proposed by Helmbold and Panizza, of the problem of prediction with expert advice. In this variant, the forecaster, after guessing the next element of the sequence to be predicted, does not observe its true value unless he asks for it, which he cannot do too often. We determine matching upper and lower bounds for the best possible excess predic... View full abstract»

Let X be a random variable taking values in a separable Hilbert space X, with label Y∈{0,1}. We establish universal weak consistency of a nearest neighbor-type classifier based on n independent copies (Xi,Yi) of the pair (X,Y), extending the classical result of Stone to infinite-dimensional Hilbert spaces. Under a mild condition on the distribution of X, we also prove st... View full abstract»

In this work, we study coding over a class of two-user broadcast channels (BCs) with additive white Gaussian noise and multiplicative fading known at the receivers only. Joint decoding of low-density parity-check (LDPC) codes is analyzed. The message update rule at the mapping node linking the users' codes is derived and is found to exhibit an interesting soft interference cancellation property. H... View full abstract»

This correspondence presents an importance sampling (IS) simulation scheme for the soft iterative decoding on loop-free multiple-layer trees. It is shown that this scheme is asymptotically efficient in that, for an arbitrary tree and a given estimation precision, the required number of samples is inversely proportional to the noise standard deviation. This work has its application in the simulatio... View full abstract»

In this correspondence, we introduce a simple one-dimensional (1-D) nonlinear map to describe the iterates of the bit-error rate (BER) of parallel-concatenated convolutional codes (PCCC) on the binary-input Gaussian channel. A lower bound on this map is derived based upon the weight enumerator of the constituent codes, thus enabling the characterization of the dynamics of the decoder in terms of f... View full abstract»

In this correspondence, the class of polyadic codes is generalized to the class of consta-Abelian polyadic codes, which, in particular, includes the class of constacyclic polyadic codes. Properties such as the equivalence of polyadic codes and the mth-root lower bound for the minimum weight of a subcode of certain types of polyadic codes are preserved in the consta-Abelian case. Sufficient conditi... View full abstract»

In the present correspondence, an idea of Xing and Chen is used to improve the parameters of Goppa geometry codes from maximal curves. It is shown that we can improve the parameters of Goppa geometry codes almost up to the genus of a maximal curve View full abstract»

Consider a situation where a set of distributed sensors and a fusion center wish to cooperate to estimate an unknown parameter over a bounded interval [-U,U]. Each sensor collects one noise-corrupted sample, performs a local estimation, and transmits a message to the fusion center, while the latter combines the received messages to produce a final estimate. This correspondence investigates optimal... View full abstract»