Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

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 (30)  |  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
  • Union bounds on the performance of product codes

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

    We estimate the weight enumerator of a product code by using an exact expression for its known terms (e.g., the number of low weight words), and a binomial approximation for its unknown terms. We subsequently apply a union bound, using the estimated weight enumerator, to large product codes. The computed union bounds are similar to the simulation results of iterative (turbo) decoding of such codes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of error-correcting codes

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

    In this paper we present a new method for code construction that implies the choice of the codewords one by one, by means of a special computer implementable selection algorithm. Applying this method, we have obtained binary and nonbinary, individual and burst error-correcting block codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymmetric q-ary error locating codes for character recognition

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

    In character recognition systems, a handwritten character has a possibility of being erroneously recognized as another one due to the existing similar shape between these characters. This paper proposes a definition of new asymmetric q-ary character errors, and under this model, proposes a class of asymmetric q-ary character error locating codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Golay code and a code on the Klein quartic curve

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

    The (24,12,8) Golay code over GF(2) is constructed as the subfield-subcode of a three symbol extended (21,16,4) code constructed on the Klein quartic over GF(8) in a nontraditional way View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaving does not always achieve the largest minimum burst distance asymptotically

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

    It is shown that the most typical interleaving scheme fails to achieve the largest relative minimum burst distance of codes asymptotically for uncountably many values of the information rate View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel architecture for detection

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

    A parallel architecture, consisting of an array of decision elements using only local information about the received signal and previous decisions, is considered for the detection of binary signals over an intersymbol interference (ISI) channel. Some different configurations are considered, including the decision-feedback equalizer (DFE), which can be reformulated in this context View full abstract»

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

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

    A cocyclic Hadamard code is one derived from a cocyclic generalised Hadamard matrix or its equivalents. Many well-known codes arise this way, but the full power of the cocyclic structure is yet to be exploited View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exponential convergence of adaptive algorithms

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

    We introduce a novel method for analyzing a well known class of adaptive algorithms. By combining developments from the theory of Markov processes and long existing results from the theory of perturbations of linear operators we study first the behavior and convergence properties of a class of products of random matrices. This in turn allows for the analysis of the first and second order statistic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Splittings of cyclic groups, tilings of Euclidean space, and perfect shift codes

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

    Often in mathematics there is a deep interplay between algebra and geometry. So, splittings of groups correspond to lattice tilings of the Euclidean space by certain star bodies. This links two code concepts, which at first glance do not seem to be closely related: shift codes and codes in the Lee metric and error measures defined by similar spheres (“Stein sphere” and “Stein cor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive set-membership signal processing in communications

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

    A novel filtering methodology, previously introduced as a viable tool for adaptive signal processing, is presented for applications to interference suppression in communication systems. This technique is based on bounding the worst-case filter error by a designer-specified value View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The solution of a problem of Ulam on searching with lies

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

    We consider Ulam's problem of determining the minimum number of yes-no queries to find an unknown integer between 1 and 220 if at most some given number e of the answers may be lies. Previously published papers have solved the problem for cases e=1,2,3 and 4. In this paper we solve the problem for all values of e View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low complexity blind minimum variance zero forcing equalization of SIMO channels

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

    A novel low complexity algorithm for blind equalization of SIMO channels is proposed. It relies on second order statistics and combines the advantages of a minimum variance distortionless response beamformer with those of a conventional zero forcing equalizer (ZFE) View full abstract»

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