default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 49
Volume 49, Number 1, January 2003
- 2002 information theory society paper award. IEEE Trans. Inf. Theory 49(1): 2-3 (2003)
- Gerhard Kramer
:
Capacity results for the discrete memoryless network. 4-21 - Ilya Dumer, Daniele Micciancio, Madhu Sudan:
Hardness of approximating the minimum distance of a linear code. 22-37 - Xiao Ma, Aleksandar Kavcic:
Path partitions and forward-only trellis algorithms. 38-52 - Sheridan K. Houghten, Clement W. H. Lam, Larry H. Thiel, J. A. Parker:
The extended quadratic residue code is the only (48, 24, 12) self-dual doubly-even code. 53-59 - Jaime Gutierrez, Igor E. Shparlinski, Arne Winterhof:
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators. 60-64 - Neri Merhav, Tsachy Weissman:
Scanning and prediction in multidimensional data arrays. 65-82 - Andrew B. Nobel:
On optimal sequential prediction for general processes. 83-98 - Prashant Koulgi, Ertem Tuncel, Shankar L. Regunathan, Kenneth Rose:
On zero-error source coding with decoder side information. 99-111 - Qian Zhao, Michelle Effros:
Lossless and near-lossless source coding for multiple access networks. 112-128 - Baltasar Beferull-Lozano, Antonio Ortega:
Efficient quantization for overcomplete expansions in RN. 129-150 - Hesham El Gamal, A. Roger Hammons Jr.:
On the design of algebraic space-time codes for MIMO block-fading channels. 151-163 - Shengli Zhou, Georgios B. Giannakis:
Single-carrier space-time block-coded transmissions over frequency-selective fading channels. 164-179 - Feng-Wen Sun, Yimin Jiang, John S. Baras:
On the convergence of the inverses of Toeplitz matrices and its applications. 180-190 - Yimin Jiang, Feng-Wen Sun, John S. Baras:
On the performance limits of data-aided synchronization. 191-203 - Andreas M. Maras:
Adaptive nonparametric locally optimum Bayes detection in additive non-Gaussian noise. 204-220 - C. King:
The capacity of the quantum depolarizing channel. 221-229 - Dominik Janzing, Thomas Beth:
Quasi-order of clocks and their synchronism and quantum bounds for copying timing information. 230-240 - David J. Young, Norman C. Beaulieu:
Power margin quality measures for correlated random variates derived from the normaldistribution. 241-252 - Ola Wintzell, Michael Lentmaier, Kamil Sh. Zigangirov:
Asymptotic analysis of superorthogonal turbo codes. 253-258 - Lee-Ming Cheng, L. L. Cheng, Wei Sun:
On commutativity of duality operator and propagation operator of linear codes generated from algebraic curves. 258-261 - Yingquan Wu, Dimitrios A. Pados:
An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes. 261-269 - Theo G. Swart, Hendrik C. Ferreira:
A note on double insertion/deletion correcting codes. 269-273 - Alan G. B. Lauder, Kenneth G. Paterson:
Computing the error linear complexity spectrum of a binary sequence of period 2n. 273-280 - Diomidis Spinellis:
Reliable identification of bounded-length viruses is NP-complete. 280-284 - Patrik Ekdahl, Thomas Johansson:
Another attack on A5/1. 284-289 - Ertem Tuncel, Kenneth Rose:
Error exponents in scalable source coding. 289-296 - Pavan K. Vitthaladevuni, Mohamed-Slim Alouini:
A recursive algorithm for the exact BER computation of generalized hierarchical QAM constellations. 297-307 - Stéphane Y. Le Goff:
Signal constellations for bit-interleaved coded modulation. 307-313 - Weifeng Su, Xiang-Gen Xia:
Two generalized complex orthogonal space-time block codes of rates 7/11 and 3/5 for 5 and 6 transmit antennas. 313-316 - Ming Kang, Mohamed-Slim Alouini:
Hotelling's generalized distribution and performance of 2D-RAKE receivers. 317-323 - Jianghong Luo, Lang Lin, Roy D. Yates, Predrag Spasojevic:
Service outage based power and rate allocation. 323-330 - Ta-Hsin Li:
Finite-alphabet information and multivariate blind deconvolution and identification of linear systems. 330-337 - David Gamarnik:
Extension of the PAC framework to finite and countable Markov chains. 338-345 - Rudolf Ahlswede, Andreas J. Winter:
Addendum to "Strong converse for identification via quantum channels". 346 - A. Robert Calderbank, Neil J. A. Sloane:
Correction to "The ternary golay code, the integers 9 and the Coxeter-Todd lattice". 347
Volume 49, Number 2, February 2003
- Balaji Prabhakar, Robert G. Gallager:
Entropy and the timing capacity of discrete queues. 357-370 - Shuo-Yen Robert Li, Raymond W. Yeung, Ning Cai:
Linear network coding. 371-381 - Fang-Wei Fu, Torleiv Kløve, Victor K.-W. Wei:
On the undetected error probability for binary codes. 382-390 - P. Le Bars, Claude Le Dantec, Philippe Piret:
Bolt interleavers for turbo codes. 391-400 - Brian L. Hughes:
Optimal space-time constellations from groups. 401-410 - Austin B. Frakt, Hanoch Lev-Ari, Alan S. Willsky:
A generalized Levinson algorithm for covariance extension with application to multiscale autoregressive modeling. 411-424 - Alexander G. Tartakovsky, X. Rong Li, G. Yaralov:
Sequential detection of targets in multichannel systems. 425-445 - Yonina C. Eldar:
A semidefinite programming approach to optimal unambiguous discrimination of quantumstates. 446-456 - Daniel Gottesman, Hoi-Kwong Lo:
Proof of security of quantum key distribution with two-way classical communications. 457-475 - Jorma Rissanen:
Complexity of simple nonlogarithmic loss functions. 476-484 - A. J. van Zanten, I Nengah Suparta:
The separability of standard cyclic N-ary Gray codes. 485-487 - Patric R. J. Östergård:
Disproof of a conjecture on the existence of balanced optimal covering codes. 487-488 - Gerhard Wunder, Holger Boche:
Upper bounds on the statistical distribution of the crest-factor in OFDM transmission. 488-494 - Thomas Johansson, Enes Pasalic:
A construction of resilient functions with high nonlinearity. 494-501 - Harald Niederreiter:
Periodic sequences with large k-error linear complexity. 501-505 - Neri Merhav:
A large-deviations notion of perfect secrecy. 506-508 - Einar Wensink, W. J. Dijkhof:
On finite sample statistics for Yule-Walker estimates. 509-516 - Yanqin Fan:
On the approximate decorrelation property of the discrete wavelet transform for fractionally differenced processes. 516-521 - Pierre Loyer, Jean-Marie Moureaux, Marc Antonini:
Lattice codebook enumeration for generalized Gaussian source. 521-527 - Ta-Hsin Li, Kai-Sheng Song:
Asymptotic analysis of a fast algorithm for efficient multiple frequency estimation. 529-
Volume 49, Number 3, March 2003
- Anelia Somekh-Baruch, Neri Merhav:
On the error exponent and capacity games of private watermarking systems. 537-562 - Pierre Moulin, Joseph A. O'Sullivan:
Information-theoretic analysis of information hiding. 563-593 - Venkatesan Guruswami:
Constructions of codes from number fields. 594-603 - Daby M. Sow, Alexandros Eleftheriadis:
Complexity distortion theory. 604-608 - Neri Merhav, Ioannis Kontoyiannis:
Source coding exponents for zero-delay coding with finite memory. 609-625 - S. Sandeep Pradhan, Kannan Ramchandran:
Distributed source coding using syndromes (DISCUS): design and construction. 626-643 - Zoran Cvetkovic:
Resilience properties of redundant expansions under additive noise and quantization. 644-656 - Gang George Yin, Vikram Krishnamurthy, Cristina Ion:
Iterate-averaging sign algorithms for adaptive filtering with applications to blind multiuser detection. 657-671 - K. Drouiche:
Testing proportionality for autoregressive processes. 672-681 - Tong Zhang:
Sequential greedy approximation for certain convex optimization problems. 682-691 - Yasuo Matsuyama:
The alpha-EM algorithm: surrogate likelihood maximization using alpha-logarithmic information measures. 692-706 - Zhengdao Wang, Georgios B. Giannakis:
Complex-field coding for OFDM over fading wireless channels. 707-720 - Tom Bohman, Ron Holzman:
A nontrivial lower bound on the Shannon capacities of the complements of odd cycles. 721-722 - Marco Ferrari, Sandro Bellini:
Existence and uniqueness of the solution for turbo decoding of parallel concatenatedsingle parity check codes. 722-725 - Constantinos B. Papadias, Gerard J. Foschini:
Capacity-approaching space-time codes for systems employing four transmitter antennas. 726-732 - Carlos Munuera, Fernando Torres:
A Goppa-like bound on the trellis state complexity of algebraic-geometric codes. 733-737 - Tsonka Stefanova Baicheva, Vesselin Vavrek:
On the least covering radius of binary linear codes with small lengths. 738-740 - Olgica Milenkovic, T. S. Coffey, Kevin J. Compton:
The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. 740-746 - Daniel B. Dalan:
New extremal binary [44, 22, 8] codes. 747-748 - Junying Pei, Jie Cui, Sanyang Liu:
Cyclic codes over GR(4m) which are also cyclic over Z4. 749-758 - Wensong Chu, Solomon W. Golomb:
A note on the equivalence between strict optical orthogonal codes and difference triangle sets. 759-761 - Wenfeng Qi, Hong Xu:
Partial period distribution of FCSR sequences. 761-765 - Giorgio Taricco, Ezio Biglieri:
Correction to "exact pairwise error probability of space-time codes". 766-
Volume 49, Number 4, April 2003
- Nicholas Pippenger:
The inequalities of quantum information theory. 773-789 - Paul-Peter Sotiriadis, Vahid Tarokh, Anantha P. Chandrakasan:
Energy reduction in VLSI computation modules: an information-theoretic approach. 790-808 - Hanying Feng, Michelle Effros:
Improved bounds for the rate loss of multiresolution source codes. 809-821 - Ueli M. Maurer, Stefan Wolf:
Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result. 822-831 - Ueli M. Maurer, Stefan Wolf:
Secret-key agreement over unauthenticated public channels II: the simulatability condition. 832-838 - Ueli M. Maurer, Stefan Wolf:
Secret-key agreement over unauthenticated public channels III: Privacy amplification. 839-851 - Alexander Barg, G. R. Blakley, Gregory A. Kabatiansky:
Digital fingerprinting codes: problem statements, constructions, identification of traitors. 852-865 - Huaxiong Wang, Chaoping Xing, Reihaneh Safavi-Naini:
Linear authentication codes: bounds and constructions. 866-872 - Pablo Anigstein, Venkat Anantharam:
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum. 873-885 - Tommy Guess:
Optimal sequences for CDMA with decision-feedback receivers. 886-900 - Matthias Brehler, Mahesh K. Varanasi:
Optimum receivers and low-dimensional spreaded modulation for multiuser space-time communications. 901-918 - Elona Erez, Meir Feder:
Improving the generalized likelihood ratio test for unknown linear Gaussian channels. 919-936 - Hamid Jafarkhani, Nambi Seshadri:
Super-orthogonal space-time trellis codes. 937-950 - Babak Hassibi, Bertrand M. Hochwald:
How much training is needed in multiple-antenna wireless links?. 951-963 - Elisabeth Gassiat, Stéphane Boucheron:
Optimal error exponents in hidden Markov models order estimation. 964-980 - Ivan V. Bajic, John W. Woods:
Maximum minimal distance partitioning of the Z2 lattice. 981-992 - Yonina C. Eldar, Helmut Bölcskei:
Geometrically uniform frames. 993-1006 - Yonina C. Eldar, Alexandre Megretski, George C. Verghese:
Designing optimal quantum detectors via semidefinite programming. 1007-1012 - Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Reduced GMD decoding. 1013-1027 - Jongseung Park, Jaekyun Moon:
Alternative structure for computing APPs of the Markov source. 1027-1029 - Loïc Brunel, Joseph Boutros:
Lattice decoding for joint detection in direct-sequence CDMA systems. 1030-1037 - Dong Sik Kim, Mark R. Bell:
Upper bounds on empirically optimal quantizers. 1037-1046 - Ioannis Kontoyiannis:
Pattern matching and lossy data compression on random fields. 1047-1051 - San Ling, Patrick Solé:
Good self-dual quasi-cyclic codes exist. 1052-1053 - Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kløve, Shi-Chun Tsai:
Distance-preserving mappings from binary vectors to permutations. 1054-1059 - Mohamed Oussama Damen, Norman C. Beaulieu:
On two high-rate algebraic space-time codes. 1059-1063
Volume 49, Number 5, May 2003
- Lizhong Zheng, David N. C. Tse:
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels. 1073-1096 - Hesham El Gamal, Mohamed Oussama Damen:
Universal space-time coding. 1097-1119 - Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Tree-based reparameterization framework for analysis of sum-product and related algorithms. 1120-1146 - Michael Gastpar, Bixio Rimoldi, Martin Vetterli:
To code, or not to code: lossy source-channel communication revisited. 1147-1158 - Richard J. Barron, Brian Chen, Gregory W. Wornell:
The duality between information embedding and source coding with side information and some applications. 1159-1180 - S. Sandeep Pradhan, Jim Chou, Kannan Ramchandran:
Duality between source coding and channel coding and its extension to the side information case. 1181-1203 - Robert M. Gray, Tamás Linder:
Mismatch in high-rate entropy-constrained vector quantization. 1204-1217 - Ertem Tuncel, Kenneth Rose:
Computation and analysis of the N-Layer scalable rate-distortion function. 1218-1230 - Panu Chaichanavong, Brian H. Marcus:
Optimal block-type-decodable encoders for constrained systems. 1231-1250 - Jürgen Häring, Adrianus J. Han Vinck:
Iterative decoding of codes over complex numbers for impulsive noise channels. 1251-1260 - Eric M. Rains:
New asymptotic bounds for self-dual codes and lattices. 1261-1274 - YoungJu Choie, Steven T. Dougherty, Haesuk Kim:
Complete joint weight enumerators and self-dual codes. 1275-1282 - Yanxun Chang, Ryoh Fuji-Hara, Ying Miao:
Combinatorial constructions of optimal optical orthogonal codes with weight 4. 1283-1292 - Mérouane Debbah, Walid Hachem, Philippe Loubaton, Marc de Courville:
MMSE analysis of certain large isometric random precoded systems. 1293-1311 - Alice Silverberg, Jessica Staddon, Judy L. Walker:
Applications of list decoding to tracing traitors. 1312-1318 - Reihaneh Safavi-Naini, Yejing Wang:
Sequential traitor tracing. 1319-1326 - Aleksandar Dogandzic:
Chernoff bounds on pairwise error probabilities of space-time codes. 1327-1336 - Sanjay M. Joshi, Joel M. Morris:
Product-function frames in l2(Z). 1336-1342 - Jonas Samuelsson:
Multidimensional companding quantization of the Gaussian source. 1343-1351 - Chien-Yu Chen, Iwan M. Duursma:
Geometric Reed-Solomon codes of length 64 and 65 over F8. 1351-1353 - Alphonse Baartmans, Vassil Yorgov:
Some new extremal codes of lengths 76 and 78. 1353-1354 - Stavros Konstantinidis, Steven Perron, L. Amber Wilcox-O'Hearn:
On a simple method for detecting synchronization errors in coded messages. 1355-1363 - Khairi Ashour Hamdi:
Hit statistics in FH-CDMA unslotted packet networks. 1363-1368 - Ali Abdi, Said Nader-Esfahani:
Expected number of maxima in the envelope of a spherically invariant random process. 1369-1375
Volume 49, Number 6, June 2003
- Steve Hranilovic, Frank R. Kschischang:
Optical intensity-modulated direct detection channels: signal space and lattice codes. 1385-1399 - Giuseppe Caire, Giulio Colavolpe:
On low-complexity space-time coding for quasi-static channels. 1400-1416 - Thomas Blackford:
Negacyclic codes over Z4 of even length. 1417-1424 - Henry D. Pfister, Paul H. Siegel:
The serial concatenation of rate-1 codes through uniform random interleavers. 1425-1438 - Chaoping Xing, P. Vijay Kumar, Cunsheng Ding:
Low-correlation, large linear span sequences from function fields. 1439-1446 - Onkar Dabeer, Elias Masry:
Convergence analysis of the constant modulus algorithm. 1447-1464 - Greg Kuperberg:
The capacity of hybrid quantum memory. 1465-1473 - Imre Csiszár, Frantisek Matús:
Information projections revisited. 1474-1490 - Alexei A. Fedotov, Peter Harremoës, Flemming Topsøe:
Refinements of Pinsker's inequality. 1491-1498 - Ranjan K. Mallik:
On multivariate Rayleigh and exponential distributions. 1499-1515 - Marie-Pierre Béal:
Extensions of the method of poles for code construction. 1516-1523 - Ferruh Özbudak, Henning Stichtenoth:
Constructing linear unequal error protection codes from algebraic curves. 1523-1526 - Morteza Esmaeili, T. Aaron Gulliver, Amir K. Khandani:
On the Pless-construction and ML decoding of the (48, 24, 12) quadratic residue code. 1527-1535 - Bader F. AlBdaiwi, Bella Bose:
Quasi-perfect Lee distance codes. 1535-1539 - T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch:
Optimal quaternary linear rate-1/2 codes of length <18. 1540-1543 - Sanna M. Ranto:
Optimal linear identifying codes. 1544-1547 - Tor Helleseth, Sang-Hyo Kim, Jong-Seon No:
Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences. 1548-1552 - Shuqin Fan, Wenbao Han:
Random properties of the highest level sequences of primitive sequences over Z(2e). 1553-1557 - Tommy Guess, Mahesh K. Varanasi:
A comparison of bandwidth-efficient multiple access to other signal designs for correlated waveform multiple-access communications. 1558-1564 - Matthias Brehler, Mahesh K. Varanasi:
Optimum multiuser noncoherent DPSK detection in generalized diversity Rayleigh-fading channels. 1565-1574 - Jesús Navarro-Moreno, Juan Carlos Ruiz-Molina, Rosa M. Fernández-Alcalá:
Approximate series representations of second-order stochastic processes: applications to signal detection and estimation. 1574-1578 - Arie Feuer, Arkadi Nemirovski:
On sparse representation in pairs of bases. 1579-1581 - Carmen-Simona Nedeloaia:
Weight distributions of cyclic self-dual codes. 1582-1591
Volume 49, Number 7, July 2003
- G. David Forney Jr.:
Codes on graphs: constraint complexity of cycle-free realizations of linear codes. 1597-1610 - Igal Sason, Rüdiger L. Urbanke:
Parity-check density versus performance of binary linear block codes over memorylesssymmetric channels. 1611-1635 - Aleksandar Kavcic, Xiao Ma, Michael Mitzenmacher:
Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. 1636-1652 - Chaoping Xing:
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound. 1653-1657 - Vinay A. Vaishampayan, Sueli I. Rodrigues Costa:
Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources. 1658-1672 - Shengli Zhou, Georgios B. Giannakis:
Optimal transmitter eigen-beamforming and space-time block coding based on channel correlations. 1673-1690 - Giuseppe Caire, Shlomo Shamai:
On the achievable throughput of a multiantenna Gaussian broadcast channel. 1691-1706 - Daniel Pérez Palomar, John M. Cioffi, Miguel Angel Lagunas:
Uniform power allocation in MIMO channels: a game-theoretic approach. 1707-1727 - Ateet Kapur, Mahesh K. Varanasi:
Multiuser detection for overloaded CDMA systems. 1728-1742 - Ding-Xuan Zhou:
Capacity of reproducing kernel spaces in learning theory. 1743-1752 - Masahito Hayashi, Hiroshi Nagaoka:
General formulas for capacity of classical-quantum channels. 1753-1768 - Jong-Seon No, Gang-Mi Gil, Dong-Joon Shin:
Generalized construction of binary bent sequences with optimal correlation property. 1769-1780 - Alon Orlitsky, Krishnamurthy Viswanathan:
One-way communication and error-correcting codes. 1781-1788 - Mark G. Karpovsky, Lev B. Levitin, Ari Trachtenberg:
Data verification and reconciliation with generalized error-control cod. 1788-1793 - Gianluigi Ferrari, Keith M. Chugg:
Linear programming-based optimization of the distance spectrum of linear block codes. 1794-1800 - Jeongseok Ha, Steven W. McLaughlin:
Low-density parity-check codes over Gaussian channels with erasures. 1801-1809 - Markku K. Kaikkonen, Petri Rosendahl:
New covering codes from an ADS-like construction. 1809-1812 - Michael Krivelevich, Benny Sudakov, Van H. Vu:
Covering codes with improved density. 1812-1815 - Stéphane Ragot, Minjie Xie, Roch Lefebvre:
Near-ellipsoidal Voronoi coding. 1815-1820 - András György, Tamás Linder:
Codecell convexity in optimal entropy-constrained vector quantization. 1821-1828 - Chi Wan Sung, Kin Kwong Leung:
On the stability of distributed sequence adaptation for cellular asynchronous DS-CDMA systems. 1828-1831 - Xiaoli Ma, Georgios B. Giannakis:
Maximum-diversity transmissions over doubly selective wireless channels. 1832-1840 - Chia-Sheng Chang, Kwang-Cheng Chen:
On continuous-time optimal deterministic traffic regulation. 1840-1845 - Yonina C. Eldar, Alan V. Oppenheim:
MMSE whitening and subspace whitening. 1846-1851 - Dawei Hong, Jean-Camille Birget:
Deviation bounds for wavelet shrinkage. 1851-1858 - Dominik Maria Endres, Johannes E. Schindelin:
A new metric for probability distributions. 1858-1860 - M. C. Pardo, Igor Vajda:
On asymptotic properties of information-theoretic divergences. 1860-1867 - Imre Csiszár:
A first course in information theory [Book Review]. 1869
Volume 49, Number 8, August 2003
- Piyush Gupta, P. R. Kumar:
Towards an information theory of large networks: an achievable rate region. 1877-1894 - Charles H. Bennett, Aram W. Harrow, Debbie W. Leung, John A. Smolin:
On the capacities of bipartite Hamiltonians and unitary gates. 1895-1911 - Pramod Viswanath, David N. C. Tse:
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality. 1912-1921 - Marat V. Burnashev, H. Vincent Poor:
On the probability of error in linear multiuser detection. 1922-1941 - Geert Leus, Shengli Zhou, Georgios B. Giannakis:
Orthogonal multiple access over time- and frequency-selective channels. 1942-1950 - R. Gupta, Alfred O. Hero III:
High-rate vector quantization for detection. 1951-1969 - Damianos G. Karakos, Adrian Papamarcou:
A relationship between quantization and watermarking rates in the presence of additive Gaussian attacks. 1970-1982 - Ertem Tuncel, Kenneth Rose:
Additive successive refinement. 1983-1991 - François Desbouvries:
Non-Euclidean geometrical aspects of the Schur and Levinson-Szego algorithms. 1992-2003 - Anne Canteaut, Pascale Charpin:
Decomposing bent functions. 2004-2019 - Emanuela Fachini, János Körner:
Codes for a long silence. 2020-2023 - Cecilio Pimentel, Bartolomeu F. Uchôa Filho:
A combinatorial approach to finding the capacity of the discrete noiseless channel. 2024-2028 - Joaquim Borges, Kevin T. Phelps, Josep Rifà:
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes. 2028-2034 - Rossitza Dodunekova:
The duals of MMD codes are proper for error detection. 2034-2038 - Michaël Quisquater, Bart Preneel, Joos Vandewalle:
A new inequality in discrete Fourier theory. 2038-2040 - Yupu Hu, Guozhen Xiao:
Resilient functions over finite fields. 2040-2046 - Michael Dewar, Daniel Panario:
Linear transformation shift registers. 2047-2052 - Gwénaelle Castellan:
Density estimation via exponential model selection. 2052-2060 - Marcus Hutter:
Convergence and loss bounds for Bayesian sequence prediction. 2061-2067 - Prashant Koulgi, Shankar L. Regunathan, Kenneth Rose:
Multiple description quantization by deterministic annealing. 2067-2075 - Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf:
Joint message-passing decoding of ldpc codes and partial-response channels. 2076-
Volume 49, Number 9, September 2003
- Ralf Koetter, Alexander Vardy:
The structure of tail-biting trellises: minimality and basic principl. 2081-2105 - Raman Venkataramani, Gerhard Kramer, Vivek K. Goyal:
Multiple description coding with many channels. 2106-2114 - Zsigmond Nagy, Kenneth Zeger:
Asymptotic capacity of two-dimensional channels with checkerboard constraints. 2115-2125 - Taher Abualrub, Robert H. Oehmke:
On the generators of Z4 cyclic codes of length 2e. 2126-2133 - Andrej Stefanov, Tolga M. Duman:
Performance bounds for space-time trellis codes. 2134-2140 - Jilei Hou, Paul H. Siegel, Laurence B. Milstein, Henry D. Pfister:
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes. 2141-2155 - Yonina C. Eldar, Albert M. Chan:
An optimal whitening approach to linear multiuser detection. 2156-2171 - Antonio Napolitano:
Uncertainty in measurements on spectrally correlated stochastic processes. 2172-2191 - X. Rong Li, Yunmin Zhu, Jie Wang, Chongzhao Han:
Optimal linear estimation fusion .I. Unified fusion rules. 2192-2208 - Domingo Ramirez-Alzola:
On the state complexity of hyperelliptic codes. 2209-2213 - Yaron Minsky, Ari Trachtenberg, Richard Zippel:
Set reconciliation with nearly optimal communication complexity. 2213-2218 - Christopher F. Freiling, Douglas S. Jungreis, François Théberge, Kenneth Zeger:
Almost all complete binary prefix codes have a self-synchronizing string. 2219-2225 - Yuko Matsunaga, Hirosuke Yamamoto:
A coding theorem for lossy data compression by LDPC codes. 2225-2229 - David M. Rankin, T. Aaron Gulliver, Desmond P. Taylor:
Asymptotic performance of single parity-check product codes. 2230-2235 - Marten van Dijk, Sebastian Egner, Ravi Motwani, Arie G. C. Koppelaar:
Simultaneous zero-tailing of parallel concatenated codes. 2236-2241 - T. Kiran, B. Sundar Rajan:
Abelian codes over Galois rings closed under certain permutations. 2242-2253 - Alexis Bonnecaze, Anne Desideri Bracco, Steven T. Dougherty, L. R. Nochefranca, Patrick Solé:
Cubic self-dual binary codes. 2253-2258 - Rumen N. Daskalov, Plamen Hristov:
New quasi-twisted degenerate ternary linear codes. 2259-2263 - Wei Xiang, Steven S. Pietrobon:
On the capacity and normalization of ISI channels. 2263-2268 - Robert Schober, Lutz H.-J. Lampe, Wolfgang H. Gerstacker, Subbarayan Pasupathy:
Modulation diversity for frequency-selective fading channels. 2268-2276 - Hesham El Gamal, A. Roger Hammons Jr., Youjian Liu, Michael P. Fitz, Oscar Y. Takeshita:
On the design of space-time and space-frequency codes for MIMO frequency-selective fading channels. 2277-2292 - Mohamed Oussama Damen, Norman C. Beaulieu, Jean-Claude Belfiore:
Bandwidth-efficient linear Modulations for multiple-antenna transmission. 2292-2298 - Christian Schlegel, Alex J. Grant:
Differential space-time turbo codes. 2298-2306 - Shayne Waldron:
Generalized Welch bound equality sequences are tight fram. 2307-2309 - Yonina C. Eldar, Albert M. Chan:
On the asymptotic performance of the decorrelator. 2309-2313 - Amir Leshem, Nicolas Petrochilos, Alle-Jan van der Veen:
Finite sample identifiability of multiple constant modulus source. 2314-2319
Volume 49, Number 10, October 2003
- Bertrand M. Hochwald, Giuseppe Caire, Babak Hassibi, Thomas L. Marzetta:
The academic and industrial embrace of space-time methods. 2329-2331 - Mohammad Jaber Borran, Ashutosh Sabharwal, Behnaam Aazhang:
On design criteria and construction of noncoherent space-time constellations. 2332-2351 - Matthew C. Bromberg:
Optimizing MIMO multipoint wireless networks assuming Gaussian other-user interference. 2352-2362 - Marco Chiani, Moe Z. Win, Alberto Zanella:
On the capacity of spatially correlated MIMO Rayleigh-fading channels. 2363-2371 - Mohamed Oussama Damen, Hesham El Gamal, Norman C. Beaulieu:
Linear threaded algebraic space-time constellations. 2372-2388 - Mohamed Oussama Damen, Hesham El Gamal, Giuseppe Caire:
On maximum-likelihood detection and the search for the closest lattice point. 2389-2402 - Suhas N. Diggavi, Naofal Al-Dhahir, A. Robert Calderbank:
Algebraic properties of space-time block codes in intersymbol interference multiple-access channels. 2403-2414 - J. Nicholas Laneman, Gregory W. Wornell:
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. 2415-2425 - Amos Lapidoth, Stefan M. Moser:
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels. 2426-2467 - Xue-Bin Liang:
Orthogonal designs with maximal rates. 2468-2503 - Ke Liu, Vasanthan Raghavan, Akbar M. Sayeed:
Capacity scaling and spectral efficiency in wide-band correlated MIMO channels. 2504-2526 - Angel Lozano, Antonia M. Tulino, Sergio Verdú:
Multiple-antenna capacity in the low-power regime. 2527-2544 - Aris L. Moustakas, Steven H. Simon, Anirvan M. Sengupta:
MIMO capacity through correlated channels in the presence of correlated interferers and noise: a (not so) large N analysis. 2545-2561 - Krishna Kiran Mukkavilli, Ashutosh Sabharwal, Elza Erkip, Behnaam Aazhang:
On beamforming with finite rate feedback in multiple-antenna systems. 2562-2579 - Wonjong Rhee, John M. Cioffi:
On the capacity of multiuser wireless channels with multiple antennas. 2580-2595 - B. A. Sethuraman, B. Sundar Rajan, Vummintala Shashidhar:
Full-diversity, high-rate space-time block codes from division algebras. 2596-2616 - Shlomo Shamai, Avi Steiner:
A broadcast approach for a single-user slowly fading MIMO channel. 2617-2635 - Hyundong Shin, Jae Hong Lee:
Capacity of multiple-antenna fading channels: spatial fading correlation, double scattering, and keyhole. 2636-2647 - Avi Steiner, Michael Peleg, Shlomo Shamai:
SVD iterative decision feedback demodulation and detection of coded space-time unitary differential modulation. 2648-2657 - Sriram Vishwanath, Nihar Jindal, Andrea J. Goldsmith:
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels. 2658-2668 - Israfil Bahceci, Tolga M. Duman, Yucel Altunbasak:
Antenna selection for multiple-antenna transmission systems: performance analysis and code construction. 2669-2681 - Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer:
On performance limits of space-time codes: a sphere-packing bound approach. 2681-2687 - Alexei Gorokhov, Dhananjay Gore, Arogyaswami Paulraj:
Receive antenna selection for MIMO flat-fading channels: theory and algorithms. 2687-2696 - Sudharman K. Jayaweera, H. Vincent Poor:
Capacity of multiple-antenna systems with both receiver and transmitter channel state information. 2697-2709 - Yibo Jiang, Ralf Koetter, Andrew C. Singer:
On the separability of demodulation and decoding for communications over multiple-antenna block-fading channels. 2709-2712 - Tatsumi Konishi:
Unitary subgroup space-time codes using Bruhat decomposition and Weyl groups. 2713-2716 - Cenk Köse, Richard D. Wesel:
Universal space-time trellis codes. 2717-2727 - Cong Ling, Kwok H. Li, Alex C. Kot:
Noncoherent sequence detection of differential space-time modulatio. 2727-2734 - David James Love, Robert W. Heath Jr., Thomas Strohmer:
Grassmannian beamforming for multiple-input multiple-output wireless systems. 2735-2747 - Hsiao-feng Lu, P. Vijay Kumar:
Rate-diversity tradeoff of space-time codes with fixed alphabet and optimal constructions for PSK modulation. 2747-2751 - Hsiao-feng Lu, Yuankai Wang, P. Vijay Kumar, Keith M. Chugg:
Remarks on space-time codes including a new lower bound and an improved code. 2752-2757 - Paul Lusina, Ernst M. Gabidulin, Martin Bossert:
Maximum rank distance codes as space-time codes. 2757-2760 - Ranjan K. Mallik:
The pseudo-Wishart distribution and its application to MIMO systems. 2761-2769 - Aris L. Moustakas, Steven H. Simon:
Optimizing multiple-input single-output (MISO) communication systems with general Gaussian channels: nontrivial covariance and nonzero mean. 2770-2780 - Peter J. Smith, Sumit Roy, Mansoor Shafi:
Capacity of MIMO systems with semicorrelated flat fading. 2781-2788 - Haiquan Wang, Xiang-Gen Xia:
Upper bounds of rates of complex orthogonal space-time block code. 2788-2796
Volume 49, Number 11, November 2003
- Ralf Koetter, Alexander Vardy:
Algebraic soft-decision decoding of Reed-Solomon codes. 2809-2825 - Venkatesan Guruswami:
List decoding from erasures: bounds and code constructions. 2826-2833 - Joaquim Borges, Kevin T. Phelps, Josep Rifà, Victor A. Zinoviev:
On Z4-linear Preparata-like and Kerdock-like code. 2834-2843 - Neri Merhav, Shlomo Shamai:
On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel. 2844-2855 - Prashant Koulgi, Ertem Tuncel, Shankar L. Regunathan, Kenneth Rose:
On zero-error coding of correlated sources. 2856-2873 - En-Hui Yang, Da-ke He:
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models. 2874-2894 - Nihar Jindal, Andrea J. Goldsmith:
Capacity and optimal power allocation for fading broadcast channels with minimum rates. 2895-2909 - Tryphon T. Georgiou, Anders Lindquist:
Kullback-Leibler approximation of spectral density functions. 2910-2917 - Remco van der Hofstad, Marten J. Klok:
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation. 2918-2940 - Elias Masry:
Deconvolving multivariate kernel density estimates from contaminated associated observations. 2941-2952 - Chan Vee Chong, Raman Venkataramani, Vahid Tarokh:
A new construction of 16-QAM Golay complementary sequences. 2953-2959 - Chieh-Fu Chang, Mark R. Bell:
Frequency-coded waveforms for enhanced delay-Doppler resolution. 2960-2971 - G. Arico, Jos H. Weber:
Limited-trial Chase decoding. 2972-2975 - Victor Yu. Krachkovsky:
Reed-Solomon codes for correcting phased error bursts. 2975-2984 - Xue-Bin Liang, Xiang-Gen Xia:
On the nonexistence of rate-one generalized complex orthogonal designs. 2984-2988 - G. Miller, Gérard D. Cohen:
The rate of regular LDPC codes. 2989-2992 - Frédéric Lehmann, Gian Mario Maggio:
Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation. 2993-3000 - Rumen N. Daskalov, Plamen Hristov:
New binary one-generator quasi-cyclic codes. 3001-3005 - Jean-Claude Carlach, Ayoub Otmani:
A systematic construction of self-dual codes. 3005-3009 - Luo Yuan, Fang-Wei Fu, A. J. Han Vinck, Wende Chen:
On constant-composition codes over Zq. 3010-3016 - Thierry P. Berger:
Isometries for rank distance and permutation group of Gabidulin codes. 3016-3019 - Amir Dembo, Tsachy Weissman:
The minimax distortion redundancy in noisy source coding. 3020-3030 - András György, Tamás Linder, Philip A. Chou, Bradley J. Betts:
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? 3031-3037 - Igor V. Nikiforov:
A lower bound for the detection/isolation delay in a class of sequential tests. 3037-3047 - Nicholas Kolokotronis, Nicholas Kalouptsidis:
On the linear complexity of nonlinearly filtered PN-sequences. 3047-3059 - Sang-Hyo Kim, Jong-Seon No:
New families of binary sequences with low correlation. 3059-3065 - Keqin Feng, Fengmei Liu:
New results on the nonexistence of generalized bent functions. 3066-3071 - Wensong Chu, Solomon W. Golomb:
A new recursive construction for optical orthogonal codes. 3072-3076 - Shraga I. Bross, Shlomo Shamai:
Capacity and decoding rules for the Poisson arbitrarily varying chann. 3076-3093 - William S. Evans, Leonard J. Schulman:
On the maximum tolerable noise of k-input gates for reliable computation by formulas. 3094-3098 - Olivier Alata, Mohamed Najim, Clarisse Ramananjarasoa, Flavius Turcu:
Extension of the Schur-Cohn stability test for 2-D AR quarter-plane model. 3099-3106 - Erdal Panayirci:
Analysis of self-noise in a clock recovery system with a high-order nonlinearity. 3106-3115 - P. R. Kumar:
A correction to the proof of a lemma in "The capacity of wireless networks". 3117
Volume 49, Number 12, December 2003
- Lihua Song, Richard W. Yeung, Ning Cai:
Zero-error network coding for acyclic network. 3129-3139 - Simon Litsyn, Vladimir Shevelev:
Distance distributions in ensembles of irregular low-density parity-check codes. 3140-3159 - Kazukuni Kobara, Hideki Imai:
On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC. 3160-3168 - Yunwei Jia, En-Hui Yang:
Context-dependent multilevel pattern matching for lossless image compression. 3169-3184 - Tsachy Weissman, Neri Merhav:
On competitive prediction and its relation to rate-distortion theory. 3185-3194 - Miroslaw Pawlak, Ewaryst Rafajlowicz, Adam Krzyzak:
Postfiltering versus prefiltering for signal recovery from noisy samples. 3195-3212 - Li Ping, Raymond W. K. Leung, Keying Wu:
Low-rate turbo-Hadamard codes. 3213-3224 - Li Ping, Baoming Bai, Xinmei Wang:
Low-complexity concatenated two-state TCM schemes with near-capacity performance. 3225-3234 - Alfred O. Hero III:
Secure space-time communication. 3235-3249 - Amos Lapidoth, I. Emre Telatar, Rüdiger L. Urbanke:
On wide-band broadcast channels. 3250-3258 - Gábor Simonyi:
On Witsenhausen's zero-error rate for multiple sources. 3258-3260 - T. H. Chan:
Balanced information inequalities. 3261-3267 - Kyeongcheol Yang, Tor Helleseth:
On the minimum distance of array codes as LDPC codes. 3268-3271 - Hans-Dieter Lüke, Hans D. Schotten, Hafez Hadinejad-Mahram:
Binary and quadriphase sequences with optimal autocorrelation properties: a survey. 3271-3282 - Jianqiu Zhang:
Performance analysis for coded CDMA systems. 3282-3288 - Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar:
Reducible rank codes and their applications to cryptography. 3289-3293 - Fang-Wei Fu, San Ling, Chaoping Xing:
New lower bounds and constructions for binary codes correcting asymmetric errors. 3294-3299 - Oscar Moreno, Francis N. Castro:
Divisibility properties for covering radius of certain cyclic codes. 3299-3303 - Emanuel M. Popovici, Patrick Fitzpatrick:
Algorithm and architecture for a Galois field multiplicative arithmetic processor. 3303-3307 - Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann:
Common coordinates in consecutive addresses. 3308-3312 - Kentaro Kato, Osamu Hirota:
Square-root measurement for quantum symmetric mixed state signal. 3312-3317 - Karlheinz Gröchenig, Augustus J. E. M. Janssen, Norbert Kaiblinger, Götz E. Pfander:
Note on B-splines, wavelet scaling functions, and Gabor frames. 3318-3320 - Rémi Gribonval, Morten Nielsen:
Sparse representations in unions of bases. 3320-3325 - Robert E. Byerly, Lance D. Drager, Jeffrey M. Lee:
Observability of permutations, and stream ciphers. 3326-3330 - Mahesh Godavarti, Thomas L. Marzetta, Shlomo Shamai:
Capacity of a mobile multiple-antenna wireless link with isotropically random Ricianfading. 3330-3334 - Defne Aktas, Michael P. Fitz:
Distance spectrum analysis of space-time trellis-coded Modulations in quasi-static Rayleigh-fading channels. 3335-3344 - Mohamed Oussama Damen, Hesham El Gamal, Norman C. Beaulieu:
Systematic construction of full diversity algebraic constellations. 3344-3349
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-25 23:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
