The per-sample zero-dispersion channel model of the optical fiber is considered. It shown that capacity uniquely achieved by an input probability distribution has continuous uniform phase and discrete amplitude takes on finitely many values. This result holds when subject to general cost constraints, include a peak constraint joint average constraint.

-Several new results on binary ( d , k ) codes are given. First, a new derivation for the capacity of these codes based upon information theoretic principles is given. Based upon this result the spectrum of a ( d , k ) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the ( d , k ) constraint is ...

Runlength-limited (d, k) constraints and codes are widely used in digital data recording and transmission applications. Generalizations of runlength constraints to two dimensions are of potential interest in page-oriented information storage systems. However, in contrast to the one-dimensional case, little is known about the information-theoretic properties of two-dimensional constraints or the...

Service sectori growth (e.g., Shugan 1994) and its study suggest that service providers frequently face special problems (e.g., Johnson 1964; Radas and Shugan 1998a, b; Rust, Zahorik, and Keiningham 1995). One such problem is perishability (Parasuraman and Varadarajan 1988). When planes, trains, or ships depart, for example, unused seats are lost forever. Similar problems occur for vacant hotel...

In this paper, we consider the AWGN channel with a power constraint called the (σ, ρ)-power constraint, which is motivated by energy harvesting communication systems. Given a codeword, the constraint imposes a limit of σ+kρ on the total power of any k ≥ 1 consecutive transmitted symbols. Such a channel has infinite memory and evaluating its exact capacity is a difficult task. Consequently, we e...

For a two-user Gaussian multiple access channel (GMAC), frequency division multiple access (FDMA), a well known orthogonal-multiple-access (O-MA) scheme has been preferred to non-orthogonal-multiple-access (NO-MA) schemes since FDMA can achieve the sum-capacity of the channel with only single-user decoding complexity [Chapter 14, Elements of Information Theory by Cover and Thomas]. However, wit...

After successful dynamic spectrum access, cognitive radio (CR) must be able to relay the message/packets to the destination node by utilizing existing primary system(s) (PS) and/or cooperative/cognitive radio nodes in the cognitive radio network. In this paper, we pioneer the exploration of the fundamental behaviors of interference between CRs and PS in such a relay network via network coding. ...

ELECT The effective capacity of communication systems over generalised κ–μ shadowed fading channels is investigated. A novel and analytical expression for the exact effective capacity is derived in terms of the extended generalised bivariate Meijer’s-G function. To intuitively reveal the impact of the system and channel parameters on the effective capacity, closed-form expressions are derived f...

....................................................................................................................................v EXECUTIVE SUMMARY ........................................................................................................... vi CHAPTER 1 BACKGROUND ...................................................................................................1 CHAPTER 2 CH...

We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...