Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDISIT 2004: Chicago, Illinois, USA
- Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004. IEEE 2004, ISBN 0-7803-8280-3
- Igal Sason:
On achievable rate regions for the Gaussian interference channel. 1 - Zheng Zhang, Israfil Bahceci, Tolga M. Duman:
Capacity approaching codes for relay channels. 2 - Liang-Liang Xie, P. R. Kumar:
An achievable rate for the multiple level relay channel. 3 - Mohammad Ali Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang:
Improved achievable rates for user cooperation and relay channels. 4 - Alexander Barg, Gilles Zémor:
Distance properties of expander codes. 5 - Souvik Dihidar, Steven W. McLaughlin, Prasad Tetali:
On the trade-off between rate and performance of expander codes on AWGN channels. 6 - Jean-Pierre Tillich:
The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution. 7 - Ron M. Roth, Vitaly Skachek:
On nearly-MDS expander codes. 8 - Anand K. Dhulipala, Alon Orlitsky:
On the redundancy of HMM patterns. 9 - Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski:
On the entropy of a Hidden Markov process. 10 - Erez Sabbag, Neri Merhav:
Large deviations performance of predictors for Markov sources. 11 - Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann:
On the entropy rate of a hidden Markov model. 12 - Kenneth J. Giuliani, Guang Gong:
Efficient key agreement and signature schemes using compact representations in GF(p10). 13 - Willi Geiselmann, Rainer Steinwandt:
Attacks on a secure group communication scheme with hierarchical access control. 14 - Jun Muramatsu:
Secret key agreement from correlated source outputs using LDPC matrices. 15 - Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa:
Optimal multiple assignments based on integer programming in secret sharing schemes. 16 - Martin Haenggi:
Efficient routing in wireless networks with random node distribution. 17 - Helmut Bölcskei, Rohit U. Nabar:
Realizing MIMO gains without user cooperation in large single-antenna wireless networks. 18 - Paul Balister
, Béla Bollobás, Martin Haenggi, Mark Walters:
Fast transmission in ad hoc networks. 19 - Steven A. Borbash, Anthony Ephremides:
The feasibility of matchings in a wireless network. 20 - Yael Merksamer, Tuvi Etzion:
On the optimality of coloring with a lattice. 21 - Anxiao Jiang, Matthew Cook, Jehoshua Bruck:
Optimal t-interleaving on tori. 22 - Wen-Qing Xu, Solomon W. Golomb:
Optimal interleaving schemes for correcting 2-D cluster errors. 23 - Boris Ryabko, Jaakko Astola:
Prediction and adaptive coding of sources with large or infinite alphabet. 24 - Alon Orlitsky, Narayana P. Santhanam, Junan Zhang:
Relative redundancy: a more stringent performance guarantee for universal compression. 25 - Vladimir Stankovic, Angelos D. Liveris, Zixiang Xiong, Costas N. Georghiades:
Code design for lossless multiterminal networks. 26 - Gil I. Shamir:
Average case universal lossless compression with unknown alphabets. 27 - Peter Harremoës:
The weak information projection. 28 - Erik Ordentlich, Marcelo J. Weinberger:
A distribution dependent refinement of Pinsker's inequality. 29 - Imre Csiszár, Frantisek Matús:
Information closures of exponential families. 30 - Bent Fuglede, Flemming Topsøe:
Jensen-Shannon divergence and Hilbert space embedding. 31 - Ertem Tuncel:
On optimal multiresolution source-channel coding across degraded broadcast channels. 32 - Gerhard Kramer, Serap A. Savari:
Cut sets and information flow in networks of two-way channels. 33 - Michael Gastpar:
Cut-set arguments for source-channel networks. 34 - Jürg Wullschleger:
Zero-error communication over networks. 35 - Amin Shokrollahi:
Raptor codes. 36 - Ravi Palanki, Jonathan S. Yedidia:
Rateless codes on noisy channels. 37 - Omid Etesami, Mehdi Molkaraie, Amin Shokrollahi:
Raptor codes on symmetric channels. 38 - Richard M. Karp, Michael Luby, Amin Shokrollahi:
Finite length analysis of LT codes. 39 - Giorgio Kaniadakis, Flemming Topsøe:
Entropy measures of physics via complexity. 40 - Georg Tauboeck:
On the maximum entropy theorem for complex random vectors. 41 - Siu-Wai Ho, Raymond W. Yeung:
On the relation between the Shannon entropy and the von Neumann entropy. 42 - Jean Cardinal, Samuel Fiorini, Gilles Van Assche:
On minimum entropy graph colorings. 43 - Chunxuan Ye, Prakash Narayan:
The private key capacity region for three terminals. 44 - Hideki Imai, Jörn Müller-Quade, Anderson C. A. Nascimento, Andreas J. Winter:
Rates for bit commitment and coin tossing from noisy correlation. 45 - Anderson D. Cohen, Gilles Zémor:
Generalized coset schemes for the wire-tap channel: application to biometrics. 46 - Chaichana Mitrpant, Yuan Luo, A. J. Han Vinck:
Achieving the perfect secrecy for the Gaussian wiretap channel with side information. 47 - Jianhan Liu, Jinghu Chen, Anders Høst-Madsen, Marc P. C. Fossorier:
Capacity-achieving multiple coding for MIMO Rayleigh fading systems. 48 - Mehrdad Shamsi, Ian F. Blake:
Space-time codes from property-L. 49 - Yang Tang, Branka Vucetic, Yonghui Li:
An iterative channel estimation scheme for beamforming transmission and detection in MIMO systems. 50 - Yi Wu, Markku J. Juntti, Teng Joon Lim:
Detectors and asymptotic analysis for bandwidth-efficient space-time multiple-access systems. 51 - Eirik Rosnes, Øyvind Ytrehus:
On bit-interleaved turbo-coded modulation with low error floors. 52 - Sheryl L. Howard, Siavash Sheikh Zeinoddin, Christian Schlegel, Vincent C. Gaudet:
Short-cycle-free interleaver design for increasing minimum squared Euclidean distance. 53 - Ajit Nimbalker, Thomas E. Fuja, Daniel J. Costello Jr., Keith T. Blankenship, Brian K. Classon:
Contention-free interleavers. 54 - Joseph J. Boutros, Gilles Zémor:
Interleavers for turbo codes that yield a minimum distance growing with blocklength. 55 - Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
Error resilient LZ'77 scheme and its analysis. 56 - Luis Alfonso Lastras-Montaño:
On certain pathwise properties of the sliding-window Lempel Ziv algorithm. 57 - Vittorio Castelli, Luis Alfonso Lastras-Montaño:
Bounds on expansion in LZ'77-like coding. 58 - Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger:
Linear time universal coding of tree sources via FSM closure. 59 - Xue-Bin Liang:
On a conjecture of Majani and Rumsey. 60 - Chandra Nair, Balaji Prabhakar, Mayank Sharma:
A new proof of Parisi's conjecture for the finite random assignment problem. 61 - Holger Boche, Eduard A. Jorswieck:
Optimization of matrix monotone functions: saddle-point, worst case noise analysis, and applications. 62 - Libo Zhong, Fady Alajaji, Glen Takahara:
An approximation of the Gilbert-Elliott channel via a queue-based channel model. 63 - Jan Hansen, Helmut Bölcskei:
A geometrical investigation of the rank-1 Ricean MIMO channel at high SNR. 64 - Ramy H. Gohary, Timothy N. Davidson:
Noncoherent MIMO communication: Grassmannian constellations and efficient detection. 65 - Nicolas Gresset, Joseph J. Boutros, Loïc Brunel:
Optimal linear precoding for BICM over MIMO channels. 66 - Christine A. Kelley, Deepak Sridhara, Jun Xu, Joachim Rosenthal:
Pseudocodeword weights and stopping sets. 67 - Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright:
LP decoding corrects a constant fraction of errors. 68 - Aditya Ramamoorthy, Richard D. Wesel:
Analysis of an algorithm for irregular LDPC code construction. 69 - Pascal O. Vontobel, Ralf Koetter:
Lower bounds on the minimum pseudoweight of linear codes. 70 - Jialing Liu, Nicola Elia, Sekhar Tatikonda:
Capacity-achieving feedback scheme for Markov channels with channel state information. 71 - Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
Linear Gaussian channels: feedback capacity under power constraints. 72 - Desmond S. Lun, Muriel Médard:
On the sufficiency of power control for a class of channels with feedback. 73 - Ayelet Shahar-Doron, Meir Feder:
On a capacity achieving scheme for the colored Gaussian channel with feedback. 74 - Andrew Klapper:
Pseudonoise sequences based on algebraic function fields. 75 - Andrew Brown, Amin Shokrollahi:
Algebraic-geometric codes on the erasure channel. 76 - Xin-Wen Wu, Margreta Kuijper, Parampalli Udaya:
A class of algebraic-geometric codes for Lee-Metric and their decoding. 77 - Henning E. Andersen, Olav Geil:
The missing evaluation codes from order domain theory. 78 - Min Dong, Lang Tong, Brian M. Sadler:
Information retrieval and processing in sensor networks: deterministic scheduling vs. random access. 79 - Arvind Giridhar, P. R. Kumar:
Computing and communicating statistics in sensor networks. 80 - Cedric Florens, Masoud Sharif, Robert J. McEliece:
Delay issues in linear sensory networks. 81 - Srisankar S. Kunniyur, Santosh S. Venkatesh:
Sensor network devolution and breakdown in survivor connectivity. 82 - Changho Suh, Chan-Soo Hwang:
Recursive construction of Golay sequences. 83 - Xiaohu Tang, Parampalli Udaya, Pingzhi Fan:
Generalized binary Udaya-Siddiqi sequences. 84 - Oscar Moreno, Solomon W. Golomb:
A new optimal double periodical construction of one target two-dimensional arrays. 85 - Xiutao Feng, Quanlong Wang, Zongduo Dai:
Multisequences with d-perfect property. 86 - Navin Kashyap, Paul H. Siegel:
Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity. 87 - Ching-Nung Yang, Tse-Shih Chen:
An algorithm to enumerate codewords for third-order spectral-null codes. 88 - Adriaan J. de Lind van Wijngaarden, Kees A. Schouhamer Immink:
On guided scrambling with guaranteed maximum run-length constraints. 89 - Yogesh Sankarasubramaniam, Steven W. McLaughlin:
A convolution interpretation of (M, d, k) run-length-limited capacity. 90 - Michael Drmota, Wojciech Szpankowski:
Variable-to-variable codes with small redundancy rates. 91 - Serap A. Savari, Akshay Naheta:
Bounds on the expected cost of one-to-one codes. 92 - Jun Yang, Zhen Zhang:
Redundancy-complexity tradeoff of multiresolution coding for successively refinable sources. 93 - Yuriy A. Reznik:
On second-order properties of minimum redundancy block codes. 94 - Hsiao-feng Lu, P. Vijay Kumar:
Generalized unified construction of space-time codes with optimal rate-diversity tradeoff. 95 - Hesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen:
On the optimality of lattice space-time (LAST) coding. 96 - Leonard H. Grokop, David N. C. Tse:
Diversity/multiplexing tradeoff in ISI channels. 97 - Saurabha Tavildar, Pramod Viswanath:
Permutation codes: achieving the diversity-multiplexing tradeoff. 98 - Abdelkader Medles, Dirk T. M. Slock:
Decision-feedback equalization achieves full diversity for finite delay spread channels. 99 - Peyman Meshkat, Hamid Jafarkhani:
Concentration theorem for tripartite LDPC codes. 100 - Nandakishore Santhi, Alexander Vardy:
On the effect of parity-check weights in iterative decoding. 101 - Changyan Di, Andrea Montanari, Rüdiger L. Urbanke:
Weight distributions of LDPC code ensembles: combinatorics meets statistical physics. 102 - Abdelaziz Amraoui, Rüdiger L. Urbanke, Andrea Montanari, Thomas J. Richardson:
Further results on finite-length scaling for iteratively decoded LDPC ensembles. 103 - Priti Shankar:
On the complexity of exact maximum likelihood decoding on tail-biting trellises. 104 - Yoichiro Watanabe, Koichi Kamoi:
Channel configuration of multiple-access channel. 105 - Yakup Cemal, Yossef Steinberg:
On the multiple-access channel with rate-limited state information at the encoders. 106 - Edward C. van der Meulen, Saskia Vangheluwe:
Construction of new signature codes for the T-terminal binary adder multiple access channel with partially active users. 107 - S. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran:
Achievable rates for multiple-access channels with correlated messages. 108 - Ninoslav Marina, Bixio Rimoldi:
On the structure of the capacity region of the Gaussian multiple access channel. 109 - Can Emre Koksal:
An analysis of blocking switches using error control codes. 110 - Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
Optimal universal schedules for discrete broadcast. 111 - Edmund M. Yeh, Aaron S. Cohen:
Throughput optimal power and rate control for queued multiaccess and broadcast communications. 112 - Kevin Foltz, Lihao Xu, Jehoshua Bruck:
Scheduling for efficient data broadcast over two channels. 113 - E. A. Pechersky, Yuri M. Suhov, Nikita D. Vvedenskaya:
Large deviation in a two-servers system with dynamic routing. 114 - Michael Katz, Shlomo Shamai:
Communicating to colocated ad-hoc receiving nodes in a fading environment. 115 - Jun Chen, Toby Berger:
Robust coding schemes for distributed sensor networks with unreliable sensors. 116 - Sekhar Tatikonda, Kannan Ramchandran:
Coding and routing complexity in sensor networks. 117 - Stark C. Draper, Brendan J. Frey, Frank R. Kschischang:
On interacting encoders and decoders in multiuser settings. 118 - Vinod M. Prabhakaran, David N. C. Tse, Kannan Ramchandran:
Rate region of the quadratic Gaussian CEO problem. 119 - Gerard Maze, Hugo Parlier:
Determinants of binary circulant matrices. 120 - Yan Xin, Ivan J. Fair:
Multiple-shift complementary sequences and their peak-to-average power ratio values. 121 - Tor Helleseth, John Erik Mathiassen, Martijn Maas, Toon Segers:
Linear complexity over Fp of Sidel'nikov sequences. 122 - Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences. 123 - Panagiotis Rizomiliotis, Nicholas Kalouptsidis:
Results on the nonlinear span of binary sequences. 124 - Vummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar:
STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennas. 125 - Vummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman:
Information-lossless STBCs from crossed-product algebras. 126 - Philippa A. Martin, Desmond P. Taylor:
High-throughput error correcting space-time block codes. 127 - P. Vijay Kumar, Hsiao-feng Lu, Sameer A. Pawar:
On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes. 128