#### Filter Results:

#### Publication Year

2004

2011

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 in this paper. The (well-known) notions… (More)

We introduce a novel method called constant encoding , which can be used to tamper-proof a software watermark that is embedded in the dynamic data structures of a program. Our novel tamper-proofing method is based on transforming numeric or non-numeric constant values in the text of the wa-termarked program into function calls whose value depends on the… (More)

— Uncertainty Principles for concentration of signals into truncated subspaces are considered. The " classic " Uncertainty Principle is explored as a special case of a more general operator framework. The time-bandwidth concentration problem is shown as a similar special case. A spatial concentration of radio signals example is provided, and it is shown… (More)

—In this note, we show that the operator theoretic concept of Kolmogorov numbers and the number of degrees of freedom at level ǫ of a communication channel are closely related. Linear communication channels may be modeled using linear compact operators on Banach or Hilbert spaces and the number of degrees of freedom of such channels is defined to be the… (More)

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 in this paper. The (well-known) notions… (More)

- ‹
- 1
- ›