TIT
1998
13 years 11 months ago
1998
—To estimate the convolutional encoder state from received data, one may use the inverse to the encoder G. However, channel errors make this method unreliable. We propose a metho...
TIT
1998
13 years 11 months ago
1998
Abstract—A brief chronicle is given of the historical development of the central problems in the theory of fundamental limits of data compression and reliable communication.
TIT
1998
13 years 11 months ago
1998
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
TIT
1998
13 years 11 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
TIT
1998
13 years 11 months ago
1998
— We look at multiple-track detection for magnetic recording systems that use array heads to write and read over multiple tracks simultaneously. The recording channel is modeled ...
TIT
1998
13 years 11 months ago
1998
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
TIT
1998
13 years 11 months ago
1998
— In this correspondence, the trellis representation of the Kerdock and Delsarte–Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m; ...
TIT
1998
13 years 11 months ago
1998
TIT
1998
13 years 11 months ago
1998
TIT
1998
13 years 11 months ago
1998
In a typical burst-error correction application of a product code of nv nh arrays, one uses an [nh; nh rh] code Ch that detects corrupted rows, and an [nv; nv rv] code Cv that is...