By Topic

IEEE Transactions on Information Theory

Issue 5 • Sep 1997

Filter Results

Displaying Results 1 - 25 of 46
  • Addendum to “Non-BCH triple-error-correcting codes”

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

    For original paper see van der Vlugt (IEEE Trans. Inform. Theory, vol.42, p.1612-14, 1996). One of the subjects in the above-mentioned paper is the determination of the weight distribution of the dual code C of the binary cyclic codes C of length n=2m-1 with zeros α, α2(t-1+1), α(2t+1). Here m=2t+1 and α generate the multip... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some extended results on the search for good convolutional codes

    Publication Year: 1997, Page(s):1682 - 1697
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. The best codes or the best known codes for these two classes of convolutional codes are found, by computer search. Some of them are better than those found in the past. We specify these codes by their transfer function matrices, distance spectra, and information-weight spectra. Furthermore, we derive... View full abstract»

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

    Publication Year: 1997, Page(s):1740 - 1747
    Cited by:  Papers (34)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    This correspondence studies resilient functions which have applications in fault-tolerant distributed computing, quantum cryptographic key distribution, and random sequence generation for stream ciphers. We present a number of new methods for synthesizing resilient functions. An interesting aspect of these methods is that they are applicable both to linear and nonlinear resilient functions. Our se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic iterative algorithms for signal set design for Gaussian channels and optimality of the L2 signal set

    Publication Year: 1997, Page(s):1574 - 1587
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    We propose a stochastic iteration approach to signal set design. Four practical stochastic iterative algorithms are proposed with respect to equal and average energy constraints and sequential and batch modes. By simulation, a new optimal signal set, the L2 signal set (consisting of a regular simplex set of three signals and some zero signals), is found under the strong simplex conjecture (SSC) co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the effect of truncation length on the exact performance of a convolutional code

    Publication Year: 1997, Page(s):1678 - 1681
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    In this correspondence, we first correct a mistake in Best et al. (1995) and then present a method to compute the exact probability of information bit error as a function of truncation length K for a rate 1/2, 2 state code, Finally, we generalize the method to compute the exact bit-error probability of the above convolutional code when the information bits are transmitted in blocks. The simulation... View full abstract»

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

    Publication Year: 1997, Page(s):1400 - 1411
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    A Diamond code is an error-correcting code obtained from two component codes. As in a product code, any symbol in a word of a Diamond code is checked by both component codes. However, the “code directions” for the component codes have been selected to minimize the memory that is required between successive decoding stages for the component codes. Diamond codes combine the error correct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal multiplexing on a single link: delay and buffer requirements

    Publication Year: 1997, Page(s):1518 - 1535
    Cited by:  Papers (85)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    This paper is motivated by the need to provide per-session quality of service guarantees in fast packet-switched networks. We address the problem of characterizing and designing scheduling policies that are optimal in the sense of minimizing buffer and/or delay requirements under the assumption of commonly accepted traffic constraints. We investigate buffer requirements under three typical memory ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New constant weight codes from linear permutation groups

    Publication Year: 1997, Page(s):1623 - 1630
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    New constant weight codes are found by considering certain linear permutation groups. A code is obtained as a collection of orbits of words under such a group. This leads to a difficult optimization problem, where a stochastic search heuristic, tabu search, is used to find good solutions in a feasible amount of time. Nearly 40 new codes of length at most 28 are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the spectrum of distances of a multilevel code, decoded by a multistage decoder

    Publication Year: 1997, Page(s):1736 - 1740
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    In this correspondence we are concerned with the error rates contributed by component codes in a multilevel code, decoded by a multistage decoder. These error rates are required for estimating the performance of the structure, but more importantly, they can serve as a design tool for achieving high coding gain. The latter objective can be reached by approaching a balance among these error rates. F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the undetected error probability and strictly optimal codes

    Publication Year: 1997, Page(s):1489 - 1502
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Error detection is a simple technique used in various communication and memory systems to enhance reliability. We study the probability that a q-ary (linear or nonlinear) block code of length n and size M fails to detect an error. A lower bound on this undetected error probability is derived in terms of q, n, and M. The new bound improves upon other bounds mentioned in the literature, even those t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probability-ratio approach to approximate binary arithmetic coding

    Publication Year: 1997, Page(s):1658 - 1662
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    We describe an alternative mechanism for approximate binary arithmetic coding. The quantity that is approximated is the ratio between the probabilities of the two symbols. Analysis is given to show that the inefficiency so introduced is less than 0.7% on average; and in practice the compression loss is negligible View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long packing and covering codes

    Publication Year: 1997, Page(s):1617 - 1619
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    We study geometrically the domain of linear binary codes and of unrestricted binary codes in the plane (normalized covering radius, normalized minimal distance) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gauss-Markov random fields (CMrf) with continuous indices

    Publication Year: 1997, Page(s):1560 - 1573
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Gauss-Markov random fields (GMrfs) play an important role in the modeling of physical phenomena. The paper addresses the second-order characterization and the sample path description of GMrf's when the indexing parameters take values in bounded subsets of ℜd, d⩾1. Using results of Pitt (1994), we give conditions for the covariance of a GMrf to be the Green's function of a partia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On an approximate eigenvector associated with a modulation code

    Publication Year: 1997, Page(s):1672 - 1678
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    Let S be a constrained system of finite type, described in terms of a labeled graph M of finite type. Furthermore, let C be an irreducible constrained system of finite type, consisting of the collection of possible code sequences of some finite-state-encodable, sliding-block-decodable modulation code for S. It is known that this code could then be obtained by state splitting, using a suitable appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Covering numbers for real-valued function classes

    Publication Year: 1997, Page(s):1721 - 1724
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    We find tight upper and lower bounds on the growth rate for the covering numbers of functions of bounded variation in the L1 metric in terms of all the relevant constants. We also find upper and lower bounds on covering numbers for general function classes over the family of L1(dP) metrics in terms of a scale-sensitive combinatorial dimension of the function class View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-slope universal lossy data compression

    Publication Year: 1997, Page(s):1465 - 1476
    Cited by:  Papers (43)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    Corresponding to any lossless codeword length function l, three universal lossy data compression schemes are presented: one is with a fixed rate, another is with a fixed distortion, and a third is with a fixed slope. The former two universal lossy data compression schemes are the generalization of Yang-Kieffer's (see ibid., vol.42, no.1, p.239-45, 1995) results to the general case of any lossless ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of explicit error detection and threshold decision in decoding with erasures

    Publication Year: 1997, Page(s):1650 - 1655
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    We study the performance of two schemes for decoding with erasures: threshold decision and decision by explicit error detection. We show that the latter scheme based on error-detection coding and maximum-likelihood decoding is at least as good as the former scheme, at least for binary symmetric channels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New extremal self-dual codes of lengths 42 and 44

    Publication Year: 1997, Page(s):1607 - 1612
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    All extremal binary self-dual codes of lengths 42 and 44 which have an automorphism of order 5 with eight independent cycles are obtained up to equivalence. There are 109 inequivalent [42, 21, 8] codes with such an automorphism. All [44, 22, 8] codes that are obtained have 29 different weight enumerators View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential prediction and ranking in universal context modeling and data compression

    Publication Year: 1997, Page(s):1697 - 1706
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Most state-of-the-art lossless image compression schemes use prediction followed by some form of context modeling. This might seem redundant at first, as the contextual information used for prediction is also available for building the compression model, and a universal coder will eventually learn the “predictive” patterns of the data. In this correspondence, we provide a format justif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical method for approaching the channel capacity of constrained channels

    Publication Year: 1997, Page(s):1389 - 1399
    Cited by:  Papers (61)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    A new coding technique is proposed that translates user information into a constrained sequence using very long codewords. Huge error propagation resulting from the use of long codewords is avoided by reversing the conventional hierarchy of the error control code and the constrained code. The new technique is exemplified by focusing on (d, k)-constrained codes. A storage-effective enumerative enco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Nordstrom-Robinson code is algebraic-geometric

    Publication Year: 1997, Page(s):1588 - 1593
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    The techniques of algebraic geometry have been widely and successfully applied to the study of linear codes over finite fields since the early 1980s. There has also been an increased interest in the study of linear codes over finite rings. In a previous paper, we combined these two approaches to coding theory by introducing and studying algebraic-geometric codes over rings. We show that the Nordst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tradeoff between source and channel coding

    Publication Year: 1997, Page(s):1412 - 1424
    Cited by:  Papers (94)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A fundamental problem in the transmission of analog information across a noisy discrete channel is the choice of channel code rate that optimally allocates the available transmission rate between lossy source coding and block channel coding. We establish tight bounds on the channel code rate that minimizes the average distortion of a vector quantizer cascaded with a channel coder and a binary-symm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hyperplane-based algorithm for the digital co-channel communications problem

    Publication Year: 1997, Page(s):1536 - 1548
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The relationship between the blind digital co-channel communications problem and the problem of finding a separating hyperplane in IRd is explored. A simple model for the blind digital co-channel communications problem is X=AS, where X is a known IR d×N matrix. A is an unknown full-rank IRd×d matrix, and S is an unknown full-rank d×N matrix with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound for ternary constant weight codes

    Publication Year: 1997, Page(s):1630 - 1632
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    We derive a lower bound for ternary constant-weight codes with minimum Hamming distance three. The bound is similar to a bound for binary constant-weight codes with minimum distance four described by Graham and Sloane (1980). It improves upon the Gilbert (1952) bound and coincides asymptotically with the Johnson (1962) bound for fixed weight as the codeword length tends to infinity View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiuser approach to narrowband cellular communications

    Publication Year: 1997, Page(s):1503 - 1517
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    We compare three receivers for coded narrowband transmission affected by fading and co-channel interference. The baseline receiver is based on conventional diversity reception with maximal-ratio combining. A multiuser approach allows us to derive a maximum-likelihood multiuser receiver and its reduced-complexity suboptimal version. Finally, a decorrelating diversity receiver, which seeks a tradeof... 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