IEEE Transactions on Information Theory

Volume 47 Issue 3 • March 2001

Filter Results

Displaying Results 1 - 25 of 42
  • 2000 information theory society paper award

    Publication Year: 2001, Page(s): 857
    Request permission for commercial reuse | PDF file iconPDF (12 KB)
    Freely Available from IEEE
  • Comments and additions to recent papers on new convolutional codes

    Publication Year: 2001, Page(s):1199 - 1201
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB) | HTML iconHTML

    Recent publications on new improved convolutional codes claim different codes to be optimum under the optimum distance spectrum (ODS) criterion. This correspondence presents results from a study independent of the previous works, and seeks to clarify some inconsistencies. In addition, some new improved feed-forward convolutional encoders are presented. View full abstract»

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

    Publication Year: 2001, Page(s):1262 - 1271
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Efficient coding schemes for the hard-square model

    Publication Year: 2001, Page(s):1166 - 1176
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB) | HTML iconHTML

    The hard-square model, also known as the two-dimensional (2-D) (1, ∞)-RLL constraint, consists of all binary arrays in which the 1's are isolated both horizontally and vertically. Based on a certain probability measure defined on those arrays, an efficient variable-to-fixed encoder scheme is presented that maps unconstrained binary words into arrays that satisfy the hard-square model. For su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric construction of an optimal [67,9,30] binary code

    Publication Year: 2001, Page(s):1187 - 1189
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB) | HTML iconHTML

    We construct a new optimal binary [67,9,30]-code corresponding to a complete cap of PG(8,2). This cap is obtained by gluing together some Hermitian Veroneseans in a mixed partition of PG(8,2) and one hyperoval. We also construct a ternary [364,9,234]-code corresponding to a complete cap of PG(8,3). This cap turns out to be as large as the largest known cap in PG(8,3) (in an asymptotical sense) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Output MAI distributions of linear MMSE multiuser receivers in DS-CDMA systems

    Publication Year: 2001, Page(s):1128 - 1144
    Cited by:  Papers (117)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    Multiple-access interference (MAI) in a code-division multiple-access (CDMA) system plays an important role in performance analysis and characterization of fundamental system limits. We study the behavior of the output MAI of the minimum mean-square error (MMSE) receiver employed in the uplink of a direct-sequence (DS)-CDMA system. We focus on imperfect power-controlled systems with random spreadi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph-based iterative decoding algorithms for parity-concatenated trellis codes

    Publication Year: 2001, Page(s):1062 - 1074
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    We construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner-Wiberg-Loeliger (1981, 1996) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and sum-produc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal space detection for recording channels with jitter noise

    Publication Year: 2001, Page(s):1153 - 1165
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    A delay-constrained sequence detector is considered for recording channels whose major impediments include intersymbol interference (ISI) and magnetic transition jitter noise. The jitter noise is data-dependent, and a given noise sample is correlated with neighboring noise samples. A sequence detector with a finite decision delay can be formulated in a finite dimensional vector space. For a correl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-splitting multiple access for discrete memoryless channels

    Publication Year: 2001, Page(s):873 - 890
    Cited by:  Papers (63)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2M-1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of findin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical behavior in lossy source coding

    Publication Year: 2001, Page(s):1230 - 1236
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    The following critical phenomenon was recently discovered. When a memoryless source is compressed using a variable-length fixed-distortion code, the fastest convergence rate of the (pointwise) compression ratio to R(D) is either O(√n) or O(log n). We show it is always O(√n), except for discrete, uniformly distributed sources View full abstract»

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

    Publication Year: 2001, Page(s):1215 - 1223
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    The focus of this article is on nonlinear characteristics of cryptographic Boolean functions. First, we introduce the notion of plateaued functions that have many cryptographically desirable properties. Second, we establish a sequence of strengthened inequalities on some of the most important nonlinearity criteria, including nonlinearity, avalanche, and correlation immunity, and prove that critica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimates of the distance distribution of codes and designs

    Publication Year: 2001, Page(s):1050 - 1061
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length and for sequences of codes of growing length. Asymptotic results in the paper improve previously known estimat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of optimal fixed-rate uniform scalar quantization

    Publication Year: 2001, Page(s):957 - 977
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB) | HTML iconHTML

    Studies the asymptotic characteristics of uniform scalar quantizers that are optimal with respect to mean-squared error (MSE). When a symmetric source density with infinite support is sufficiently well behaved, the optimal step size ΔN for symmetric uniform scalar quantization decreases as 2σN-1V¯ -1(1/6N2), where N is the number of quan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the error exponent for woven convolutional codes with inner warp

    Publication Year: 2001, Page(s):1195 - 1199
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB) | HTML iconHTML

    In this correspondence, the error exponents and decoding complexity of binary woven convolutional codes with outer and inner warp are studied. It is shown that for both constructions an error probability that is exponentially decreasing with the memory of the woven convolutional codes can be achieved with a nonexponentially increasing decoding complexity. Furthermore, the error exponent for woven ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On quantum detection and the square-root measurement

    Publication Year: 2001, Page(s):858 - 872
    Cited by:  Papers (104)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We consider the problem of constructing measurements optimized to distinguish between a collection of possibly nonorthogonal quantum states. We consider a collection of pure states and seek a positive operator-valued measure (POVM) consisting of rank-one operators with measurement vectors closest in squared norm to the given states. We compare our results to previous measurements suggested by Pere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compression of sparse matrices by blocked Rice coding

    Publication Year: 2001, Page(s):1223 - 1230
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    This correspondence considers the compression of matrices where the majority of the entries are a fixed constant (most typically zero), usually referred to as sparse matrices. We show that using Golomb or Rice encoding requires significantly less space than previous approaches. Furthermore, compared to arithmetic coding, the space requirements are only slightly increased but access is ten times fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential signal encoding from noisy measurements using quantizers with dynamic bias control

    Publication Year: 2001, Page(s):978 - 1002
    Cited by:  Papers (150)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    Signal estimation from a sequential encoding in the form of quantized noisy measurements is considered. As an example context, this problem arises in a number of remote sensing applications, where a central site estimates an information-bearing signal from low-bandwidth digitized information received from remote sensors, and may or may not broadcast feedback information to the sensors. We demonstr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding the (47,24,11) quadratic residue code

    Publication Year: 2001, Page(s):1181 - 1186
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    The techniques needed to decode the (47,24,11) quadratic residue (QR) code differ from the schemes developed for cyclic codes. By finding certain nonlinear relations between the known and unknown syndromes for this special code, two methods are developed to decode up to the true minimum distance of the (47,24,11) QR code. These algorithms can be utilized to decode effectively the ½-rate (48... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and optimal resource allocation for fading broadcast channels .II. Outage capacity

    Publication Year: 2001, Page(s):1103 - 1127
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB) | HTML iconHTML

    For pt.I see ibid., vol.47, no.3, p.1083-1102 (2002). We study three capacity regions for fading broadcast channels and obtain their corresponding optimal resource allocation strategies: the ergodic (Shannon) capacity region, the zero-outage capacity region, and the capacity region with outage. In this paper, we derive the outage capacity regions of fading broadcast channels, assuming that both th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial properties of frameproof and traceability codes

    Publication Year: 2001, Page(s):1042 - 1049
    Cited by:  Papers (124)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB) | HTML iconHTML

    In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. “Strong” versions of TA allow at least one member of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The one-inclusion graph algorithm is near-optimal for the prediction model of learning

    Publication Year: 2001, Page(s):1257 - 1261
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    Haussler, Littlestone and Warmuth (1994) described a general-purpose algorithm for learning according to the prediction model, and proved an upper bound on the probability that their algorithm makes a mistake in terms of the number of examples seen and the Vapnik-Chervonenkis (VC) dimension of the concept class being learned. We show that their bound is within a factor of 1+o(1) of the best possib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum codes from cyclic codes over GF(4m)

    Publication Year: 2001, Page(s):1176 - 1178
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB) | HTML iconHTML

    We provide a construction for quantum codes (Hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4m). We also provide examples of these codes some of which meet the known bounds for quantum codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast calculation of the number of minimum-weight words of CRC codes

    Publication Year: 2001, Page(s):1190 - 1195
    Cited by:  Papers (8)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    We investigate the most important parameter of the function of undetected error probability for shortened binary cyclic codes. This parameter is Ad, the number of minimum-weight words. A fast method for calculation of Ad is presented. Our approach does not require calculation of the distance distribution of dual codes as most of the known methods do View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complementary sequences for ISI channel estimation

    Publication Year: 2001, Page(s):1145 - 1152
    Cited by:  Papers (56)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    A merit factor based on the sequence autocorrelation function, whose minimization leads to the reduction in the Cramer-Rao lower bound (CRLB) for the variance of “two-sided” intersymbol interference (ISI) channel estimation is introduced. Pairs of binary pilot symbol sequences (a preamble and a postamble) for channel estimation are jointly designed to minimize this merit factor. Given ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based classification trees

    Publication Year: 2001, Page(s):1075 - 1082
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    The construction of classification trees is nearly always top-down, locally optimal, and data-driven. Such recursive designs are often globally inefficient, for instance, in terms of the mean depth necessary to reach a given classification rate. We consider statistical models for which exact global optimization is feasible, and thereby demonstrate that recursive and global procedures may result in... 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