Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Volume 49 Issue 12 • Dec. 2003

Filter Results

Displaying Results 1 - 25 of 30
  • Zero-error network coding for acyclic networks

    Publication Year: 2003, Page(s):3129 - 3139
    Cited by:  Papers (54)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (938 KB) | HTML iconHTML

    Consider transmitting a set of information sources through a communication network that consists of a number of nodes. Between certain pair of nodes, there exist communication channels on which information can be transmitted. At a node, one or more information sources may be generated, and each of them is multicast to a set of destination nodes on the network. In this paper, we study the problem o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance distributions in ensembles of irregular low-density parity-check codes

    Publication Year: 2003, Page(s):3140 - 3159
    Cited by:  Papers (57)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1371 KB) | HTML iconHTML

    We derive asymptotic expressions for the average distance distributions in ensembles of irregular low-density parity-check (LDPC) codes. The ensembles are defined by matrices with given profiles of column and row sums. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC

    Publication Year: 2003, Page(s):3160 - 3168
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (579 KB) | HTML iconHTML

    McEliece public-key cryptosystem (PKC) is one of a few alternatives for the current PKCs that are mostly based on either the integer factoring problem (IFP) or the discrete logarithm problem (DLP) that would be solved in polynomial time after the emergence of quantum computers. The security of the McEliece PKC is based on the decoding problem and it is known that it satisfies, with an appropriate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-dependent multilevel pattern matching for lossless image compression

    Publication Year: 2003, Page(s):3169 - 3184
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1784 KB) | HTML iconHTML

    In this paper, the multilevel pattern matching (MPM) code for compression of one-dimensional (1D) sequences is first generalized to compress two-dimensional (2D) images, resulting in a 2D multilevel pattern matching (MPM) code. It is shown that among all images of n pixels, the worst case redundancy of the 2D MPM code against any finite-template-based arithmetic code is O(1//spl radic/logn). This ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On competitive prediction and its relation to rate-distortion theory

    Publication Year: 2003, Page(s):3185 - 3194
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB) | HTML iconHTML

    Consider the normalized cumulative loss of a predictor F on the sequence x/sup n/=(x/sub 1/,...,x/sub n/), denoted L/sub F/(x/sup n/). For a set of predictors G, let L(G,x/sup n/)=min/sub F/spl isin/G/L/sub F/(x/sup n/) denote the loss of the best predictor in the class on x/sup n/. Given the stochastic process X=X/sub 1/,X/sub 2/,..., we look at EL(G,X/sup n/), termed the competitive predictabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Postfiltering versus prefiltering for signal recovery from noisy samples

    Publication Year: 2003, Page(s):3195 - 3212
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1235 KB) | HTML iconHTML

    We consider the extension of the Whittaker-Shannon (WS) reconstruction formula to the case of signals sampled in the presence of noise and which are not necessarily band limited. Observing that in this situation the classical sampling expansion yields inconsistent reconstruction, we introduce a class of signal recovery methods with a smooth correction of the interpolation series. Two alternative d... View full abstract»

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

    Publication Year: 2003, Page(s):3213 - 3224
    Cited by:  Papers (62)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    This paper is concerned with a class of low-rate codes constructed from Hadamard code arrays. A recursive encoding principle is employed to introduce an interleaving gain. Very simple trellis codes with only two or four states are sufficient for this purpose, and the decoding cost involved in the trellis part is typically negligible. Both simulation and analytical results are provided to demonstra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-complexity concatenated two-state TCM schemes with near-capacity performance

    Publication Year: 2003, Page(s):3225 - 3234
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB) | HTML iconHTML

    This paper presents a family of concatenated two-state trellis-coded modulation (CT-TCM) schemes. Compared with the existing turbo-type bandwidth-efficient coded modulation schemes, the proposed codes have significantly reduced complexity without sacrificing performance. A joint design strategy for all component codes is established. This leads to so-called asymmetrical and time-varying trellis st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure space-time communication

    Publication Year: 2003, Page(s):3235 - 3249
    Cited by:  Papers (184)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (954 KB) | HTML iconHTML

    Network security is important for information protection in open, secure, or covert communications. One such requirement is to achieve high-rate communications between clients, e.g., terminals or sensors, in the network while hiding information about the transmitted symbols, signal activity, or other sensitive data from an unintended receiver, e.g., an eavesdropper. For wireless links, the single-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On wide-band broadcast channels

    Publication Year: 2003, Page(s):3250 - 3258
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (469 KB) | HTML iconHTML

    Several models of wide-band broadcast communication scenarios are studied with an emphasis on conditions under which, as the bandwidth tends to infinity, time sharing is asymptotically optimal. The models include the Gaussian channel, the Poisson channel, the "very noisy" channel, and the average-power limited fading channel. Only stochastically degraded scenarios are studied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Witsenhausen's zero-error rate for multiple sources

    Publication Year: 2003, Page(s):3258 - 3260
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    We investigate the problem of minimum rate zero-error source coding when there are several decoding terminals having different side information about the central source variable and each of them should decode in an error-free manner. For one decoder this problem was considered by Witsenhausen. The Witsenhausen rate of the investigated multiple source is the asymptotically achievable minimum rate. ... View full abstract»

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

    Publication Year: 2003, Page(s):3261 - 3267
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    In this correspondence, we are interested in linear information inequalities, both discrete and continuous ones. We show that every discrete information inequality is associated with a "balanced" information inequality and a set of "residual weights." To prove the inequality, it is necessary and sufficient to prove that its "balanced" version is valid and all its residual weights are nonnegative. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum distance of array codes as LDPC codes

    Publication Year: 2003, Page(s):3268 - 3271
    Cited by:  Papers (54)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    For a prime q and an integer j/spl les/q, the code C(q,j) is a class of low-density parity-check (LDPC) codes from array codes which has a nice algebraic structure. In this correspondence, we investigate the minimum distance d(q,j) of the code in an algebraic way. We first prove that the code is invariant under a doubly transitive group of "affine" permutations. Then, we show that d(5,4)=8, d(7,4)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary and quadriphase sequences with optimal autocorrelation properties: a survey

    Publication Year: 2003, Page(s):3271 - 3282
    Cited by:  Papers (82)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB) | HTML iconHTML

    Time-discrete signals with good autocorrelation properties are used in various applications in communications engineering. From an implementation point of view, usually sequences with a small phase alphabet and a maximal energy efficiency, i.e., a uniform envelope, are most favorable. For this reason, known methods as well as several new construction techniques of binary and quadriphase sequences ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis for coded CDMA systems

    Publication Year: 2003, Page(s):3282 - 3288
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    This correspondence analyzes the bit-error rate (BER) performance of coded synchronous code-division multiple-access (CDMA) systems assuming perfect channel state information (CSI) and optimal joint multiuser detection/decoding (OJMUDD). Our analysis is conducted in the same framework as that of uncoded systems. First, we derive the precise probability of an error event, then we provide an upper b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducible rank codes and their applications to cryptography

    Publication Year: 2003, Page(s):3289 - 3293
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" col... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New lower bounds and constructions for binary codes correcting asymmetric errors

    Publication Year: 2003, Page(s):3294 - 3299
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    In this correspondence, we study binary asymmetric error-correcting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary asymmetric error-correcting codes can be obtained from this general construction. Furthermore, some new lower bounds for binary asymmetric error-correcting codes are obtained from this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divisibility properties for covering radius of certain cyclic codes

    Publication Year: 2003, Page(s):3299 - 3303
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    We are presenting a new method to obtain the covering radius of codes and in particular to prove quasi-perfection in codes. Our techniques combine divisibility results of Ax-Katz and Moreno-Moreno as well as coding theoretic methods. We answer a problem posed by Cohen-Honkala-Litsyn-Lobstein in the book covering radius for Bose-Chaudhuri-Hocquenghem (BCH) codes. We also obtain the covering radius ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm and architecture for a Galois field multiplicative arithmetic processor

    Publication Year: 2003, Page(s):3303 - 3307
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    We present a new algorithm for generic multiplicative computations of the form ab/c in GF(p/sup m/), including multiplication, inversion, squaring, and division. The algorithm is based on solving a sequence of congruences that are derived from the theory of Grobner bases in modules over the polynomial ring GF(p)[x]. Its corresponding hardware and software architectures can be successfully used in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common coordinates in consecutive addresses

    Publication Year: 2003, Page(s):3308 - 3312
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    We consider lists of distinct q-ary addresses of length n. We wish that any b consecutive addresses in such a list agree in many positions. We give upper bounds on what can be achieved. Moreover, for each q and n, we give explicit constructions of address lists, among which is the conventional q-ary reflected Gray code, that attain these bounds for all b simultaneously. This work has applications ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Square-root measurement for quantum symmetric mixed state signals

    Publication Year: 2003, Page(s):3312 - 3317
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    A certain class of mixed states artificially constructed that is used in quantum cryptography is crucial for representation of signals. This correspondence shows that the square-root measurement gives the optimal measurement for such a class of mixed states. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on B-splines, wavelet scaling functions, and Gabor frames

    Publication Year: 2003, Page(s):3318 - 3320
    Cited by:  Papers (15)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    Let g be a continuous, compactly supported function on such that the integer translates of g constitute a partition of unity. We show that the Gabor system (g,a,b), with window g and time-shift and frequency-shift parameters a,b>0 has no lower frame bound larger than 0 if b=2,3,... and a>0. In particular, (g,a,b) is not a Gabor frame if g is a continuous, compactly supported wavelet scaling ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sparse representations in unions of bases

    Publication Year: 2003, Page(s):3320 - 3325
    Cited by:  Papers (449)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    The purpose of this correspondence is to generalize a result by Donoho and Huo and Elad and Bruckstein on sparse representations of signals in a union of two orthonormal bases for R/sup N/. We consider general (redundant) dictionaries for R/sup N/, and derive sufficient conditions for having unique sparse representations of signals in such dictionaries. The special case where the dictionary is giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Observability of permutations, and stream ciphers

    Publication Year: 2003, Page(s):3326 - 3330
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    We study the observability of a permutation on a finite set by a complex-valued function. The analysis is done in terms of the spectral theory of the unitary operator on functions defined by the permutation. Any function f can be written uniquely as a sum of eigenfunctions of this operator; we call these eigenfunctions the eigencomponents of f. It is shown that a function observes the permutation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of a mobile multiple-antenna wireless link with isotropically random Rician fading

    Publication Year: 2003, Page(s):3330 - 3334
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    We analyze the capacity of a multiple-antenna wireless link with M antennas at the transmitter and N antennas at the receiver in a Rician fading channel when the channel is unknown at both the transmitter and the receiver. The Rician model is a nonstandard model with a Rayleigh component and an isotropically random rank-one specular component. The Rayleigh and specular components remain constant f... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu