By Topic

IEEE Transactions on Information Theory

Issue 5 • Sep 1994

Filter Results

Displaying Results 1 - 25 of 48
  • Six new binary quasi-cyclic codes

    Publication Year: 1994, Page(s):1666 - 1667
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General principles for the algebraic decoding of cyclic codes

    Publication Year: 1994, Page(s):1661 - 1663
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    This paper provides two theorems for decoding all types of cyclic codes. It is shown that from a polynomial ideal point of view, the decoding problems of cyclic codes are closely related to the monic generators of certain polynomial ideals. This conclusion is also generalized to the decoding problems of algebraic geometry codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On restoring band-limited signals

    Publication Year: 1994, Page(s):1490 - 1503
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (809 KB)

    The problem of reconstruction of band-limited signals from discrete and noisy data is studied. The reconstruction schemes employing cardinal expansions are proposed and their asymptotical properties are examined. In particular, the conditions for the convergence of the mean integrated squared error are found and the rate of convergence is evaluated. The main difference between the proposed reconst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on achievable rates for limited bitshift correcting codes

    Publication Year: 1994, Page(s):1443 - 1458
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1196 KB)

    Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance dBS of a code. For a given δ=dBS/n, where n is the code length, the achievable code rate Rα is lower bounded. We prove the existence of codes of rate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not

    Publication Year: 1994, Page(s):1425 - 1442
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    Let B be the binary two-error-correcting BCH code of length 2m-1 and let Bˆ be the extended code of B. We give formal expressions of weight distributions of the cosets of the codes Bˆ only depending on m. We can then deduce the weight distributions of the cosets of B. When m is odd, it is well known that there are four distinct weight distributions for the cosets of B. So our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary coding by integration of polynomials

    Publication Year: 1994, Page(s):1417 - 1424
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Based on the idea of integration and differentiation of polynomials, a large class of linear unequal error-protection (LUEP) codes is constructed. Many of these codes are optimal. A codeword is generated by binary discrete integration of an all-zero vector, using the information bits as integration constants. Decoding is performed by discrete differentiation of the received word. For special desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structure of linear codes with covering radius two and three

    Publication Year: 1994, Page(s):1406 - 1416
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering radius r. All bounds are derived in a uniform way. We employ results from coding theory, some earlier results on covering codes, and combinatorial arguments. We prove the following bounds: l(6, 2)=13, l(7,2)=19, l(8,2)⩾25, l(9,2)⩾34, l(2m-l,2)⩾2m+1 for m⩾3, l(14,2)⩾182... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A random coding bound for fixed convolutional codes of rate 1/n

    Publication Year: 1994, Page(s):1668 - 1670
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    We show that the ensemble average of the block error probability for the ensemble of terminated rate 1/n fixed convolutional codes, used on the binary symmetric channel with a maximum likelihood decoder, is bounded by exp2-NEr(1-K/N), where N=(L+m)n is the block length, L being the message length, K the constraint length, and E r() is the random coding exponent for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sequential delay estimation in wideband digital communication systems

    Publication Year: 1994, Page(s):1327 - 1333
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The problem of estimating the symbol timing in wideband data communication signals is considered. Conventional approaches to this problem suffer from several drawbacks, including possible lack of consistency due to multiple extrema in the error surface, and very slow convergence due to exceedingly sharp waveform correlation functions. In the paper sequential detection-estimation algorithms that al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suboptimum decoding of decomposable block codes

    Publication Year: 1994, Page(s):1392 - 1405
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    To decode a long block code with a large minimum distance by maximum likelihood decoding is practically impossible because the decoding complexity is simply enormous. However, if a code can be decomposed into constituent codes with smaller dimensions and simpler structure, it is possible to devise a practical and yet efficient scheme to decode the code. This paper investigates a class of decomposa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new rate 2/p binary quasi-cyclic codes

    Publication Year: 1994, Page(s):1667 - 1668
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A class of rate 2/P quasi-cyclic codes can be characterized in terms of m×m circulant matrices. In this correspondence, two new codes with parameters (80, 10, 35) and (95, 10, 42) are presented which improve the known lower bound on the maximum possible minimum distance. The former code can be extended with an even parity check bit to an (81, 10, 36) code that establishes that d2(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulation and coding for throughput-efficient optical systems

    Publication Year: 1994, Page(s):1313 - 1326
    Cited by:  Papers (51)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    Optical direct-detection systems are currently being considered for some high-speed intersatellite links, where data rates of a few hundred megabits per second are envisioned under power and pulsewidth constraints. The authors investigate the capacity, cutoff rate, and error-probability performance of uncoded and trellis-coded systems for various modulation schemes and under throughput and power c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irreducible components of canonical diagrams for spectral nulls

    Publication Year: 1994, Page(s):1375 - 1391
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    Irreducible components of canonical diagrams for spectral null constraints at f=fsk/n are studied, where k and n are integers and fs is the symbol frequency. To identify systematically all irreducible components of the canonical diagrams for first-order spectral nulls at f, we give a set of channel symbol sequences specifying all of them. If n is a prime number, then each seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal waveform selection for tracking systems

    Publication Year: 1994, Page(s):1536 - 1550
    Cited by:  Papers (94)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1188 KB)

    Investigates adaptive waveform selection schemes where selection is based on overall target tracking system performance. Optimal receiver assumptions allow the inclusion of transmitted waveform specification parameters in the tracking subsystem defining equations. The authors give explicit expressions for two one-step ahead optimization problems for a single target in white Gaussian noise when the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The uniqueness of the Best code

    Publication Year: 1994, Page(s):1693 - 1698
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Proves that the (10,40,4) code found by Best (1980) is unique. The authors then employ this fact to show that A(10,3)=A(11,4)⩽78 and A(11,3)=A(12,4)⩽156 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Number of nearest neighbors in a Euclidean code

    Publication Year: 1994, Page(s):1647 - 1649
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A Euclidean code is a finite set of points in n-dimensional Euclidean space ℛn. The total number of nearest neighbors of a given codepoint in the code is called its touching number. We show that the maximum number of codepoints Fn that can share the same nearest-neighbor codepoint is equal to the maximum kissing number τn in n dimensions, that is, the maxi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical coding of Gaussian sources

    Publication Year: 1994, Page(s):1639 - 1645
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Several procedures for encoding a stationary Gaussian source are investigated. In contrast to vector quantization by the LBG-algorithm, coding and rate-distortion performance can be described analytically due to the regular structure of the code vectors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new procedure for decoding cyclic and BCH codes up to actual minimum distance

    Publication Year: 1994, Page(s):1364 - 1374
    Cited by:  Papers (30)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The paper presents a new procedure for decoding cyclic and BCH codes up to their actual minimum distance. It generalizes the Peterson decoding procedure and the procedure of Feng and Tzeng (1991) using nonrecurrent syndrome dependence relations. For a code with actual minimum distance d to correct up to t=[(d-1)/2] errors, the procedure requires a (2t+1)×(2t+1) syndrome matrix with known syn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the probability of deception in authentication with arbitration

    Publication Year: 1994, Page(s):1573 - 1585
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    The paper investigates a model for authentication in which not only an outsider, but also the transmitter or the receiver, may cheat. Lower bounds on the probability of success for different types of deception as well as on the parameters of secure authentication codes are derived. The latter bounds are shown to be tight by demonstrating codes in projective space that meet the bounds with equality View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of convolutional codes using a syndrome trellis

    Publication Year: 1994, Page(s):1663 - 1666
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Soft-decision maximum-likelihood decoding of convolutional codes using the Viterbi algorithm with a syndrome trellis is proposed. The parity check matrix of a convolutional code is used to construct the trellis. This trellis is minimal. The number of operations for the decoding of one block of a q-ary rate k/n convolutional code is ~nqmin(k,n-k)qν, where ν is the memory... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of nonuniform constellations on the Gaussian channel

    Publication Year: 1994, Page(s):1633 - 1638
    Cited by:  Papers (11)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Testing of high-speed voiceband modems has revealed a significant increase in distortion for points near the perimeter of a QAM signal constellation. This distortion increases with distance from the center of the constellation and limits performance at data rates above 19.2 kb/s. The perimeter distortion can be reduced by transforming the signal constellation so that points near the center are clo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal robust signaling with pseudonoise-modulated orthogonal signals

    Publication Year: 1994, Page(s):1619 - 1624
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    It is well known that orthogonal signal sets approach the channel capacity and reliability function of the infinite bandwidth additive white Gaussian noise channel. It is shown that pseudonoise-modulated orthogonal signals play a similar role for the infinite bandwidth Gaussian arbitrarily varying channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On two-dimensional spectral realization

    Publication Year: 1994, Page(s):1603 - 1608
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Reconstruction of a spectral density function from a finite set of covariances can be performed by maximizing an entropy functional. The method of the maximum entropy on the mean is used For computing a discrete version of this spectral density and allows one to give a new interpretation of these reconstruction methods. In fact, the authors show that the choice of the entropy is directly related t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric density estimation for classes of positive random variables

    Publication Year: 1994, Page(s):1513 - 1535
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1480 KB)

    A kernel-based density estimator for positive random variables is proposed and analyzed. In particular, a nonparametric estimator is developed which takes advantage of the fact that positive random variables can be represented as the norms of random vectors. By appropriately choosing the dimension of the assumed vector space, the estimator can be structured to exploit a priori knowledge about the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Nordstrom-Robinson code: representation over GF(4) and efficient decoding

    Publication Year: 1994, Page(s):1686 - 1693
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    We show that the Nordstrom-Robinson (1968) code may be represented as the union of binary images of two isomorphic linear (4,2,3) codes over GF(4). Certain symmetries of the unique quaternary (4,2,3) quadracode are discussed. It is shown how the properties of the Nordstrom-Robinson code itself, such as weight distribution, distance invariance, and the well-known representation as the union of eigh... View full abstract»

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

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Prakash Narayan 

Department of Electrical and Computer Engineering