We consider the two-dimensional (2-D) (d, IC) runlengthlimited constraint and the 2-D ‘no isolated bits’ constraint (in short, the n.i.b. constraint). A binary array on the square lattice satisfies the two-dimensional (d, IC) constraint if it satisfies the one-dimensional (d, IC) constraint in both vertical and horizontal directions. Similarly, an array on the hexagonal lattice satisfies the tw...

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...

The hard-square model, also known as the two-dimensional (2-D) (1 )-RLL constraint, consists of all binary arrays in which the 1’s are isolated both horizontally and vertically. Based on a certain probability measure defined on those arrays, an efficient variable-to-fixed encoder scheme is presented that maps unconstrained binary words into arrays that satisfy the hard-square model. For suffici...

In this paper we investigate power allocation in MIMO-OFDM systems. We describe the optimal power allocations under two different constraints: a constraint on the total power of all transmitters (TXs) which is applicable in wireless applications, and a constraint on the power of each TX which is more relevant in wireline applications. We describe the optimal TX/RX structure which in combination...

The delay-constrained capacitated minimum spanning tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and delay-constrained minimum spanning tree (DCMST) considers only the maximum end–end delay constraint, the DC-CMST problem deals with...

In this paper, a special case of the vehicle routing problem in which the demands consist in a set of rectangular two-dimensional weighted items is considered. The vehicles have a two-dimensional loading surface and a maximum weight capacity. These problems have a routing and a packing component. A framework to handle the loading of a vehicle is proposed. A Constraint Programming loading model ...

This paper studies an unmanned aerial vehicle (UAV)-enabled multicast channel, in which a UAV serves as a mobile transmitter to deliver common information to a set of K ground users. We aim to characterize the capacity of this channel over a finite UAV communication period, subject to its maximum speed constraint and an average transmit power constraint. To achieve the capacity, the UAV should ...

In this paper, we analyze bi-infinite sequences over the alphabet {0, 1, . . . , q−1}, for an arbitrary q ≥ 2, that satisfy the q-ary ghost pulse (qGP) constraint. A sequence x = (xk)k∈Z ∈ {0, 1, . . . , q−1}Z satisfies the qGP constraint if for all k, l,m ∈ Z such that xk, xl and xm are nonzero and equal, xk+l−m is also nonzero. This constraint arises in the context of coding for communication...