Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

16-21 Aug. 1998

Filter Results

Displaying Results 1 - 25 of 479
  • Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (1475 KB)
    Freely Available from IEEE
  • Codes and lattices

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (33 KB)

    Summary form only given. The author reports on the progress on Shannon's old problem of finding the best way to pack billiard balls in n=2WT dimensions. Thanks to the efforts of a number of people, we now have reasonably good packings in perhaps the first 64 dimensions. Many-but not all-of the new constructions make use of codes, although we now have to allow codes over rings as well as fields. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From matched filters to martingales

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    Summary form only given. The famous matched filter solution for maximizing the output SNR of a known signal in additive white noise was independently discovered by several investigators in the mid-forties. Since then it has appeared as a key component of optimal detectors in a variety of scenarios. Its first appearance was perhaps in D.O. North's 1943 RCA report, which is remarkable for the facili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variations on the theme of "twenty questions"

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (68 KB)

    Summary form only given. One of the aims of computational complexity theory is to derive lower and upper bounds on the complexity of particular computational problems within particular models of computation. In many of these models computation can be viewed as the acquisition of information about an unknown object and elementary concepts from information theory, such as entropy and Kolmogorov comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surviving in a fast, nomadic world [mobile computing and communication]

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (95 KB)

    Summary form only given, as follows. Most of us are nomads in that we travel from place to place with a wild array of laptops, PDA's, cellular telephones, pagers, etc. We desire to have the same computing environment, services and system support in those locations as we have in our corporate offices. Indeed we desire "anywhere, anytime" connectivity. Unfortunately, as soon as we leave the comfort ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast modular multiplication method using Yacobi's algorithm

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (33 KB)

    Summary form only given. A fast modular multiplication method is presented. The known fastest modular multiplication method by Su and Hwang requires n+11 additions on average for an n-bit modulus. In Su and Hwang's method, the computed values are not stored for use again. In our method, the computed values can be stored by Yacobi's algorithm. According to our analysis, our method is faster than Su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding theorems of quantum information theory

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (54 KB)

    Summary form only given. Shannon's original proof of the channel coding theorem via typical input/output sequences is presented in a sphere-packing form to determine the minimum quantum source coding rate. Let S(/spl rho/)/spl equiv/-tr/spl rho/log/spl rho/ be the Von Neumann entropy of a density operator p on a finite-dimensional space H, i/spl rarr//spl rho//sub i/ the state modulation map on an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Investigation of binary sequences with the "trinomial property"

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (38 KB)

    Summary form only given, as follows. It is well-known that if {a/sub k/} is an m-sequence of period p=2/sup n/-1, then for every /spl tau/, 1/spl les//spl tau//spl les/p-1, {a/sub k/}+{a/sub k+/spl tau//}={a/sub k+/spl tau/'/} for some /spl tau/', 1/spl les//spl tau/'/spl les/p-1. We say that a binary sequence (b/sub k/) of period p has the trinomial property if there exists a pair (/spl tau/,/spl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymmetric turbo-codes

    Publication Year: 1998
    Cited by:  Papers (3)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (131 KB)

    This paper examines the performance of turbo-codes with non-identical component codes. We show that asymmetric turbo-codes provide good performance with respect to both the "error-floor" and the "pre-error-floor" regions of the bit error rate curve. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On systematic single asymmetric error correcting codes

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (115 KB)

    Summary form only given. In the asymmetric channel it is assumed that the transmitted binary sequence may suffer errors of one type only, say 1/spl rarr/0; the 0/spl rarr/1 errors are rare. Since errors are of one type they are called asymmetric errors as opposed to symmetric errors in which both 1/spl rarr/0 and 0/spl rarr/1 are expectable. Obviously, any symmetric error correcting code is also a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Investigation of the error performance of Tunstall coding

    Publication Year: 1998
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (119 KB)

    The error performance of the Tunstall code is analysed, and a relevant metric defined. Several parameters in the encoding process are considered, with the objective of minimising the effect of errors without sacrificing compression. The results obtained show that the error performance may be significantly improved without loss of compression. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New classes of algebraic interleavers for turbo-codes

    Publication Year: 1998
    Cited by:  Papers (29)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    In this paper we present classes of algebraic interleavers that permute a sequence of bits with nearly the same statistical distribution as a randomly chosen interleaver. When these interleavers are used in turbo-coding, they perform equal to or better than the average of a set of randomly chosen interleavers. They are based on a property of quadratic congruences over the ring of integers modulo p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 1998, Page(s):479 - 484
    Request permission for commercial reuse | PDF file iconPDF (336 KB)
    Freely Available from IEEE
  • Convergence and construction of minimal-cost infinite trees

    Publication Year: 1998
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In this paper we introduce some new tools and techniques for the problem of finding minimum-cost prefix-free codes for infinite sources or, equivalently, finding minimum-cost infinite trees View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum key agreement

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    We consider quantum key agreement between two users Alice and Bob in which an eavesdropper Eve intercepts and resends photons. We show how Alice and Bob attain a probabilistic upper bound on Eve's knowledge View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding algebraic-geometric codes over elliptic curves when the number of errors exceeds half of the designed distance

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    V. M. Sidelnikov (1994) constructed decoding algorithms for Reed-Solomon codes when the number of errors exceeds half of the true minimum distance. We consider analogous methods for decoding algebraic-geometric codes over elliptic curves. If the number of errors t exceeds (d*-1)/2, where d* is the designed distance, the decoding problem is reduced to the problem of finding the common zeros of two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New lower bounds on aperiodic crosscorrelation of binary codes

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    For the minimum aperiodic crosscorrelation θ(n,M) of binary codes of size M and length n over the alphabet {1,-1} it is known that the celebrated Welch (1974) bound θ2(n,M)⩾((M-1)n 2)/(2Mn-M-1). In this paper the Welch bound is strengthened for all M⩾4 and n⩾2. In the asymptotic process when M tends to infinity as n→∞, this strengthening giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A special family of product codes “turboly” decodable with application to ATM cell transmission

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    A special product code construction with iterative decoding is presented with an application to ATM cell wireless transmission. This technique is shown to be useful in certain wireless network systems where packet information with a header is transmitted over a noisy channel. The header is more protected than the payload in this construction. Several interesting problems around this technique are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-parametric threshold decision, covering, and some consequences

    Publication Year: 1998
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    We define a non-parametric form of threshold decision and show that the new form naturally leads to a covering theorem and its converse. This covering theorem gives us a key to find interrelationships between several erasure criteria View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-resolution source coding theorems

    Publication Year: 1998
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    For stationary sources on Polish alphabets, we describe the family of achievable rate and distortion vectors (R1,…,RL) and (D1,…,DL) for an L-resolution source code, where the description at the first resolution is given at rate R1 and distortion D1, the description at the second resolution includes both the first des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing an incompressible sequence

    Publication Year: 1998
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    We construct a sequence z which, according to the definition by Ziv and Lempel (1978), is incompressible with finite-state encoders, and show that this sequence is nevertheless compressible by the extended context-tree weighting method of Willems (1994) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing the statistical similarity of discrete observations using Dirichlet priors

    Publication Year: 1998
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    In this paper the combined Bayes test, which uses a Dirichlet (noninformative) prior, is used to determine if the underlying statistics of two data populations are the same. Results demonstrate that the combined Bayes test performs better than the more conventional Kolmogorov-Smirnov test View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes

    Publication Year: 1998
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    While improved bounds have been central to proofs of the coding theorem and the tightness of the random coding bound for rates near capacity, most results for specific codes, both block and convolutional, have been based on the simple union bound. We present an improved bound for the input-binary AWGN channel in terms of the weights of the code-words of a linear block code View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the entropy of constrained 2D fields

    Publication Year: 1998
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    An upper bound on the entropy of constrained 2D fields is presented. The constraints have to be symmetric in (at least) one of the two directions. The bound generalizes (in a weaker form) the bound of Calkin and Wilf (see SIAM Journal of Discrete Mathematics, vol.11, p.54-60, 1998) which is valid only for processes with symmetric transfer matrices. Results are given for constraints specified by ru... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of turbo-coded FH-SS with partial-band interference

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    We investigate the application of turbo codes to a noncoherently received slow frequency-hopped spread spectrum (FH-SS) system with partial-band interference. The modified turbo decoder computes branch transition probabilities for cases where jamming side information is or is not available. For cases where no side information is available, we exploit the channel memory by computing channel state e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.