Sciweavers

76 search results - page 13 / 16
» tit 1998
Sort
View
TIT
1998
70views more  TIT 1998»
13 years 10 months ago
The Poisson Multiple-Access Channel
—The Poisson multiple-access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for ...
Amos Lapidoth, Shlomo Shamai
TIT
1998
72views more  TIT 1998»
13 years 10 months ago
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors
Abstract—Runlength-limited (RLL) codes are used in magnetic recording. The error patterns that occur with peak detection magnetic recording systems when using a runlength-limited...
Patrick Perry, Mingche Li, Mao Chao Lin, Zhen Zhan...
TIT
1998
90views more  TIT 1998»
13 years 10 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
TIT
1998
69views more  TIT 1998»
13 years 10 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
TIT
1998
127views more  TIT 1998»
13 years 10 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...