default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 50
Volume 50, Number 1, January 2004
- 2003 IEEE Information Theory Society Paper Award. IEEE Trans. Inf. Theory 50(1): 2 (2004)
- 2003 IEEE Communications Society and Information Theory Society Joint Paper Award. IEEE Trans. Inf. Theory 50(1): 3-4 (2004)
- Neri Merhav, Marcelo J. Weinberger:
On universal simulation of information sources using training data. 5-20 - Neri Merhav:
Achievable key rates for universal simulation of random data with respect to a set of statistical tests. 21-30 - Jing Li, Krishna R. Narayanan, Costas N. Georghiades:
Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity. 31-46 - S. Sandeep Pradhan, Rohit Puri, Kannan Ramchandran:
n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes. 47-61 - Benjamin Farber, Kenneth Zeger:
Quantizers with uniform encoders and channel optimized decoders. 62-77 - Nicholas Pippenger:
Entropy and expected acceptance counts for finite automata. 78-88 - Bernard C. Levy
, Ramine Nikoukhah:
Robust least-squares estimation with a relative entropy constraint. 89-104 - Li Gao, Tan F. Wong:
Power control and spreading sequence allocation in a CDMA forward link. 105-124 - Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang:
Delay-bounded packet scheduling of bursty traffic over wireless channels. 125-144 - Wei Yu, Wonjong Rhee, Stephen P. Boyd, John M. Cioffi:
Iterative water-filling for Gaussian vector multiple-access channels. 145-152 - Giuseppe Caire, Souad Guemghar, Aline Roumy, Sergio Verdú:
Maximizing the spectral efficiency of coded CDMA under successive decoding. 152-164 - Walid Hachem:
Simple polynomial detectors for CDMA downlink transmissions on frequency-selective channels. 164-171 - Mahesh Godavarti, Alfred O. Hero III:
Convergence of differential entropies. 171-176 - Nader Ebrahimi, Ehsan S. Soofi, Hassan Zahedi:
Information properties of order statistics and spacings. 177-183 - Akisato Kimura, Tomohiko Uyematsu:
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. 183-193 - Yun Fan, Ying Gao:
Codes over algebraic integer rings of cyclotomic fields. 194-200 - San Ling, Chaoping Xing:
Polyadic codes revisited. 200-207 - Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin:
An extensive search for good punctured rate-k/(k+1) recursive convolutional codes for serially concatenated convolutional codes. 208-217 - Md. Zafar Ali Khan, B. Sundar Rajan:
A generalization of some existence results on orthogonal designs for STBCs. 218-219 - Marc André Armand:
Multisequence shift register synthesis over commutative rings with identity with applications to decoding cyclic codes over integer residue rings. 220-229 - Andrew Klapper, Claude Carlet:
Spectral methods for cross correlations of geometric sequences. 229-232 - Cihan Tepedelenlioglu:
Maximum multipath diversity with linear equalization in precoded OFDM systems. 232-235
Volume 50, Number 2, February 2004
- Mung Chiang, Stephen P. Boyd:
Geometric programming duals of channel capacity and rate distortion. 245-258 - Margreta Kuijper, Jan Willem Polderman:
Reed-Solomon list decoding from a system-theoretic perspective. 259-271 - Pierre Moulin, Mehmet Kivanç Mihçak:
The parallel-Gaussian watermarking game. 272-289 - Asaf Cohen, Neri Merhav:
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality. 290-310 - Radinka Dontcheva, A. J. van Zanten, Stefan M. Dodunekov:
Binary self-dual codes with automorphisms of composite order. 311-318 - Aram W. Harrow, Hoi-Kwong Lo:
A tight lower bound on the classical communication cost of entanglement dilution. 319-327 - Jean-Pierre Tillich, Gilles Zémor:
The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. 328-331 - Tadashi Wadayama:
An algorithm for calculating the exact bit error probability of a binary linear code over the binary symmetric channel. 331-337 - Matteo Albanese, Arnaldo Spalvieri:
Computing upper bounds to error probability of soft-decision decoding of Reed-Solomon codes based on the ordered statistics algorithm. 337-344 - Akiomi Kunisa:
Symbol error probability for guided scrambling over a recording channel. 344-349 - Jørn Justesen:
Upper bounds on the number of errors corrected by a convolutional code. 350-353 - Wende Chen, Torleiv Kløve:
On the second greedy weight for linear codes of dimension at least 4. 354-356 - Koichi Betsumiya, Masaaki Harada:
Optimal self-dual codes over F2*F2 with respect to the Hamming weight. 356-358 - T. Aaron Gulliver, Jon-Lark Kim:
Circulant based extremal additive self-dual codes over GF(4). 359-366 - T. Kiran, B. Sundar Rajan:
Consta-Abelian codes over Galois rings. 367-380 - Ralph Jordan, Rolf Johannesson, Martin Bossert:
On nested convolutional codes and their application to woven codes. 380-384 - Yan Xin, Ivan J. Fair:
A performance metric for codes with a high-order spectral at zero frequency. 385-394 - Gilles Van Assche, Jean Cardinal, Nicolas J. Cerf:
Reconciliation of a quantum-distributed Gaussian key. 394-400 - Vladislav B. Tadic:
On the almost sure rate of convergence of linear stochastic approximation algorithms. 401-409
Volume 50, Number 3, March 2004
- Amir Bennatan, David Burshtein:
On the application of LDPC codes to arbitrary discrete-memoryless channels. 417-438 - Hossein Pishro-Nik, Faramarz Fekri:
On decoding of low-density parity-check codes over the binary erasure channel. 439-454 - Fred Daneshgaran, Paolo Mulassano:
Interleaver pruning for construction of variable-length turbo codes. 455-467 - Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara:
New covering radius of Reed-Muller codes for t-resilient functions. 468-475 - Harm Derksen:
Error-correcting codes and Bh-sequences. 476-485 - Genyuan Wang, Xiang-Gen Xia:
An orthogonal space-time coded CPM system with fast decoding for two transmit antennas. 486-493 - Birsen Yazici:
Stochastic deconvolution over groups. 494-510 - Anelia Somekh-Baruch, Neri Merhav:
On the capacity game of public watermarking systems. 511-524 - David Malone, Wayne G. Sullivan:
Guesswork and entropy. 525-526 - Kyeongcheol Yang:
Weighted nonbinary repeat-accumulate codes. 527-531 - Andrew Klapper:
Improved multicovering bounds from linear inequalities and supercodes. 532-536 - Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco:
Linear codes with covering radius 2, 3 and saturating sets in projective geometry. 537-541 - Chaoping Xing:
Linear codes from narrow ray class groups of algebraic curves. 541-543 - Stefka Bouyuklieva:
On the automorphism group of a doubly-even (72, 36, 16) code. 544-547 - Lin Xiaoyan:
Quantum cyclic and constacyclic codes. 547-549 - Kenneth G. Paterson:
On codes with low peak-to-average power ratio for multicode CDMA. 550-559 - Hideyuki Torii, Makoto Nakamura, Naoki Suehiro:
A new class of zero-correlation zone sequences. 559-565 - Yaron Shany, Ilan Reuven, Yair Be'ery:
Lower bounds on the state complexity of linear tail-biting trellises. 566-571 - Petre Stoica, Jianhua Liu, Jian Li:
Maximum-likelihood double differential detection clarified. 572-576 - Gérard Biau, Luc Devroye:
A note on density model size testing. 576-581 - Gerhard Kramer:
Outer bounds on the capacity of Gaussian interference channels. 581-586
Volume 50, Number 4, April 2004
- Jared Welz, Ian Galton:
A tight signal-band power bound on mismatch noise in a mismatch-shaping digital-to-analog converter. 593-607 - Giuseppe Caire, Daniela Tuninetti, Sergio Verdú:
Suboptimality of TDMA in the low-power regime. 608-620 - Wen Xu, Arthur B. Baggeroer, Kristine L. Bell:
A bound on mean-square estimation error with background parameter mismatch. 621-632 - Ferdinando Cicalese, Ugo Vaccaro:
Bounding the average length of optimal source codes via majorization theory. 633-637 - S. Prasad, Nicolas C. Menicucci:
Fisher information with respect to cumulants. 638-642 - Lars K. Rasmussen, Alex J. Grant, Paul D. Alexander:
An extrinsic Kalman filter for iterative multiuser decoding. 642-648 - Fang-Wei Fu, A. J. Han Vinck, Victor K. Wei, Raymond W. Yeung:
On the capacity of write-unidirectional memories with nonperiodic codes. 649-656 - Zhengdao Wang, Georgios B. Giannakis:
Outage mutual information of space-time MIMO channels. 657-662 - Fady Alajaji, Po-Ning Chen, Ziad Rached:
Csiszár's cutoff rates for the general hypothesis testing problem. 663-678 - Ruud Pellikaan, Xin-Wen Wu:
List decoding of q-ary Reed-Muller codes. 679-682 - Marc André Armand:
Generalized rational interpolation over commutative rings and remainder decoding. 683-690 - Bikash Kumar Dey, B. Sundar Rajan:
Affine invariant extended cyclic codes over Galois rings. 691-698 - Yaron Shany, Yair Be'ery:
A note on nonlinear Xing codes. 699-700 - Edgar Martínez-Moro:
A generalization of Niederreiter-Xing's propagation rule and its commutativity with duality. 701-702 - Eva Bayer-Flückiger, Frédérique E. Oggier, Emanuele Viterbo:
New algebraic constructions of rotated Zn-lattice constellations for the Rayleigh fading channel. 702-714 - Yupu Hu, Guozhen Xiao:
Generalized self-shrinking generator. 714-719
Volume 50, Number 5, May 2004
- J. I. Concha, H. Vincent Poor:
Multiaccess quantum channels. 725-747 - Liang-Liang Xie, Panganamala R. Kumar:
A network information theory for wireless communication: scaling laws and optimal operation. 748-767 - Nihar Jindal, Sriram Vishwanath, Andrea J. Goldsmith:
On the duality of Gaussian multiple-access and broadcast channels. 768-783 - Steve Hranilovic, Frank R. Kschischang:
Capacity bounds for power- and band-limited optical intensity channels corrupted by Gaussian noise. 784-795 - Antoine Valembois, Marc P. C. Fossorier:
Box and match techniques applied to soft-decision decoding. 796-810 - Ilya Dumer:
Recursive decoding and its performance for low-rate Reed-Muller codes. 811-823 - Shirley Halevy, Jiangxin Chen, Ron M. Roth, Paul H. Siegel, Jack K. Wolf:
Improved bit-stuffing bounds on two-dimensional constraints. 824-838 - C. Sinan Güntürk, Nguyen T. Thao:
Refined error analysis in second-order Sigma-Delta modulation with constant inputs. 839-860 - Khaled A. S. Abdel-Ghaffar:
A simple derivation of the undetected error probabilities of complementary codes. 861-862 - Hans Georg Schaathun:
Duality and support weight distributions. 862-867 - Alexandre Graell i Amat, Guido Montorsi, Sergio Benedetto:
Design and decoding of optimal high-rate convolutional codes. 867-881 - Fang-Wei Fu, Torleiv Kløve:
Two constructions of permutation arrays. 881-883 - Chaoping Xing, Yang Fang:
A class of polynomial codes. 884-887 - Jürgen Häring, Adrianus J. Han Vinck:
Coding and signal space diversity for a class of fading and impulsive noise channels. 887-895 - Masoud Sharif, Babak Hassibi:
On multicarrier signals where the PMEPR of a random codeword is asymptotically logn. 895-903 - Sennur Ulukus, Roy D. Yates:
User capacity of asynchronous CDMA systems with matched filter receivers and optimum signature sequences. 903-909 - François Arnault, Thierry P. Berger, Abdelkader Necer:
Feedback with carry shift registers synthesis with the Euclidean algorithm. 910-917 - Ziad Rached, Fady Alajaji, L. Lorne Campbell:
The Kullback-Leibler divergence rate between Markov sources. 917-921 - Imre Csiszár, Frantisek Matús:
On information closures of exponential families: a counterexample. 922-924 - Joe Suzuki, Boris Ryabko:
Coding combinatorial sources with costs. 925-928 - Dror Baron, Yoram Bresler:
An O(N) semipredictive universal encoder via the BWT. 928-937 - Sangsin Na:
On the support of fixed-rate minimum mean-squared error scalar quantizers for a Laplacian source. 937-944
Volume 50, Number 6, June 2004
- Ertem Tuncel, Prashant Koulgi, Kenneth Rose:
Rate-Distortion Approach to Databases: Storage and Content-Based Retrieval. 953-967 - Hesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen:
Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels. 968-985 - Linbo Li, Antonia M. Tulino, Sergio Verdú:
Design of Reduced-Rank MMSE Multiuser Detectors Using Random Matrix Methods. 986-1008 - Narayan Prasad, Mahesh K. Varanasi:
Analysis of Decision Feedback Detection for MIMO Rayleigh-Fading Channels and the Optimization of Power and Rate Allocations. 1009-1025 - Yun Li, Anthony Ephremides:
Linear Multiuser Detectors for Incompletely Known Symmetric Signals in CDMA Systems. 1026-1040 - Sanjeev R. Kulkarni, Pramod Viswanath:
A Deterministic Approach to Throughput Scaling in Wireless Networks. 1041-1049 - Sanjay Shakkottai, R. Srikant:
Mean FDE Models for Internet Congestion Control Under a Many-Flows Regime. 1050-1072 - Boris Tsybakov:
Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception. 1073-1085 - Wei Biao Wu, George Michailidis, Danlu Zhang:
Simulating Sample Paths of Linear Fractional Stable Motion. 1086-1096 - Shiro Ikeda, Toshiyuki Tanaka, Shun-ichi Amari:
Information Geometry of Turbo and Low-Density Parity-Check Codes. 1097-1114 - David Burshtein, Gadi Miller:
Asymptotic Enumeration Methods for Analyzing LDPC Codes. 1115-1131 - Payam Pakzad, Venkat Anantharam:
A New Look at the Generalized Distributive Law. 1132-1155 - Bane Vasic, Olgica Milenkovic:
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding. 1156-1176 - Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin:
Interleaver Design for Serially Concatenated Convolutional Codes: Theory and Application. 1177-1188 - Andrew M. Childs, Debbie W. Leung, Guifre Vidal:
Reversible Simulation of Bipartite Product Hamiltonians. 1189-1197 - Yonina C. Eldar, Alexandre Megretski, George C. Verghese:
Optimal Detection of Symmetric Mixed Quantum States. 1198-1207 - Rudolf Ahlswede, Ning Cai:
On Lossless Quantum Data Compression With a Classical Helper. 1208-1219 - Murali Rao, Yunmei Chen, Baba C. Vemuri, Fei Wang:
Cumulative Residual Entropy: A New Measure of Information. 1220-1228 - Tsachy Weissman:
Universally Attainable Error Exponents for Rate-Distortion Coding of Noisy Sources. 1229-1246 - Igal Sason, Rüdiger L. Urbanke:
Complexity Versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary Erasure Channel. 1247-1256 - Bassem Ammar, Bahram Honary, Yu Kou, Jun Xu, Shu Lin:
Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs. 1257-1268 - Heng Tang, Jun Xu, Yu Kou, Shu Lin, Khaled A. S. Abdel-Ghaffar:
On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes. 1269-1279 - Sarah Spence Adams:
Identifying High-Dimension Subspace Subcodes of Reed-Solomon Codes. 1280-1282 - Maria Bras-Amorós:
Acute Semigroups, the Order Bound on the Minimum Distance, and the Feng-Rao Improvements. 1282-1289 - Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling:
Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares. 1289-1291 - Gérard D. Cohen, Hans Georg Schaathun:
Upper Bounds on Separating Codes. 1291-1295 - Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov:
A BEAST for Prowling in Trees. 1295-1302 - Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders. 1303-1311 - Marco Chiani, Andrea Conti, Velio Tralli:
Further Results on Convolutional Code Search for Block-Fading Channels. 1312-1318 - Wanlun Zhao, Geert Leus, Georgios B. Giannakis:
Orthogonal Design of Unitary Constellations for Uncoded and Trellis-Coded Noncoherent Space-Time Systems. 1319-1327 - Navin Kashyap, Paul H. Siegel:
Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. 1327-1331 - Ruihu Li, Xueliang Li:
Binary Construction of Quantum Codes of Minimum Distance Three and Four. 1331-1336 - Bernard C. Picinbono:
Time Intervals and Counting in Point Processes. 1336-1340 - Jean-Jacques Fuchs:
On Sparse Representations in Arbitrary Redundant Bases. 1341-1344 - Igal Sason:
On Achievable Rate Regions for the Gaussian Interference Channel. 1345-1356 - Nadav Shulman, Meir Feder:
The Uniform Distribution as a Universal Prior. 1356-1362 - Ram Zamir, Uri Erez:
A Gaussian Input Is Not Too Bad. 1362-1367 - Tomohiro Ogawa, Masahito Hayashi:
On Error Exponents in Quantum Hypothesis Testing. 1368-1372 - Gerhard Kramer:
Correction to "Feedback Strategies for White Gaussian Interference Networks, " and a Capacity Theorem for Gaussian Interference Channels With Feedback. 1373-1374 - Carles Padró, Germán Sáez:
Correction to "Secret Sharing Schemes With Bipartite Access Structure". 1373- - Chan Vee Chong, Raman Venkataramani, Vahid Tarokh:
Correction to "A New Construction of 16-QAM Golay Complementary Sequences". 1374-
Volume 50, Number 7, July 2004
- John C. Kieffer, Wojciech Szpankowski, En-Hui Yang:
Problems on Sequences: Information Theory and Computer Science Interface. 1385-1392 - Philippe Jacquet, Wojciech Szpankowski:
Markov types and minimax redundancy for Markov sources. 1393-1402 - Brian Conrad, Michael Mitzenmacher:
Power laws for monkeys typing randomly: the case of unequal probabilities. 1403-1414 - John C. Kieffer, En-Hui Yang:
Grammar-based lossless universal refinement source coding. 1415-1424 - Serap A. Savari:
Compression of words over a partially commutative alphabet. 1425-1441 - Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger:
Linear time universal coding and time reversal of tree sources via FSM closure. 1442-1468 - Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Universal compression of memoryless sources over unknown alphabets. 1469-1481 - Nuno Vasconcelos:
On the efficient evaluation of probabilistic similarity functions for image retrieval. 1482-1496 - Andrew B. Nobel:
Some stochastic properties of memoryless individual sequences. 1497-1505 - Eado Meron, Meir Feder:
Finite-memory universal prediction of individual sequences. 1506-1523 - Da-ke He, En-Hui Yang:
Performance analysis of grammar-based codes revisited. 1524-1535 - Michael Mitzenmacher:
On the hardness of finding optimal multiple preset dictionaries. 1536-1539 - Xiaolin Wu, Sorina Dumitrescu, Zhe Wang:
Monotonicity-based fast algorithms for MAP estimation of Markov sequences over noisy channels. 1539-1544 - Xin Chen, Brent Francia, Ming Li, Brian McKinnon, Amit Seker:
Shared information and program plagiarism detection. 1545-1551 - Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú:
Universal entropy estimation via block sorting. 1551-1561
Volume 50, Number 8, August 2004
- Vyacheslav V. Prelov, Sergio Verdú:
Second-Order Asymptotics of Mutual Information. 1567-1580 - Oliver Johnson:
A Conditional Entropy Power Inequality for Dependent Variables. 1581-1583 - Michael Fleming, Qian Zhao, Michelle Effros:
Network Vector Quantization. 1584-1604 - Michelle Effros, Hanying Feng, Kenneth Zeger:
Suboptimality of the Karhunen-Loève Transform for Transform Coding. 1605-1619 - Gil I. Shamir, Daniel J. Costello Jr.:
Universal Lossless Coding for Sources With Repeating Statistics. 1620-1635 - Yossef Steinberg, Neri Merhav:
On Successive Refinement for the Wyner-Ziv Problem. 1636-1654 - Tao Jiang, Alexander Vardy:
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes. 1655-1664 - Hanan Weingarten, Yossef Steinberg, Shlomo Shamai (Shitz):
Gaussian Codes and Weighted Nearest Neighbor Decoding in Fading Multiple-Antenna Channels. 1665-1686 - M. Braun:
Construction of Linear Codes With Large Minimum Distance. 1687-1691 - Marco Breiling:
A Logarithmic Upper Bound on the Minimum Distance of Turbo Codes. 1692-1710 - Aline Roumy, Souad Guemghar, Giuseppe Caire, Sergio Verdú:
Design Methods for Irregular Repeat-Accumulate Codes. 1711-1727 - Hai Quang Dinh, Sergio R. López-Permouth:
Cyclic and Negacyclic Codes Over Finite Chain Rings. 1728-1744 - Gérald E. Séguin:
A Class of 1-Generator Quasi-Cyclic Codes. 1745-1753 - Raman Venkataramani, Yoram Bresler:
Multiple-Input Multiple-Output Sampling: Necessary Density Conditions. 1754-1768 - Ralf R. Müller, Wolfgang H. Gerstacker:
On the Capacity Loss Due to Separation of Detection and Decoding. 1769-1778 - Shunlong Luo, Qiang Zhang:
On Skew Information. 1778-1782 - Hiroki Suyari:
Generalization of Shannon-Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy. 1783-1787 - Marc P. C. Fossorier:
Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices. 1788-1793 - Bikash Kumar Dey:
On Existence of Good Self-Dual Quasi-Cyclic Codes. 1794-1798 - Conchita Martínez-Pérez, Wolfgang Willems:
Self-Dual Codes and Modules for Finite Groups in Characteristic Two. 1798-1803 - Andrew Mertz:
On the Complexity of Multicovering Radii. 1804-1808 - Marc Handlery, Rolf Johannesson, Victor V. Zyablov:
On Error Exponents for Woven Convolutional Codes With One Tailbiting Component Code. 1809-1811 - Alexei E. Ashikhmin, Simon Litsyn:
Simple MAP Decoding of First-Order Reed-Muller and Hamming Codes. 1812-1818 - Mark G. Karpovsky, Alexander Taubin:
New Class of Nonlinear Systematic Error Detecting Codes. 1818-1820 - Hicham Bouzekri, Scott L. Miller:
Distance Spectra and Performance Bounds of Space-Time Trellis Codes Over Quasi-Static Fading Channels. 1820-1839 - Weifeng Su, Zoltan Safar, K. J. Ray Liu:
Diversity Analysis of Space-Time Modulation Over Time-Correlated Rayleigh-Fading Channels. 1832-1839 - Ji-Woong Jang, Young-Sik Kim, Jong-Seon No, Tor Helleseth:
New Family of p-ary Sequences With Optimal Correlation Property and Large Linear Span. 1839-1844 - Patrick Solé, Dmitrii Zinoviev:
The Most Significant Bit of Maximum-Length Sequences Over BBZ2l: Autocorrelation and Imbalance. 1844-1846 - James B. Shearer:
Symmetric Golomb Squares. 1846-1847 - Siu Lun Ma, Yanxun Chang:
A New Class of Optimal Optical Orthogonal Codes With Weight Five. 1848-1850 - Jacob Ziv:
Correction to: "An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data". 1851-1852
Volume 50, Number 9, September 2004
- David N. C. Tse, Pramod Viswanath, Lizhong Zheng:
Diversity-Multiplexing Tradeoff in Multiple-Access Channels. 1859-1874 - Wei Yu, John M. Cioffi:
Sum Capacity of Gaussian Vector Broadcast Channels. 1875-1892 - Bertrand M. Hochwald, Thomas L. Marzetta, Vahid Tarokh:
Multiple-Antenna Channel Hardening and Its Implications for Rate Feedback and Scheduling. 1893-1909 - Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer, J. M. Landsberg:
On Space-Time Coding in the Presence of Spatio-Temporal Correlation. 1910-1926 - Vikram Krishnamurthy, X. Wang, Gang George Yin:
Spreading Code Optimization and Adaptation in CDMA Via Discrete Stochastic Approximation. 1927-1949 - Giuseppe Caire, Ralf R. Müller, Toshiyuki Tanaka:
Iterative Multiuser Joint Decoding: Optimal Power Allocation and Low-Complexity Implementation. 1950-1973 - Deepak Das, Mahesh K. Varanasi:
Optimum Noncoherent Multiuser Decision Feedback Detection. 1974-1988 - John L. Fan, Tze-Lei Poo, Brian H. Marcus:
Constraint Gain. 1989-2001 - Alberto Tarable, Sergio Benedetto, Guido Montorsi:
Mapping Interleaving Laws to Parallel Turbo and LDPC Decoder Architectures. 2002-2009 - Louay Bazzi, Thomas J. Richardson, Rüdiger L. Urbanke:
Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A. 2010-2021 - Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
Low State Complexity Block Codes Via Convolutional Codes. 2022-2030 - Oded Regev:
Improved Inapproximability of Lattice and Coding Problems With Preprocessing. 2031-2037 - Vincent K. N. Lau, Youjian Liu, Tai-Ann Chen:
Capacity of Memoryless Channels and Block-Fading Channels With Designable Cardinality-Constrained Channel State Feedback. 2038-2049 - Nicolò Cesa-Bianchi, Alex Conconi, Claudio Gentile:
On the Generalization Ability of On-Line Learning Algorithms. 2050-2057 - Pranav Dayal, Matthias Brehler, Mahesh K. Varanasi:
Leveraging Coherent Space-Time Codes for Noncoherent Communication Via Training. 2058-2080 - Peter Hall, Jiying Yin:
Nonuniform Sequential Sampling for Signal Analysis. 2081-2088 - Chao Tian, Sheila S. Hemami:
Universal Multiple Description Scalar Quantization: Analysis and Design. 2089-2102 - Farshad Lahouti, Amir K. Khandani:
Efficient Source Decoding Over Memoryless Noisy Channels Using Higher Order Markov Models. 2103-2118 - Akshay Kashyap, Tamer Basar, R. Srikant:
Correlated Jamming on MIMO Gaussian Fading Channels. 2119-2123 - Chaitanya Rao, Babak Hassibi:
Analysis of Multiple-Antenna Wireless Links at Low SNR. 2123-2130 - Xiang Nian Zeng, Ali Ghrayeb:
Performance Bounds for Space-Time Block Codes With Receive Antenna Selection. 2130-2137 - Shuichi Ohno, Georgios B. Giannakis:
Capacity Maximizing MMSE-Optimal Pilots for Wireless OFDM Over Frequency-Selective Block Rayleigh-Fading Channels. 2138-2145 - Peter Harremoës, P. S. Ruzankin:
Rate of Convergence to Poisson Law in Terms of Information Divergence. 2145-2149 - Daiyuan Peng, Pingzhi Fan:
Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences. 2149-2154 - Tor Helleseth, José Felipe Voloch:
Double Circulant Quadratic Residue Codes. 2154-2155 - Tuvi Etzion, Moshe Schwartz:
Perfect Constant-Weight Codes. 2156-2165 - Nimalsiri Pinnawala, Asha Rao:
Cocyclic Simplex Codes of Type alpha Over mmb Z4 and mmb Z2s. 2165-2169 - Hiren Maharaj:
Code Construction on Fiber Products of Kummer Covers. 2169-2173 - T. Nishimura:
A New Extremal Self-Dual Code of Length 64. 2173-2174 - Harald Niederreiter, Chaoping Xing:
Disjoint Linear Codes From Algebraic Function Fields. 2174-2177 - Claude Carlet:
On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions. 2178-2185 - Palash Sarkar, Subhamoy Maitra:
Construction of Nonlinear Resilient Boolean Functions Using "Small" Affine Functions. 2185-2193 - Lei Zhang, Paul Bao, Xiaolin Wu:
Wavelet Estimation of Fractional Brownian Motion Embedded in a Noisy Environment. 2194-2200 - Liam Paninski:
Estimating Entropy on m Bins Given Fewer than m Samples. 2200-2203 - Erratum to "Universal Entropy Estimation Via Block Sorting". IEEE Trans. Inf. Theory 50(9): 2204- (2004)
Volume 50, Number 10, October 2004
- Alon Orlitsky, Narayana P. Santhanam:
Speaking of infinity [i.i.d. strings]. 2215-2230 - Joel A. Tropp:
Greed is good: algorithmic results for sparse approximation. 2231-2242 - Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Linearity and solvability in multicast networks. 2243-2256 - Michael Katz, Shlomo Shamai:
On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels. 2257-2270 - Giuseppe Caire, Daniela Tuninetti, Sergio Verdú:
Variable-rate coding for slowly fading Gaussian multiple-access channels. 2271-2292 - Uri Erez, Ram Zamir:
Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding. 2293-2314 - David J. C. MacKay, G. Mitchison, P. L. McFadden:
Sparse-graph codes for quantum error correction. 2315-2330 - Weifeng Su, Xiang-Gen Xia:
Signal constellations for quasi-orthogonal space-time block codes with full diversity. 2331-2347 - Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
On coverings of ellipsoids in Euclidean spaces. 2348-2356 - Sergey Yekhanin, Ilya Dumer:
Long nonbinary codes exceeding the Gilbert-Varshamov bound for any fixed distance. 2357-2362 - Sueli I. Rodrigues Costa, M. Muniz, Edson Agustini, Reginaldo Palazzo Júnior:
Graphs, tessellations, and perfect codes on flat tori. 2363-2377 - Jon-Lark Kim, Uri N. Peled, I. Perepelitsa, Vera Pless, Shmuel Friedland:
Explicit construction of families of LDPC codes with no 4-cycles. 2378-2388 - Zhengyuan Xu, Xiaodong Wang:
Large-sample performance of blind and Group-blind multiuser detectors: a perturbation perspective. 2389-2401 - Wensong Chu, Charles J. Colbourn:
Sequence designs for ultra-wideband impulse radio with optimal correlation properties. 2402-2407 - Ryoh Fuji-Hara, Ying Miao, Miwako Mishima:
Optimal frequency hopping sequences: a combinatorial approach. 2408-2420 - Cunsheng Ding, Harald Niederreiter:
Systematic authentication codes from highly nonlinear functions. 2421-2428 - Garry Bowen:
Quantum feedback channels. 2429-2434 - Otilia Popescu, Christopher Rose:
Sum capacity and TSC bounds in collaborative multibase wireless systems. 2433-2440 - Yu-Chang Eun, Seok-Yong Jin, Yun-Pyo Hong, Hong-Yeop Song:
Frequency hopping sequences with optimal partial autocorrelation properties. 2438-2442 - Xuan Yong Zhu, Wen Feng Qi:
Compression mappings on primitive sequences over Z/(pe). 2442-2448 - Onur Kaya, Sennur Ulukus:
Optimum power control for CDMA with deterministic sequences in fading channels. 2449-2462 - Chao Tian, Sheila S. Hemami:
Optimality and suboptimality of multiple-description vector quantization with a lattice codebook. 2458-2470 - Tor Helleseth, Martijn Maas, John Erik Mathiassen, Toon Segers:
Linear complexity over Fp of Sidel'nikov sequences. 2468-2472 - George Jöngren, Mikael Skoglund:
Quantized feedback information in orthogonal space-time block coding. 2473-2486 - Ohad Barak, David Burshtein, Meir Feder:
Bounds on achievable rates of LDPC codes used over the binary erasure channel. 2483-2492 - Keying Wu, Li Ping, Xiaoling Huang, Nam Phamdo:
Performance analysis of turbo-SPC codes. 2490-2496 - Emin Martinian, Carl-Erik W. Sundberg:
Burst erasure correction codes with low decoding delay. 2494-2502 - Alexander Barg:
Improved error bounds for the erasure/list scheme: the binary and spherical cases. 2503-2514 - Ralph Jordan, Victor A. Pavlushkov, Victor V. Zyablov:
Maximum slope convolutional codes. 2511-2526 - Ralph Jordan, Stefan Höst, Rolf Johannesson, Martin Bossert, Victor V. Zyablov:
Woven convolutional codes. II: decoding aspects. 2522-2531 - San Ling, Ferruh Özbudak:
An improvement on the bounds of Weil exponential sums over Galois rings with some applications. 2529-2543 - Kwankyu Lee:
New distance-preserving maps of odd length. 2539-2543
Volume 50, Number 11, November 2004
- Aleksandar Jovicic, Pramod Viswanath, Sanjeev R. Kulkarni:
Upper bounds to transport capacity of wireless networks. 2555-2565 - Vagelis Tsibonis, Leonidas Georgiadis, Leandros Tassiulas:
Exploiting wireless channel State information for throughput maximization. 2566-2582 - Ke Liu, Tamer Kadous, Akbar M. Sayeed:
Orthogonal time-frequency signaling over doubly dispersive channels. 2583-2603 - Tommy Guess:
CDMA with power control and sequence design: the capacity region with and without multidimensional signaling. 2604-2619 - Jean-Marie Chaufray, Walid Hachem, Philippe Loubaton:
Asymptotic analysis of optimum and suboptimum CDMA downlink MMSE receivers. 2620-2638 - Yindi Jing, Babak Hassibi:
Design of fully diverse multiple-antenna codes based on Sp(2). 2639-2656 - Alexei E. Ashikhmin, Gerhard Kramer, Stephan ten Brink:
Extrinsic information transfer functions: model and erasure channel properties. 2657-2673 - James A. Bucklew, S. Nitinawarat, J. Wierer:
Universal simulation distributions. 2674-2685 - Michael Drmota, Wojciech Szpankowski:
Precise minimax redundancy and regret. 2686-2707 - Feng Liang, Andrew R. Barron:
Exact minimax strategies for predictive density estimation, data compression, and model selection. 2708-2726 - Hayato Takahashi:
Redundancy of universal coding, Kolmogorov complexity, and Hausdorff dimension. 2727-2736 - József Balogh, János A. Csirik:
Index assignment for two-channel quantization. 2737-2751 - Kaoru Kurosawa, Ryutaroh Matsumoto:
Almost security of cryptographic Boolean functions. 2752-2761 - Michael Gastpar:
The Wyner-Ziv Problem With Multiple Sources. 2762-2768 - Ashot N. Harutyunyan, Evgueni A. Haroutunian:
On Properties of Rate-Reliability-Distortion Functions. 2768-2773 - Aslan Tchamkerten:
On the Discreteness of Capacity-Achieving Distributions. 2773-2778 - Mohammad Rezaeian, Alex J. Grant:
Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels. 2779-2784 - Yingwei Yao, H. Vincent Poor, Feng-Wen Sun:
User Capacity for Synchronous Multirate CDMA Systems With Linear MMSE Receivers. 2785-2793 - C. E. Pfister, W. G. Sullivan:
Rényi Entropy, Guesswork Moments, and Large Deviations. 2794-2800 - Eirik Rosnes, Øyvind Ytrehus:
Sphere-Packing Bounds for Convolutional Codes. 2801-2809 - Shahram Yousefi, Amir K. Khandani:
Generalized Tangential Sphere Bound on the MLDecoding Error Probability of Linear Binary Block Codes in AWGN Interference. 2810-2815 - Sergey Yekhanin:
Improved Upper Bound for the Redundancy of Fix-Free Codes. 2815-2818 - Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction. 2818-2823 - Jeongseok Ha, Jaehong Kim, Steven W. McLaughlin:
Rate-Compatible Puncturing of Low-Density Parity-Check Codes. 2824-2836 - David Burshtein, Gadi Miller:
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel. 2837-2844 - Yaron Shany:
Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound. 2844-2850 - Jian Ren:
On the Structure of Hermitian Codes and Decoding for Burst Errors. 2850-2854 - Zoltan Safar, K. J. Ray Liu:
Systematic Space?Time Trellis Code Construction for Correlated Rayleigh-Fading Channels. 2855-2865 - Myung-Kwang Byun, Daeyoung Park, Byeong Gi Lee:
On the Performance Analysis of Space-Time Codes in Quasi-Static Rayleigh-Fading Channels. 2865-2873 - John A. Gubner, Louis L. Scharf:
Detection of Constrained Subspace Signals in Additive Infinite-Dimensional Interference and Noise. 2873-2879 - Claude Carlet, Hans Dobbertin, Gregor Leander:
Normal Extensions of Bent Functions. 2880-2885 - Kishan Chand Gupta, Palash Sarkar:
Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. 2886-2893 - Ilan Hen, Neri Merhav:
On the Threshold Effect in the Estimation of Chaotic Sequences. 2894-2904 - Liping Wang, Yue-fei Zhu, Ding-Yi Pei:
On the Lattice Basis Reduction Multisequence Synthesis Algorithm. 2905-2910 - Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences. 2911-2915 - Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr.:
Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences. 2916-2921 - Dejan V. Djonin, Vijay K. Bhargava:
Comments on 'Symmetric Capacity and Signal Design for L-out-of-K Symbol-Synchronous CDMA Gaussian Channels'. 2921-2923 - Erdal Arikan:
Correction to 'On the Reliability Exponent of the Exponential Server Timing Channel'. 2924
Volume 50, Number 12, December 2004
- G. David Forney Jr., Mitchell D. Trott:
The dynamics of group codes: Dual abelian group codes and systems. 2935-2965 - Robert Michael Tanner, Deepak Sridhara, Arvind Sridharan, Thomas E. Fuja, Daniel J. Costello Jr.:
LDPC block and convolutional codes based on circulant matrices. 2966-2984 - Alberto Perotti, Sergio Benedetto:
A new upper bound on the minimum distance of turbo codes. 2985-2997 - Antoine Valembois, Marc P. C. Fossorier:
Sphere-packing bounds revisited for moderate block lengths. 2998-3014 - Amnon Ta-Shma, David Zuckerman:
Extractor codes. 3015-3025 - Shahram Yousefi, Amir K. Khandani:
A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference. 3026-3036 - Alex Reznik, Sanjeev R. Kulkarni, Sergio Verdú:
Degraded Gaussian multirelay channel: capacity and optimal power allocation. 3037-3046 - Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiple terminals. 3047-3061 - J. Nicholas Laneman, David N. C. Tse, Gregory W. Wornell:
Cooperative diversity in wireless networks: Efficient protocols and outage behavior. 3062-3080 - Elif Uysal-Biyikoglu, Abbas El Gamal:
On adaptive transmission for energy efficiency in wireless data networks. 3081-3094 - Yingbin Liang, Venugopal V. Veeravalli:
Capacity of noncoherent time-selective Rayleigh-fading channels. 3095-3110 - Gwen Barriac, Upamanyu Madhow:
Space-time communication for OFDM with implicit channel feedback. 3111-3129 - Michelle Effros, Diego Dugatkin:
Multiresolution vector quantization. 3130-3145 - Zsigmond Nagy, Kenneth Zeger:
Bit-stuffing algorithms and analysis for run-length constrained channels in two and three dimensions. 3146-3169 - Erik Agrell, Johan Lassing, Erik G. Ström, Tony Ottosson:
On the optimality of the binary reflected Gray code. 3170-3182 - Igor Devetak, Andreas J. Winter:
Distilling common randomness from bipartite quantum states. 3183-3196 - Saswati Sarkar:
Optimum scheduling and memory management in input queued switches with finite buffer space. 3197-3220 - Cheng-Shang Chang, Duan-Shin Lee, Chao-Kai Tu:
Recursive construction of FIFO optical multiplexers with switched delay lines. 3221-3233 - Peter B. Borwein, Kwok-Kwong Stephen Choi, Jonathan Jedwab:
Binary sequences with merit factor greater than 6.34. 3234-3249 - Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. 3250-3264 - Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Kolmogorov's structure functions and model selection. 3265-3290 - Fred Daneshgaran, Marina Mondin, Paolo Mulassano:
Linear subcodes of turbo codes with improved distance spectra. 3291-3294 - Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd:
Near-optimal depth-constrained codes. 3294-3298 - Gretchen L. Matthews:
Codes from the Suzuki function field. 3298-3302 - Jie Cui, Junying Pei:
Generalized MacWilliams identities for ℤ4-linear codes. 3302-3305 - Taher Abualrub, Ali Ghrayeb, Robert H. Oehmke:
A mass formula and rank of ℤ4 cyclic codes of length 2e. 3306-3312 - Tor Helleseth, Hans Georg Schaathun:
On the (2, 1)-separating weight of the Kerdock code. 3312-3315 - Patric R. J. Östergård:
There exists no Hermitian self-dual quaternary [26, 13, 10]4 code. 3316-3317 - Jacobus H. Weber, Marc P. C. Fossorier:
Limited-trial chase-like algorithms achieving bounded-distance decoding. 3318-3323 - Keqin Feng, Zhi Ma:
A finite Gilbert-Varshamov bound for pure stabilizer quantum codes. 3323-3325 - Weiguo Yang, Wen Liu:
The asymptotic equipartition property for Mth-order nonhomogeneous Markov information sources. 3326-3330 - Xiao Ma, Li Ping:
Coded modulation using superimposed binary codes. 3331-3343 - Zhiyuan Yan, Dumitru Mihai Ionescu:
Geometrical uniformity of a class of space-time Trellis codes. 3343-3347 - Genyuan Wang, Huiyong Liao, Haiquan Wang, Xiang-Gen Xia:
Systematic and optimal cyclotomic lattices and diagonal space-time block code designs. 3348-3360 - Haiquan Wang, Genyuan Wang, Xiang-Gen Xia:
Some 2×2 unitary space-time codes from sphere packing theory with optimal diversity product of code size 6. 3361-3368 - Daniel E. Asraf, Mats G. Gustafsson:
An analytical series expansion solution to the problem of noncoherent detection. 3369-3375 - Ilia Rapoport, Yaakov Oshman:
A new estimation error lower bound for interruption indicators in systems with uncertain measurements. 3375-3384 - Raymond A. Kristiansen, Matthew Geoffrey Parker:
Binary sequences with merit factor ge6.3. 3385-3389 - Rong-Rong Chen, Bruce E. Hajek, Ralf Koetter, Upamanyu Madhow:
On fixed input distributions for noncoherent communication over high-SNR Rayleigh-fading channels. 3390-3396 - Joon Ho Cho:
Joint transmitter and receiver optimization in additive cyclostationary noise. 3396-3405
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 2024-11-11 21:18 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:
