REVISTA

IEEE TRANSACTIONS ON INFORMATION THEORY

ISSN: 0018-9448 Frecuencia: 7 Formato: Impresa

Tablas de contenido

42 artículos asociados

Volumen 51 Número 1 Parte 0 Año 2005

Interleavers for turbo codes using permutation polynomials over integer rings	Solicitud
Jing Sun; Takeshita, O.Y.
Pág. 101 - 119

Verification-based decoding for packet-based low-density parity-check codes	Solicitud
Luby, M.G.; Mitzenmacher, M.
Pág. 120 - 127

Consistency of support vector machines and other regularized kernel classifiers	Solicitud
Steinwart, I.
Pág. 128 - 142

Conditional importance sampling estimators	Solicitud
Bucklew, J.A.
Pág. 143 - 153

Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection	Solicitud
Jian-Kang Zhang; Kavcic, A.; Kon Max Wong
Pág. 154 - 172

An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels	Solicitud
Guess, T.; Varanasi, M.K.
Pág. 173 - 187

Designing structured tight frames via an alternating projection method	Solicitud
Tropp, J.A.; Dhillon, I.S.; Heath, R.W., Jr.; Strohmer, T.
Pág. 188 - 209

2004 IEEE Information Theory Society Paper Award	Solicitud

Pág. 2 - 3

Coding approaches to fault tolerance in linear dynamic systems	Solicitud
Hadjicostis, C.N.; Verghese, G.C.
Pág. 210 - 228

Full-rate full-diversity space-frequency codes with optimum coding advantage	Solicitud
Weifeng Su; Safar, Z.; Liu, K.J.R.
Pág. 229 - 249

Bounds on distance distributions in codes of known size	Solicitud
Ashikhmin, A.E.; Cohen, G.D.; Krivelevich, M.; Litsyn, S.N.
Pág. 250 - 258

Goppa geometric codes achieving the Gilbert-Varshamov bound	Solicitud
Chaoping Xing
Pág. 259 - 264

Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding	Solicitud
Halabi, N.; Even, G.
Pág. 265 - 280

p-Adic valuation of weights in Abelian codes over /spl Zopf/(p/sup d/)	Solicitud
Katz, D.J.
Pág. 281 - 305

On the capacity of MIMO relay channels	Solicitud
Bo Wang; Junshan Zhang; Host-Madsen, A.
Pág. 29 - 43

Detection and estimation of improper complex random signals	Solicitud
Schreier, P.J.; Scharf, L.L.; Mullis, C.T.
Pág. 306 - 312

On minimum divergence adaptation of discrete bivariate distributions to given marginals	Solicitud
Vajda, I.; van der Meulen, E.C.
Pág. 313 - 320

On feedback and the classical capacity of a noisy quantum channel	Solicitud
Bowen, G.; Nagarajan, R.
Pág. 320 - 324

Algebraic identification for optimal nonorthogonality 4/spl times/4 complex space-time block codes using tensor product on quaternions	Solicitud
Ming-Yang Chen; Hua-Chieh Li; Soo-Chang Pei
Pág. 324 - 330

Constellation space invariance of orthogonal space-time block codes	Solicitud
Gharavi-Alkhansari, M.; Gershman, A.B.
Pág. 331 - 334

Using directed hill-climbing for the construction of difference triangle sets	Solicitud
Koubi, S.; Mata-Montero, M.; Shalaby, N.
Pág. 335 - 339

Improved construction of nonlinear resilient S-boxes	Solicitud
Gupta, K.C.; Sarkar, P.
Pág. 339 - 348

The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets	Solicitud
Karystinos, G.N.; Pados, D.A.
Pág. 348 - 355

A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates	Solicitud
Kan, H.; Hong Shen
Pág. 355 - 359

Distance-increasing mappings from binary vectors to permutations	Solicitud
Jen-Chun Chang
Pág. 359 - 363

Attainable error exponents for the Poisson broadcast channel with degraded message sets	Solicitud
Sokolovsky, A.; Bross, S.I.
Pág. 364 - 374

Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed	Solicitud
Boche, H.; Stanczak, S.
Pág. 374 - 381

Coefficient rate and lossy source coding	Solicitud
Wenye Yang; Gibson, J.D.; Tao He
Pág. 381 - 386

Regular and irregular progressive edge-growth tanner graphs	Solicitud
Xiao-Yu Hu; Eleftheriou, E.; Arnold, D.M.
Pág. 386 - 398

On the equivalence of two Welch-Berlekamp key equations and their error evaluators	Solicitud
Moon, T.K.; Gunther, J.H.
Pág. 399 - 401

2004 IEEE Communications Society and Information Theory Society Joint Paper Award	Solicitud

Pág. 4 - 4

On the weight enumerators of duadic and quadratic residue codes	Solicitud
Gaborit, P.; Nedeloaia, C.-S.; Wassermann, A.
Pág. 402 - 407

On two doubly even self-dual binary codes of length 160 and minimum weight 24	Solicitud
van Dijk, M.; Egner, S.; Greferath, M.; Wassermann, A.
Pág. 408 - 411

List decoding of generalized Reed-Solomon codes over commutative rings	Solicitud
Armand, M.A.
Pág. 411 - 419

An elementary construction of codes from the groups of units of residue rings of polynomials	Solicitud
Reid, L.; Wickham, C.
Pág. 419 - 420

Correction to ?On the Asymptotic Performance of the Decorrelator? and ?An Optimal Whitening Approach to Linear Multiuser Detection	Solicitud
Eldar, Y.C.; Chan, A.M.
Pág. 421 - 421

Compression and Coding Algorithms	Solicitud

Pág. 422 - 422

The private classical capacity and quantum capacity of a quantum channel	Solicitud
Devetak, I.
Pág. 44 - 55

Universal discrete denoising: known channel	Solicitud
Weissman, T.; Ordentlich, E.; Seroussi, G.; Verdu, S.; Weinberger, M.J.
Pág. 5 - 28

Remote preparation of quantum states	Solicitud
Bennett, C.H.; Hayden, P.; Leung, D.W.; Shor, P.W.; Winter, A.
Pág. 56 - 74

The existence of quantum entanglement catalysts	Solicitud
Xiaoming Sun; Runyao Duan; Mingsheng Ying
Pág. 75 - 80

Stochastic analysis of turbo decoding	Solicitud
Fu, M.
Pág. 81 - 100