default search action
ISIT 2005: Adelaide, SA, Australia
- Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 2005, Adelaide, South Australia, Australia, 4-9 September 2005. IEEE 2005, ISBN 0-7803-9151-9
- Massimo Franceschetti, Ronald W. J. Meester:
Critical node lifetimes in random networks via the chen-stein method. 1-5 - Aman Kansal, Aditya Ramamoorthy, Mani B. Srivastava, Gregory J. Pottie:
On sensor network lifetime and data distortion. 6-10 - Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Network routing capacity. 11-13 - Huiyu Luo, Gregory J. Pottie:
Balanced aggregation trees for routing correlated data in wireless sensor networks. 14-18 - Dragana Bajic
, Cedomir Stefanovic
Search process and probabilistic bifix approach. 19-22 - Jia Yang, Ulrich Speidel:
A T-decomposition algorithm with O(n log n) time and space complexity. 23-27 - M. Brandon Westover, Joseph A. O'Sullivan
Achievable rates for pattern recognition: binary and Gaussian cases. 28-32 - Joseph A. O'Sullivan
Pattern recognition system design based on LDPC matrices. 33-36 - Amir Bennatan, David Burshtein:
EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels. 37-41 - Ohad Barak, David Burshtein:
Lower bounds on the spectrum and error rate LDPC code ensembles. 42-46 - Yael Ben-Haim, Simon Litsyn:
Upper bounds on the rate of LDPC codes as a function of minimum distance. 47-51 - Hui Jin, Thomas J. Richardson:
Block Error Iterative Decoding Capacity for LDPC Codes. 52-56 - Natasha Devroye, Patrick Mitran, Vahid Tarokh:
Cognitive multiple access networks. 57-61 - Jian Cao, Edmund M. Yeh:
Distributed rate splitting in Gaussian and discrete memoryless multiple-access channels. 62-66 - Xiaojie Gao, Leonard J. Schulman
Real-time coding for multiple access channels. 67-71 - Styrmir Sigurjonsson, Young-Han Kim:
On multiple user channels with state information at the transmitters. 72-76 - Leonard H. Grokop, Anant Sahai, Michael Gastpar:
Discriminatory source coding for a noiseless broadcast channel. 77-81 - Hanying Feng, Michelle Effros:
On the rate loss and construction of source codes for broadcast channels. 82-86 - Niklas Wernersson, Mikael Skoglund:
On source decoding based on finite-bandwidth soft information. 87-91 - Jayanth Nayak, Sharadh Ramaswamy, Kenneth Rose:
Correlated source coding for fusion storage and selective retrieval. 92-96 - Ulrich G. Schuster, Helmut Bölcskei, Giuseppe Durisi
Ultra-wideband channel modeling on the basis of information-theoretic criteria. 97-101 - Andrea Ridolfi, Moe Z. Win
Power spectra of multipath faded pulse trains. 102-106 - Dana Porrat, Urbashi Mitra:
On synchronization of wideband impulsive systems in multipath. 107-111 - Cheng Luo, Muriel Médard, Lizhong Zheng, Desmond S. Lun:
Multi-tone FSK with feedback. 112-116 - Ulrich Tamm:
On perfect integer codes. 117-120 - Ernst M. Gabidulin, Pierre Loidreau:
On subcodes of codes in rank metric. 121-123 - Asha Rao
New linear codes over Zps via the trace map. 124-126 - Reza Omrani, P. Vijay Kumar:
Improved constructions and bounds for 2-D optical orthogonal codes. 127-131 - Yaron Rachlin, Rohit Negi, Pradeep K. Khosla:
Sensing capacity for Markov random fields. 132-136 - Raghu Mudumbai, João P. Hespanha, Upamanyu Madhow, Gwen Barriac:
Scalable feedback control for distributed beamforming in sensor networks. 137-141 - Ken-ichi Iwata:
On multiple-access communication system for general correlated sources with an array of general independent channels. 142-146 - João Barros
A coding theorem for network information flow with correlated sources. 147-151 - Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú:
Universal estimation of divergence for continuous distributions via data-dependent partitions. 152-156 - James L. Massey, Peter C. Massey:
Conservation of mutual and directed information. 157-158 - Siu-Wai Ho
On the discontinuity of the Shannon information measures. 159-163 - Peter Harremoës:
Martingales and information divergence. 164-168 - Andrew Brown, Michael Luby, Amin Shokrollahi:
Repeat-accumulate codes that approach the Gilbert-Varshamov bound. 169-173 - Yifei Zhang, William E. Ryan, Yan Li:
Structured eIRA codes with low floors. 174-178 - Sarah J. Johnson
Constructions for irregular repeat-accumulate codes. 179-183 - Yong Sun, Angelos D. Liveris, Vladimir Stankovic
Near-capacity dirty-paper code designs based on TCQ and IRA codes. 184-188 - Adriel P. Kind, Alex J. Grant
A tree search method for iterative decoding of underdetermined multiuser systems. 189-193 - Toshiyuki Tanaka:
Structure of replica-symmetric solutions for randomly-spread CDMA. 194-198 - Dongning Guo:
Performance of synchronous multirate CDMA via statistical physics. 199-203 - Chien-Hwa Hwang:
Equivalence of large chip-synchronous and symbol-synchronous CDMA systems. 204-208 - Kwang Taik Kim, Toby Berger:
Sending a lossy version of the innovations process is suboptimal in QG rate-distortion. 209-213 - Frans M. J. Willems, Ton Kalker:
Semantic compaction, transmission, and compression codes. 214-218 - Krishnan Eswaran, Michael Gastpar:
On the quadratic AWGN CEO problem and non-gaussian sources. 219-223 - Stefania Sesia, Giuseppe Caire, Guillaume Vivier:
Lossy transmission over slow-fading AWGN channels: a comparison of progressive and superposition and hybrid approaches. 224-228 - Jan Mietzner, Sabah Badri-Hoeher, Ingmar Land, Peter A. Hoeher:
Trellis-based equalization for sparse ISI channels revisited. 229-233 - Brian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobayashi:
On BCJR state metric quantization for turbo equalization. 234-238 - Teng Li, Oliver M. Collins:
A successive decoding strategy for channels with memory. 239-243 - Moshe Laifenfeld, Ari Trachtenberg:
Disjoint identifying-codes for arbitrary graphs. 244-248 - Chao Tian, Vinay A. Vaishampayan
Constant weight codes: a geometric approach. 249-253 - Carmen Martínez
On the perfect t-dominating set problem in circulant graphs and codes over gaussian integers. 254-258 - Reza Omrani, Oscar Moreno, P. Vijay Kumar:
Improved Johnson bounds for optical orthogonal codes with λ > 1 and some optimal constructions. 259-263 - Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
Insufficiency of linear coding in network information flow. 264-267 - Xiaolin Wu, Bin Ma, Nima Sarshar:
Rainbow network problems and multiple description coding. 268-272 - Shuo-Yen Robert Li, Ning Cai, Raymond W. Yeung:
On theory of linear network coding. 273-277 - Supratim Deb, Muriel Médard, Clifford Choute:
On random network coding based information dissemination. 278-282 - Arkady G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Pavel A. Vilenkin, I. K. Ismagilov:
New results on DNA codes. 283-287 - Olgica Milenkovic, Navin Kashyap:
DNA codes that avoid secondary structures. 288-292 - Bruce E. Hajek:
On the value of a well chosen bit to the seller in an auction. 293-296 - Sampath Kannan, Andrew McGregor:
More on reconstructing strings from random traces: insertions and deletions. 297-301 - Xiaofei Huang:
Near perfect decoding of LDPC codes. 302-306 - Jon Feldman, Ralf Koetter, Pascal O. Vontobel
The benefit of thresholding in LP decoding of LDPC codes. 307-311 - Pirouz Zarrinkhat, Amir H. Banihashemi:
Hybrid decoding of irregular LDPC codes. 312-316 - Alexei Ashikhmin, Vitaly Skachek:
Decoding of expander codes at rates close to capacity. 317-321 - Kegen Yu, Ian J. Oppermann
Performance of decorrelating receiver in multipath Rician fading channels. 322-326 - Matthew J. M. Peacock, Iain B. Collings
A relationship between the SINR of MMSE and ALS receivers. 327-331 - Zhenning Shi, Mark C. Reed:
Iterative multiuser detection based on Monte Carlo probabilistic data association. 332-336 - Nicolas Bonneau, Eitan Altman, Mérouane Debbah, Giuseppe Caire:
When to synchronize in uplink CDMA. 337-341 - Daniel Marco, David L. Neuhoff:
Entropy of quantized data at high sampling rates. 342-346 - Paul J. Pelzl, David L. Neuhoff:
A fast, flexible and robust design method for noisy channel scalar quantization. 347-351 - Maxim Raginsky:
A complexity-regularized quantization approach to nonlinear dimensionality reduction. 352-356 - H. Y. Chan, Wai Ho Mow
Index assignment for scalar quantization with M-ary phase shift keying. 357-361 - Jean-Claude Belfiore, Emanuele Viterbo
Approximating the error probability for the independent rayleigh fading channel. 362 - Michele Franceschini, Gianluigi Ferrari
A novel class of low-complexity SISO algorithms for phase-uncertain communications. 363-367 - Xiaowei Jin, Andrew W. Eckford, Thomas E. Fuja:
Analysis and design of low density parity check codes for non-coherent block fading channels. 368-372 - Hao Zhou, Oliver M. Collins:
Manufacturing training symbols from future bits. 373-377 - Ying Li, Yi-Chan Kao:
Structures of non-GDJ golay sequences. 378-381 - Kenji Yasunaga, Toru Fujiwara:
Relations between the local weight distributions of a linear block code, its extended code, and its even weight subcode. 382-386 - Hiroyoshi Morita, Masahiko Satoh, Adriaan J. de Lind van Wijngaarden
On multimode polarity-switch codes of rate 1 - 1/n. 387-391 - Takaya Miyazawa, Iwao Sasase:
Mitigation of MAIs by the second encoding scheme in TTFR-based optical CDMA systems. 392-396 - Chris T. K. Ng, Andrea J. Goldsmith:
Capacity gain from transmitter and receiver cooperation. 397-401 - Anant Sahai, Stark C. Draper, Michael Gastpar:
Boosting reliability over AWGN networks with average power constraints and noiseless feedback. 402-406 - Ivana Maric, Roy D. Yates, Gerhard Kramer:
The discrete memoryless compound multiple access channel with conferencing encoders. 407-410 - Lalitha Sankaranarayanan, Gerhard Kramer
Cooperation vs. hierarchy: an information-theoretic comparison. 411-415 - Young-Han Kim:
Feedback capacity of the first-order moving average Gaussian channel. 416-420 - John B. Moore, Keng T. Tan:
Multinomial representation of majority logic coding. 421-424 - Justin Dauwels:
Computing Bayesian Cramer-Rao bounds. 425-429 - Hugues Mercier, Pierre McKenzie, Stefan Wolf
Worst-case randomized interactive communication. 430-434 - Nicolas Sendrier:
Encoding information into constant weight words. 435-438 - Arya Mazumdar, Adrish Banerjee, Ajit Kumar Chaturvedi:
On the spread of random interleavers. 439-443 - Masato Inoue, Miho Komiya, Yoshiyuki Kabashima:
An LDPCC decoding algorithm based on bowman-levin approximation -comparison with bp and CCCP-. 444-448 - Jinghu Chen, R. Michael Tanner, Christopher Jones, Yan Li:
Improved min-sum decoding algorithms for irregular LDPC codes. 449-453 - Juntan Zhang, Yige Wang, Marc P. C. Fossorier, Jonathan S. Yedidia:
Replica shuffled iterative decoding. 454-458 - Jason Kwok-San Lee, Jeremy Thorpe:
Memory-efficient decoding of LDPC codes. 459-463 - David Declercq, Marc P. C. Fossorier:
Extended minsum algorithm for decoding LDPC codes over GF(q). 464-468 - Panagiotis Rizomiliotis:
On the design of binary sequences with maximum nonlinear span. 469-473 - Elena V. Konstantinova
Reconstruction of signed permutations from their distorted patterns. 474-477 - Yasutada Oohama:
Multiterminal random number generation in of separate coding systems. 478-481 - Xiaohu Tang, Parampalli Udaya:
New construction of low correlation zone sequences from hadamard matrices. 482-486 - Ji-Woong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang:
Binary sequence sets with low correlation zone. 487-490 - R. K. Bansal, Jay Deep Sau:
Weakly universal LZ-extended codes for sources with countable alphabet. 491-494 - En-Hui Yang, Lihua Song, Gil I. Shamir, John C. Kieffer:
On the pointwise redundancy of the LZ78 algorithm. 495-499 - Tsutomu Kawabata, You Yanagisawa:
Redundancy of symbol decomposition algorithms for memoryless source. 500-504 - Mitsuharu Arimura, Hiroshi Nagaoka:
An extension of asymptotically sufficient statistic method for pointwise strong universality. 505-509 - Suhas N. Diggavi, David N. C. Tse:
Fundamental limits of diversity-embedded codes over fading channels. 510-514 - Vignesh Sethuraman, Bruce E. Hajek, Krishna R. Narayanan:
Capacity bounds for noncoherent fading channels with a peak constraint. 515-519 - Teng Li, Xiaowei Jin, Oliver M. Collins:
Approaching capacity on correlated fading channels with unknown state. 520-524 - Parastoo Sadeghi
The effect of memory order on the capacity of finite-state Markov and flat-fading channels. 525-529 - Kaushik Chakraborty:
Capacity of the MIMO optical fading channel. 530-534 - Vladimir I. Levenshtein, Vladimir D. Tonchev:
Optimal conflict-avoiding codes for three active users. 535-537 - Vladimir Rusek, John B. Anderson:
Near BER optimal partial response codes. 538-542 - Yogesh Sankarasubramaniam, Steven W. McLaughlin:
A fixed-rate bit stuffing approach for high efficiency k-constrained codes. 543-547 - Sundararajan Sankaranarayanan, Evangelos Eleftheriou:
Performance of product codes on channels with memory. 548-552 - Leonidas Georgiadis, Leandros Tassiulas:
Most balanced overload response in sensor networks. 553-557 - Vivek F. Farias, Ciamac C. Moallemi, Balaji Prabhakar:
Load balancing with migration penalties. 558-562 - Kamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval:
On the capacity of multiple unicast sessions in undirected graphs. 563-567 - Jian Ni, Sekhar Tatikonda:
Calculating blocking probabilities for loss networks based on probabilistic graphical models. 568-572 - Cengiz Y. Belentepe, Abraham J. Wyner:
A statistical view of universal stock market portfolios. 573-577 - Mohamed-Slim Alouini, Hong-Chuan Yang:
Minimum estimation and combining generalized selection combining (MEC-GSC). 578-582 - Justin Dauwels, Sascha Korl, Hans-Andrea Loeliger:
Expectation maximization as message passing. 583-586 - Daniel J. Navarro, Michael D. Lee
An application of minimum description length clustering to partitioning learning curves. 587-591 - Wei Zhang, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Braided convolutional codes. 592-596 - Axel Huebner, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Laminated turbo codes. 597-601 - Eirik Rosnes, Øyvind Ytrehus:
On the construction of good families of rate-compatible punctured turbo codes. 602-606 - Alexandre Graell i Amat, Guido Montorsi, Francesca Vatta:
Analysis and design of rate compatible serial concatenated convolutional codes. 607-611 - Christian Sgraja, Jürgen Lindner:
Closed-form expressions for the SEP of QAM diversity combining in uncertain channels. 612-616 - Daniel J. Ryan, I. Vaughan L. Clarkson, Iain B. Collings:
Detection error probabilities in noncoherent channels. 617-621 - Miguel R. D. Rodrigues, Ioannis Chatzigeorgiou
On the performance of turbo codes in quasi-static fading channels. 622-626 - Daniel C. Cunha, Jaime Portugheis:
Bounds on the capacity of the blockwise noncoherent APSK-AWGN channels. 627-630 - Alina Maor, Neri Merhav:
Two-way joint source-channel coding with a fidelity criterion. 631-635 - Yakup Cemal, Yossef Steinberg
Hierarchical and joint source-channel coding with coded state information at the transmitter. 636-640 - Ertem Tuncel:
Lossless joint source-channel coding across broadcast channels with decoder side information. 641-645 - Siddharth Ray, Muriel Médard, Lizhong Zheng:
Wideband non-coherent MIMO capacity. 646-650 - Moritz Borgmann, Helmut Bölcskei:
On the capacity of noncoherent wideband MIMO-OFDM systems. 651-655 - Narayan Prasad, Mahesh K. Varanasi:
MIMO outage capacity in the high SNR regime. 656-660 - Tobias Koch, Amos Lapidoth:
The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipe. 661-665 - Jiangxin Chen, Paul H. Siegel:
Lower bounds on the capacity of asymmetric two-dimensional (d, ∞)-constraints. 666-670 - Erdal Arikan:
Channel combining and splitting for cutoff rate improvement. 671-675 - Heide Gluesing-Luerssen, Wiland Schmale:
Reed-Solomon convolutional codes. 676-679 - Amir J. Salomon, Ofer Amrani:
Augmented product codes and lattices. 680-684 - Jianwei Huang, Randall A. Berry, Michael L. Honig:
A game theoretic analysis of distributed power control for spread spectrum ad hoc networks. 685-689 - Kin Kwong Leung, Chi Wan Sung, Vijay K. Bhargava:
An opportunistic power control algorithm with fairness. 690-694 - Holger Boche, Slawomir Stanczak:
The infeasible SIR region is not a convex set. 695-699 - Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz:
A non-cooperative power control game in delay-constrained multiple-access networks. 700-704 - Daniel P. Palomar, Sergio Verdú:
Gradient of mutual information in linear vector Gaussian channels. 705-708 - Wei Zeng, Jitender Tokas, Ravi Motwani, Aleksandar Kavcic:
Bounds on mutual information rates of noisy channels with timing errors. 709-713 - Jian-Kang Zhang, Timothy N. Davidson, Kon Max Wong:
Uniform decomposition of mutual information using MMSE decision feedback detection. 714-718 - Dongning Guo, Shlomo Shamai, Sergio Verdú:
Additive non-Gaussian noise channels: mutual information and conditional mean estimation. 719-723 - Aditi Kothiyal, Oscar Y. Takeshita:
A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codes. 724-728 - Peng Hui Tan, Lars K. Rasmussen:
The serial and parallel belief propagation algorithms. 729-733 - John MacLaren Walsh, Phillip A. Regalia, C. Richard Johnson Jr.:
A convergence proof for the turbo decoder as an instance of the gauss-seidel iteration. 734-738 - Salam A. Zummo, Ping-Cheng Yeh, Wayne E. Stark:
Bit error probability of bit-interleaved coded modulation (BICM) in wireless environments. 739 - Anders Nilsson, Tor M. Aulin:
Design of recursive inner codes for SCTCM. 740-744 - Fabio Fagnani, Federica Garin:
Analysis of serial concatenation schemes for non-binary modulations. 745-749 - Krishnan Padmanabhan, Shyam Ranganathan, Srinath P. Sundaravaradhan, Oliver M. Collins:
General CPM and its capacity. 750-754 - Imre Csiszár, Zsolt Talata:
Context tree estimation for not necessarily finite memory processes, via BIC and MDL. 755-759 - Steven de Rooij, Peter Grünwald:
MDL model selection using the ML plug-in code. 760-764 - Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Universal delay-limited simulation. 765-769 - Tal Philosof, Ram Zamir:
The cost of uncorrelation and non-cooperation in MIMO channels. 770-774 - Olli Piirainen, Markku J. Juntti:
Achievable data rates of frequency selective Rayleigh fading MIMO burst channels. 775-779 - Simeon Furrer, Dirk Dahlhaus:
Bounds on the ergodic capacity of training-based multiple-antenna systems. 780-784 - Matthew R. McKay
Statistical properties of complex noncentral wishart matrices and MIMO capacity. 785-789 - Shraga I. Bross, Simon Litsyn:
Improved upper bounds for codes with unequal error protection. 790-794 - Claude Carlet, Sihem Mesnager:
Improving the upper bounds on the covering radii of Reed-Muller codes. 795-799 - Alfonso Martinez, Albert Guillén i Fàbregas, Giuseppe Caire:
Gallager bounds for linear codes in binary-input output-symmetric memoryless channels. 800-804 - Panu Chaichanavong, Paul H. Siegel:
Relaxation bounds on the minimum pseudo-weight of linear block codes. 805-809 - Jeff Castura, Yongyi Mao
Rateless coding for wireless relay channels. 810-814 - Yindi Jing, Babak Hassibi:
Cooperative diversity in wireless relay networks with multiple-antenna nodes. 815-819 - Alex Reznik, Sanjeev R. Kulkarni, Sergio Verdú:
Broadcast-relay channel: capacity region bounds. 820-824 - Bharath Ananthasubramaniam, Upamanyu Madhow:
Detection and localization of events in imaging sensor nets. 825-829 - Israfil Bahceci, Ghassan Al-Regib, Yucel Altunbasak:
Serial distributed detection for wireless sensor networks. 830-834 - Ertem Tuncel:
Extensions of error exponent analysis in hypothesis testing. 835-839 - Song-Nam Hong
Construction and analysis of rate-compatible punctured concatenated zigzag codes. 840-844 - Deepak Sridhara, Christine A. Kelley, Joachim Rosenthal:
Tree-based construction of LDPC codes. 845-849 - Iryna Andriyanova, Jean-Pierre Tillich, Jean-Claude Carlach:
Asymptotically good codes with high iterative decoding performances. 850-854 - Hachiro Fujita, Maki Ohata, Kohichi Sakaniwa:
An algebraic method for constructing efficiently encodable irregular LDPC codes. 855-859 - Sang-Hyo Kim, Ji-Woong Jang, Kyoung-Young Song, Jong-Seon No, Habong Chung:
New quaternary low correlation zone sequences. 860-864 - Christophe Laot, Nicolas Le Josse:
A closed-form solution for the finite length constant modulus receiver. 865-869 - Peter Jung, Gerhard Wunder:
A group-theoretic approach to the WSSUS pulse design problem. 870-874 - Edson Agustini, Sueli I. R. Costa:
"AWGN"-signal transmission in hyperbolic spaces. 875-878 - Matthias Christandl, Andreas J. Winter
Uncertainty, monogamy and locking of quantum correlations. 879-883 - Jon T. Yard
Capacity theorems for quantum multiple access channels. 884-888 - Ben Fortescue, Hoi-Kwong Lo:
Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite quantum states. 889-892 - Jun Ichi Fujii, Ritsuo Nakamoto, Kenjiro Yanagi:
Remarks on concavity of the auxiliary function appearing in quantum reliability function in classical-quantum channels. 893-895 - Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. 896-900 - Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. 901-905 - Vasanthan Raghavan, Akbar M. Sayeed:
Achieving coherent capacity of correlated MIMO channels in the low-power regime with non-flashy signaling schemes. 906-910 - Yabo Li, Xiang-Gen Xia:
Full diversity distributed space-time trellis codes for asynchronous cooperative communications. 911-915 - Kristine Lally:
Algebraic lower bounds on the free distance convolutional codes. 916-920 - Beniamin Mounits, Tuvi Etzion, Simon Litsyn:
New upper bounds on A(n, d). 921-925 - Mostafa El-Khamy
The partition weight enumerator of MDS codes and its applications. 926-930 - Ron M. Roth, Gadiel Seroussi:
On the second moment of the distance distribution of binary codes. 931-935 - Michael Katz, Shlomo Shamai:
Relaying protocols for two co-located users. 936-940 - Amir Salman Avestimehr, David N. C. Tse:
Outage-optimal relaying in the low SNR regime. 941-945 - Radhika Gowaikar, Bertrand M. Hochwald, Babak Hassibi:
An achievability result for random networks. 946-950 - Tobias Koch, Gerhard Kramer:
On the pre-log of Gaussian fading relay channels. 951-955 - Vladimir A. Kazakov, Daniel S. Rodríguez:
Sampling-reconstruction procedure with jitter of Gaussian processes. 956-960 - Li Chai, Jingxin Zhang, Cishen Zhang, Edoardo Mosca:
On frames with stable oversampled filter banks. 961-965 - Peter J. Schreier, Louis L. Scharf, Alfred Hanssen
A geometric interpretation of the rihaczek time-frequency distribution for stochastic signals. 966-969 - Fredrik Rusek, John B. Anderson:
The two dimensional Mazo limit. 970-974 - Moshe Schwartz, Alexander Vardy:
On the stopping distance and the stopping redundancy of codes. 975-979 - Pascal O. Vontobel
On the minimal pseudo-codewords of codes from finite geometries. 980-984 - Ryoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa:
Stopping set distributions of two-edge type LDPC code ensembles. 985-989 - Sang Hyun Lee, Kwang Soon Kim, Jae Kyun Kwon, Yun Hee Kim, Jae Young Ahn:
Design of an LDPC code with low error floor. 990-994 - Nedeljko Varnica, Emina Soljanin, Philip Whiting:
LDPC code ensembles for incremental redundancy hybrid ARQ. 995-999 - Anna C. Gilbert, Joel A. Tropp:
Applications of sparse approximation in communications. 1000-1004 - Lei Wei:
Biologically inspired amorphous communications. 1005 - Kathy J. Horadam:
A generalised Hadamard transform. 1006-1008 - Jagadish Venkataraman, Oliver M. Collins:
Continuous waveforms from a binary modulator. 1009-1012 - Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Noise tolerance of the BB84 protocol with random privacy amplification. 1013-1017 - Markus Grassl, Martin Rötteler:
Quantum block and convolutional codes from self-orthogonal product codes. 1018-1022 - Pradeep Kiran Sarvepalli, Andreas Klappenecker:
Nonbinary quantum Reed-Muller codes. 1023-1027 - G. David Forney Jr., Saikat Guha:
Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes. 1028-1032 - Glenn Dickins
On the dimensionality of spatial fields with restricted angle of arrival. 1033-1037 - Weijun Zhu, Heechoon Lee, Daniel N. Liu, Michael P. Fitz:
Antenna array geometry and coding performance. 1038-1042 - Ying Li, Xudong Guo, Jun-hong Hui, Xinmei Wang:
A new high rate serially concatenated space-time code. 1043-1047 - Dhammika Bokolamulla, Tor M. Aulin:
Performance of space-time coded continuous phase modulated signals over different fading environments. 1048-1052 - Naftali Sommer, Meir Feder, Ofir Shalvi:
Closest point search in lattices using sequential decoding. 1053-1057 - Edward K. S. Au, Wai Ho Mow:
A modified state reduction algorithm for computing weight enumerators for convolutional codes. 1058-1062 - Martin Bossert, Carlos Medina
Encoding and distance estimation of product convolutional codes. 1063-1067 - Theo G. Swart
On the distance optimality of permutation mappings. 1068-1072 - Fanxin Zeng:
Construction of constant weight code and some upper bounds. 1073-1077 - Abbas El Gamal, Navid Hassanpour:
Relay-without-delay. 1078-1080 - Daniela Tuninetti
On the throughput improvement due to limited complexity processing at relay nodes. 1081-1085 - Hon Fah Chong, Mehul Motani, Hari Krishna Garg:
New coding strategies for the relay channel. 1086-1090 - Lawrence Ong
Myopic coding in multiple relay channels. 1091-1095 - Claude Carlet:
Designing bent functions and resilient functions from known ones, without extending their number of variables. 1096-1100 - Claude Carlet, Philippe Gaborit:
On the construction of balanced boolean functions with a good algebraic immunity. 1101-1105 - Håvard Molland, Tor Helleseth:
Alinear weakness in the Klimov-Shamir T-function. 1106-1110 - Khoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, Guang Gong:
Comparison of boolean function design. 1111-1115 - Chris Winstead, Vincent C. Gaudet, Anthony Rapley, Christian Schlegel:
Stochastic iterative decoders. 1116-1120 - Kobi Ovadya, Ofer Amrani:
A direct approach for decoding product codes. 1121-1125 - Maja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov:
Estimating the list size for BEAST-APP decoding. 1126-1130 - Sheryl L. Howard, Christian Schlegel, Vincent C. Gaudet:
A degree-matched check node approximation for LDPC decoding. 1131-1135 - Kai-Uwe Schmidt, Adolf Finger:
New codes for OFDM with low PMEPR. 1136-1140 - Dae-Woon Lim, Seok-Joong Heo, Jong-Seon No, Habong Chung:
A PTS OFDM scheme with low computational complexity. 1141-1144 - Robert F. H. Fischer, Clemens Stierstorfer:
Comparison of code design requirements for single- and multi-carrier transmission over frequency-selective MIMO channel. 1145-1149 - Yanxia Wang, Libo Yang, Lei Wei:
High speed turbo TCM coded OFDM system for UWB channels. 1150 - Gopal Pandurangan, Wojciech Szpankowski:
A universal online caching algorithm based on pattern matching. 1151-1155 - Charles Mathis, Thomas M. Cover:
A statistic for measuring the influence of side information in investment. 1156-1157 - Vivek F. Farias, Ciamac C. Moallemi, Benjamin Van Roy, Tsachy Weissman:
A universal scheme for learning. 1158-1162 - András György, Tamás Linder, Gábor Lugosi:
Tracking the best quantizer. 1163-1167 - Haiquan Wang, Dong Wang, Xiang-Gen Xia:
On optimal quasi-orthogonal space-time block codes with minimum decoding complexity. 1168-1172 - Frédérique E. Oggier, Emmanuel Lequeu:
Families of unitary matrices achieving full diversity. 1173-1177 - Kiran T. Gowda, B. Sundar Rajan:
STBC-schemes with non-vanishing determinant for certain number of transmit antennas. 1178-1182 - Jørn Justesen:
Soft-decision decoding of RS codes. 1183-1185 - Jing Jiang, Krishna R. Narayanan:
Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channels. 1186-1190 - Xin-Wen Wu
On the decoding radius of Lee-metric decoding of algebraic-geometric codes. 1191-1195 - Vitaly V. Shorin, Pierre Loidreau:
Application of Groebner bases techniques for searching new sequences with good periodic correlation properties. 1196-1200 - Amichai Sanderovich, Shlomo Shamai
Communication via decentralized processing. 1201-1205 - Edmund M. Yeh, Randall A. Berry
Throughput optimal control of cooperative relay networks. 1206-1210 - Veniamin I. Morgenshtern
Distributed orthogonalization in large interference relay networks. 1211-1215 - Ashutosh Sabharwal, Urbashi Mitra:
Rate-constrained relaying: achievable rates and protocol comparisons. 1216-1220 - Mitsugu Iwamoto, Hirosuke Yamamoto
Strongly secure ramp secret sharing schemes. 1221-1225 - Kathy Cartrysse, Jan C. A. van der Lubbe:
Information theoretical approach to mobile code. 1226-1230 - Rajendra S. Katti, Xiaoyu Ruan:
Cryptanalysis of Shannon-Fano-Elias codes. 1231-1235 - Yibo Jiang, Alexei Ashikhmin, Ralf Koetter, Andrew C. Singer
Extremal problems of information combining. 1236-1240 - Cyril Méasson, Rüdiger L. Urbanke, Andrea Montanari, Thomas J. Richardson:
Maximum a posteriori decoding and turbo codes for general memoryless channels. 1241-1245 - Eirik Rosnes, Øyvind Ytrehus:
Finite-length analysis of turbo decoding on the binary erasure channel. 1246-1250 - Eirik Rosnes, Øyvind Ytrehus:
Turbo stopping sets: the uniform interleaver and efficient enumeration. 1251-1255 - Vijay Ahirwar, B. Sundar Rajan:
Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systems. 1256-1260 - Mei Chen, Oliver M. Collins:
Trellis pruning for peak-to-average power ratio reduction. 1261-1265 - Haixia Zhang, Dongfeng Yuan, Feng Zhao
Threshold method to reduce PAPR in wavelet based multicarrier modulation systems. 1266-1269 - Erik Ordentlich, Marcelo J. Weinberger, Tsachy Weissman:
Multi-directional context sets with applications to universal denoising and compression. 1270-1274 - Ciprian Doru Giurcaneanu
Efficient algorithms for discrete universal denoising for channels with memory. 1275-1279 - Kai Xie, Gil I. Shamir:
Context and denoising based decoding of non-systematic turbo codes for redundant data. 1280-1284 - Taesup Moon, Tsachy Weissman:
Discrete universal filtering via hidden Markov modelling. 1285-1289 - Jarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen:
Dense full-diversity matrix lattices for four transmit antenna MISO channel. 1290-1294 - Huiyong Liao, Haiquan Wang, Xiang-Gen Xia:
Some lattice based diagonal and full rate space-time block codes. 1295-1299 - Mahmoud Taherzadeh, Amin Mobasher
LLLl lattice-basis reduction achieves the maximum diversity in MIMO systems. 1300-1304 - Oliver Henkel:
Space frequency codes from spherical codes. 1305-1309 - Richard M. Karp, Michael Luby, Amin Shokrollahi:
Verification decoding of raptor codes. 1310-1314 - Alexander Barg, Gilles Zémor
Multilevel expander codes. 1315-1319 - Fijo Therattil, Andrew Thangaraj
A low-complexity soft-decision decoder for extended BCH and RS-like codes. 1320-1324 - Madhu Achuthan Syamala, Priti Shankar:
Approximate MAP decoding on tail-biting trellises. 1325-1328 - Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
Throughput-delay scaling in wireless networks with constant-size packets. 1329-1333 - Olivier Lévêque, Emmanuel Preissmann:
Scaling laws for one-dimensional ad hoc wireless networks. 1334-1337 - Gautam A. Gupta, Stavros Toumpis, Jossy Sayir
Transport capacity of Gaussian multiple access and broadcast channels with a large number of nodes. 1338-1342 - Riccardo Pighi, Riccardo Raheli
Information rates of multidimensional front-ends for digital storage channels with data-dependent transition noise. 1343-1347 - Joseph B. Soriaga, Paul H. Siegel, Jack K. Wolf, Marcus Marrow:
On achievable rates of multistage decoding on two-dimensional ISi channels. 1348-1352 - Naveen Singla, Joseph A. O'Sullivan
Joint equalization and decoding for nonlinear two-dimensional intersymbol interference channels. 1353-1357 - Marcos K. Aguilera, Ramaprabhu Janakiraman, Lihao Xu:
On the erasure recoverability of MDS codes under concurrent updates. 1358-1362 - Song-Nam Hong
Design of irregular concatenated zigzag codes. 1363-1366 - David Haley, Alex J. Grant
Improved reversible LDPC codes. 1367-1371 - Michael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Terminated LDPC convolutional codes with thresholds close to capacity. 1372-1376 - Guosen Yue, Ping Li
Low-rate generalized low-density parity-check codes with hadamard constraints. 1377-1381 - Aslan Tchamkerten, I. Emre Telatar:
On the universality of Burnashev's error exponent. 1382-1385 - Yangfan Zhong, Fady Alajaji, L. Lorne Campbell:
On the joint source-channel coding error exponent for systems with memory. 1386-1390 - Aslan Tchamkerten, I. Emre Telatar:
On the use of training sequences for channel estimation. 1391-1395 - Stark C. Draper
Sequential random binning for streaming distributed source coding. 1396-1400 - Andrew W. Eckford, Wei Yu:
Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes. 1401-1405 - Aaron B. Wagner, Venkat Anantharam:
An improved outer bound for the multiterminal source-coding problem. 1406-1410 - Ozgun Y. Bursalioglu, Ertem Tuncel
On optimal transforms and quantization schemes in gaussian distributed source coding. 1411-1415 - Daniel Hösli, Amos Lapidoth:
Monotonicity results for coherent single-user and multiple-access MIMO Rician channels. 1416-1420 - Daeyoung Park, Seung Young Park
Effect of transmit antenna correlation on multiuser diversity. 1421-1425 - Marios Kountouris, David Gesbert
Memory-based opportunistic multi-user beamforming. 1426-1430 - Boon Loong Ng, Jamie S. Evans
Transmit beamforming with cooperative base stations. 1431-1435 - Michael Kohler, Adam Krzyzak:
Rates of convergence for adaptive regression estimates with multiple hidden layer feedforward neural networks. 1436-1440 - Zhi-Quan Luo, Georgios B. Giannakis
Optimal linear decentralized estimation in a bandwidth constrained sensor network. 1441-1445 - Fredrik Brännström
Non-data-aided parameter estimation in an additive white gaussian noise channel. 1446-1450 - Sithamparanathan Kandeepan
Analysis of a discrete complex sinusoid frequency estimator based on single-delay multiplication method. 1451-1454 - Sidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros:
Correction of adversarial errors in networks. 1455-1459 - Paul Oprisan, Bella Bose:
Error correction with feedback for asymmetric errors. 1460-1463 - Alan M. Frieze, Ryan R. Martin
Identifying codes in random networks. 1464-1467 - Tze-Lei Poo, Brian H. Marcus:
Time-varying maximum transition run constraints. 1468-1472 - Kui Cai, Kees A. Schouhamer Immink:
On the design of efficient constrained parity-check codes for optical recording. 1473-1477 - Sharon Aviran, Paul H. Siegel, Jack K. Wolf:
Two-dimensional bit-stuffing schemes with multiple transformers. 1478-1482 - Kui Cai, Kees A. Schouhamer Immink:
On the number of encoder states for capacity approaching d = 1 codes. 1483-1487 - Wei Yu, Masoud Ardakani, Benjamin P. Smith, Frank R. Kschischang
Complexity-optimized low-density parity-check codes for gallager decoding algorithm B. 1488-1492 - Martin J. Wainwright
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. 1493-1497 - Andrew Thangaraj
On achieving capacity on the wire tap channel using LDPC codes. 1498-1502 - Wangrok Oh
Modified RA codes suitable for BPSK modulated systems with non-data-aided carrier recovery. 1503-1505 - Neri Merhav, Tsachy Weissman:
Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source. 1506-1510 - Rajesh Manakkal, Bixio Rimoldi:
A source-channel coding scheme for discrete memoryless channels with feedback. 1511-1515 - Ofer Shayevitz, Meir Feder:
Communicating using feedback over a binary channel with arbitrary noise sequence. 1516-1520 - Giuseppe Caire, Shlomo Shamai
An efficient scheme for reliable error correction with limited feedback. 1521-1525 - Wojciech Szpankowski:
One-to-one code and its anti-redundancy. 1526-1528 - Hervé Jégou, Christine Guillemot:
Entropy coding with variable length re-writing systems. 1529-1533 - Marco Dalai
Non prefix-free codes for constrained sequences. 1534-1538 - Farzad Rezaei, Charalambos D. Charalambous
Robust coding for uncertain sources: a minimax approach. 1539-1543 - Vasanthan Raghavan, Akbar M. Sayeed, Nigel Boston:
When is limited feedback for transmit beamforming beneficial? 1544-1548 - Wei Dai, Youjian Liu
On the information rate of MIMO systems with finite rate channel state feedback and power on/off strategy. 1549-1553 - Kin Kwong Leung, Chi Wan Sung
An optimal phase control algorithm for MISO systems with finite feedback. 1554-1557 - Hongyuan Zhang, Huaiyu Dai, Quan Zhou:
A geometrical analysis on transmit antenna selection for spatial multiplexing systems with linear receivers. 1558-1562 - Ioannis Kontoyiannis, Luis Alfonso Lastras-Montaño, Sean P. Meyn:
Relative entropy and exponential deviation bounds for general Markov chains. 1563-1567 - Youngchul Sung, Lang Tong, H. Vincent Poor:
Neyman-Pearson detection of Gauss-Markov signals in noise: closed-form error exponent and properties. 1568-1572 - Boris Ryabko, Jaakko Astola
Universal codes as a basis for nonparametric testing of serial independence for time series. 1573-1577 - Mehdi Molkaraie, Payam Pakzad:
On entropy decomposition and new bounds on the partition function. 1578-1582 - Wei Yu, Marko Aleksic:
Coding for the blackwell channel: a survey propagation approach. 1583-1587 - Gerhard Kramer
Progressive d-separating edge set bounds on network coding rates. 1588-1592 - Chandra Chekuri, Christina Fragouli, Emina Soljanin
On average throughput and alphabet size in network coding. 1593-1597 - Karin Rietjens, Berry Schoenmakers, Pim Tuyls:
Quantum information theoretical analysis of various constructions for quantum secret sharing. 1598-1602 - Kiyoshi Tamaki, Hoi-Kwong Lo:
Unconditionally secure key distillation from multi-photons in a single-photon polarization based quantum key distribution. 1603-1606 - Kai Chen, Hoi-Kwong Lo:
Conference key agreement and quantum sharing of classical secrets with noisy GHZ states. 1607-1611 - Karin Poels, Pim Tuyls, Berry Schoenmakers:
Generic security proof of quantum key exchange using squeezed states. 1612-1616 - Harm S. Cronie:
Sparse graph codes for multilevel modulation with signal shaping. 1617-1621 - Dariush Divsalar, Sam Dolinar, Christopher R. Jones:
Low-rate LDPC codes with simple protograph structure. 1622-1626 - Sam Dolinar:
A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening. 1627-1631 - Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin:
Girth analysis of Tanner's (3, 5) QC LDPC codes. 1632-1636 - Shengtian Yang
Some extensions of Gallager's method to general sources and channels. 1637-1640 - Hiroki Koga, Naoki Sato:
On an upper bound of the secrecy capacity for a general wiretap channel. 1641-1645 - Ingmar Land, Johannes B. Huber:
Information processing in ideal coding schemes with code-symbol decoding. 1646-1650 - Ioannis Kontoyiannis, Brian Lucena:
Mutual information, synergy and some curious phenomena for simple channels. 1651-1655 - Zihuai Lin
Joint source and channel coding using ring convolutional coded CPM. 1656-1660 - Sriram N. Kizhakkemadam, Panos Papamichalis, Mandyam D. Srinath, Dinesh Rajan:
Tradeoff between source and channel coding for erasure channels. 1661-1665 - Sorina Dumitrescu, Xiaolin Wu:
On the complexity of joint source-channel decoding of markov sequences over memoryless channels. 1666-1670 - Tim Holliday, Andrea J. Goldsmith:
Optimizing end-to-end distortion in MIMO systems. 1671-1675 - Ramy H. Gohary, Timothy N. Davidson
On efficient non-coherent detection of Grassmannian constellations. 1676-1680 - Karen Su, Ian J. Wassell:
Efficient MIMO detection by successive projection. 1681-1685 - Amin Mobasher
A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming. 1686-1690 - Joakim Jaldén
On the limits of sphere decoding. 1691-1695 - Fang Liu, Lee M. Garth:
Dynamic convergence analysis of adaptive nonlinear filters for narrowband interference rejection in spread spectrum systems. 1696-1700 - Holger Boche, Volker Pohl:
Spectral factorization, whitening- and estimation filter - stability, smoothness properties and FIR approximation behavior. 1701-1705 - Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal, Kannan Ramchandran:
Analysis of denoising by sparse approximation with random frame asymptotics. 1706-1710 - Gilbert Leung, Andrew R. Barron:
Combining least-squares regressions: an upper-bound on mean-squared error. 1711-1715 - Niranjan Ratnakar, Gerhard Kramer
On the separation of channel and network coding in aref networks. 1716-1719 - Yuval Cassuto, Jehoshua Bruck
Network coding for non-uniform demands. 1720-1724 - Anna H. Lee, Muriel Médard:
Simplified random network codes for multicast networks. 1725-1729 - Kapil Bhattad, Niranjan Ratnakar, Ralf Koetter, Krishna R. Narayanan:
Minimal network coding for multicast. 1730-1734 - Igor Devetak:
Distillation of local purity from quantum states. 1735-1739 - Andreas Klappenecker, Martin Rötteler:
Mutually unbiased bases are complex projective 2-designs. 1740-1744 - Stefan Wolf
Oblivious transfer and quantum non-locality. 1745-1748 - Assaf Naor, Jacques Verstraëte:
Improved bounds on the size of sparse parity check matrices. 1749-1752 - Wei Zhong, Huiqiong Chai, Javier Garcia-Frías
Approaching the shannon limit through parallel concatenation of regular LDGM codes. 1753-1757 - Moshe Schwartz
On the asymptotic performance of iterative decoders for product codes. 1758-1762 - Mohsen Bayati, Devavrat Shah, Mayank Sharma:
Maximum weight matching via max-product belief propagation. 1763-1767 - Saied Hemati, Amir H. Banihashemi, Calvin Plett:
A high-speed analog min-sum iterative decoder. 1768-1772 - Angel Lozano
Mercury/waterfilling: optimum power allocation with arbitrary input constellations. 1773-1777 - Asif Iqbal Mohammad, William Weeks IV:
Simulation-based estimation of the capacity of full-surface channels. 1778-1782 - Anant Sahai, Salman Avestimehr, Paolo Minero:
Anytime communication over the Gilbert-Eliot channel with noiseless feedback. 1783-1787 - Giacomo Como
Ensembles of codes over abelian groups. 1788-1792 - Jan Østergaard
n-channel asymmetric multiple-description lattice vector quantization. 1793-1797 - Hanying Feng:
Near separability of optimal multiple description source codes. 1798-1802 - Jun Chen, Chao Tian, Toby Berger, Sheila S. Hemami:
A new class of universal multiple description lattice quantizers. 1803-1807 - Luis Garcia Ordóñez, Alba Pagès-Zamora
Diversity and multiplexing tradeoff of multiple beamforming in MIMO channels. 1808-1812 - Abdelkader Medles, Dirk T. M. Slock:
Optimal diversity vs multiplexing tradeoff for frequency selective MIMO channels. 1813-1817 - Leif W. Hanlen
Optimal transmit covariance for MIMO channels with statistical transmitter side information. 1818-1822 - Hesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen:
The diversity-multiplexing-delay tradeoff in MIMO ARQ channels. 1823-1827 - Tarik Tabet, Sanket Dusad, Raymond Knopp:
Achievable diversity-multiplexing-delay tradeoff in half-duplex ARQ relay channels. 1828-1832 - Mokshay Madiman, Ioannis Kontoyiannis:
Concentration and relative entropy for compound Poisson distributions. 1833-1837 - Chandra Nair, Erik Ordentlich, Tsachy Weissman:
Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime. 1838-1842 - Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang:
Convergence of profile based estimators. 1843-1847 - Desmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros:
Further results on coding for reliable communication over packet networks. 1848-1852 - Payam Pakzad, Christina Fragouli, Amin Shokrollahi:
Coding schemes for line networks. 1853-1857 - Mikko Vehkaperä
A throughput-delay trade-off in packetized systems with erasures. 1858-1862 - Yalin Evren Sagduyu, Anthony Ephremides:
Crosslayer design for distributed MAC and network coding in wireless ad hoc networks. 1863-1867 - François Cayre, Caroline Fontaine, Teddy Furon:
A theoretical study of watermarking security. 1868-1872 - Kazuto Ogawa, Goichiro Hanaoka, Hideki Imai:
A secure traitor tracing scheme against key exposure. 1873-1877 - Simon McNicol, Serdar Boztas
Traitor tracing against powerful attacks. 1878-1882 - Maria de Lourdes M. G. Alcoforado
Turbo block codes for the binary adder channel. 1883-1887 - Zheng Zhang, Tolga M. Duman:
Capacity approaching turbo coding for half duplex relaying. 1888-1892 - Richard Demo Souza
Non-systematic turbo coding with unequal energy allocation for nonuniform memoryless sources. 1893-1897 - Gil I. Shamir, Joseph J. Boutros:
Non-systematic low-density parity-check codes for nonuniform sources. 1898-1902 - Anke Feiten, Rudolf Mathar:
Optimal power control for multiuser CDMA channels. 1903-1907 - Joon Ho Cho:
A continuous-time extension of welch~s lower bound on total squared correlation. 1908-1912 - Fung-Ling Chiu, Nam Yul Yu
Maximum correlation of binary signals over fading channels. 1913-1917 - Frederik Vanhaverbeke, Marc Moeneclaey:
Symmetric capacity of optimal sequences in quasi-scalable CDMA systems. 1918-1921 - Ilan Hen, Neri Merhav:
On the error exponent of trellis source coding. 1922-1926 - John C. Kieffer:
Perturbations in optimal trellis source code design. 1927-1931 - John B. Anderson, Norbert Goertz, Tomas Eriksson:
On the BCJR algorithm for rate-distortion source coding. 1932-1936 - Uri Erez, Gregory W. Wornell, Mitchell D. Trott:
Rateless space-time coding. 1937-1941 - Jian-Kang Zhang, Jing Liu, Kon Max Wong:
Linear toeplitz space time block codes. 1942-1946 - Youjian Liu
A lossless layered coding strategy for MIMO systems. 1947-1951 - Alexei Ashikhmin, A. Robert Calderbank:
Space-time Reed-Muller codes for noncoherent MIMO transmission. 1952-1956 - Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung:
Derivation of autocorrelation distributions of Sidel'nikov sequences using cyclotomic numbers. 1957-1961 - Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung:
Cyclotomic numbers of order 5 over Fpn. 1962-1966 - Shojiro Sakata:
Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithm. 1967-1971 - Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Coset distribution of triple-error-correcting binary primitive BCH codes. 1972-1976 - Tracey Ho, Ben Leong
Network monitoring in multicast networks using network coding. 1977-1981 - Elona Erez, Meir Feder:
Efficient network codes for cyclic networks. 1982-1986 - Michael Langberg, Alexander Sprintson
The encoding complexity of network coding. 1987-1991 - Terence H. Chan
On the optimality of group network codes. 1992-1996 - Honggang Hu, Lei Hu, Dengguo Feng:
A new class of binary sequences with low correlation and large linear complexity from function fields. 1997-2001 - Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy:
On almost perfect nonlinear mappings over Fn2. 2002-2006 - Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung:
On the linear complexity over Fp of M-ary Sidel'nikov sequences. 2007-2011 - Marc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai:
A unified analysis for the fast correlation attack. 2012-2015 - Markus A. Dangl, Christian Sgraja, Jürgen Lindner:
Block turbo equalization for imperfect channel state information. 2016-2020 - Qinghua Guo
Turbo equalization based on factor graphs. 2021-2025 - Craig E. Burnet, William G. Cowley:
Performance analysis of turbo equalization for nonlinear channels. 2026-2030 - Marcin Sikora, Daniel J. Costello Jr.:
A new SISO algorithm with application to turbo equalization. 2031-2035 - Jun Cheng, Koichi Kamoi, Yoichiro Watanabe:
Error-correcting signature code for multiple-access adder channel. 2036-2039 - Sándor Györi:
Signature coding for OR channel with asynchronous access. 2040-2044 - Gregory Cresp, Hans-Jürgen Zepernick
Combination Oppermann sequences for spread spectrum systems. 2045-2049 - Andrew Z. Tirkel
Matrix construction using cyclic shifts of a column. 2050-2054 - Kambiz Azarian, Young-Han Nam, Hesham El Gamal:
Multi-user diversity without transmitter CSI. 2055-2059 - Munish Goyal, Anurag Kumar
Delay optimal control algorithm for a multiaccess fading channel with peak power constraint. 2060-2064 - Anders Høst-Madsen, Aria Nosratinia
The multiplexing gain of wireless networks. 2065-2069 - Martin Haenggi
Outage and throughput bounds for stochastic wireless networks. 2070-2074 - Kiran T. Gowda, B. Sundar Rajan:
A systematic design of high-rate full-diversity space-frequency codes for MIMO-OFDM systems. 2075-2079 - Udupi Sripati, B. Sundar Rajan, Vummintala Shashidhar:
Full-diversity group space-time-frequency (GSTF) codes from cyclic codes. 2080-2084 - Hsiao-feng Lu, Mao-Ching Chiu:
Constructions of space-frequency codes for MIMO-OFDM systems. 2085-2089 - S. Gowrisankar, B. Sundar Rajan:
A rate-one full-diversity low-complexity space-time-frequency block code (STFBC) for 4-Tx MIMO-OFDM. 2090-2094 - Markus Grassl
New codes from chains of quasi-cyclic codes. 2095-2099 - Raffaele Mascella, Luca G. Tallini:
On symbol permutation invariant balanced codes. 2100-2104 - Alexander Kshevetskiy, Ernst M. Gabidulin:
The new construction of rank codes. 2105-2108 - Kazuyoshi Suzuki, Mamoru Shimizu, Toshihiko Kashiyama, Eiji Fujiwara:
A class of error control codes for M-spotty byte errors occurred in a limited number of bytes. 2109-2113 - Ahmad Khoshnevis, Ashutosh Sabharwal:
On the overhead-delay tradeoff in carrier sense collision channels. 2114-2118 - Aurélie C. Lozano, Sanjeev R. Kulkarni:
A wireless network can achieve maximum throughput without each node meeting all others. 2119-2123 - Michael Langberg, Alexander Sprintson
Staleness vs. waiting time in universal discrete broadcast. 2124-2128 - Raymond W. Yeung:
Fundamental tradeoff between burstiness and delay in traffic shaping. 2129-2132 - Chunxuan Ye, Prakash Narayan:
Secret key and private key constructions for simple multiterminal source models. 2133-2137 - Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiterminal channel models. 2138-2141 - Chunxuan Ye, Prakash Narayan:
The secret key~private key capacity region for three terminals. 2142-2146 - Jun Muramatsu
Secret key agreement under sampling attack. 2147-2151 - Patricio Parada, Richard E. Blahut:
Secrecy capacity of SIMO and slow fading channels. 2152-2155 - S. L. Fogal, Robert J. McEliece, Jeremy Thorpe:
Enumerators for protograph ensembles of LDPC codes. 2156-2160 - Vishwambhar Rathi:
On the asymptotic weight distribution of regular LDPC ensembles. 2161-2165 - Masanori Hirotomo, Masanori Mohri, Masakatu Morii:
A probabilistic computation method for the weight distribution of low-density parity-check codes. 2166-2170 - Tom Høholdt, Jørn Justesen, Bergtor Jonsson:
Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flipping. 2171-2173 - Ron Dabora, Sergio D. Servetto:
On the rates for the general broadcast channel with partially cooperating receivers. 2174-2178 - Masoud Sharif, Amir F. Dana, Babak Hassibi:
Differentiated rate scheduling for gaussian broadcast channels. 2179-2183 - Yossef Steinberg
Achievable rates for the broadcast channel with states known at the transmitter. 2184-2188 - Todd P. Coleman, Michelle Effros, Emin Martinian, Muriel Médard:
Rate-splitting for the deterministic broadcast channel. 2189-2192 - Guangyue Han, Brian H. Marcus:
Analyticity of entropy rate in families of hidden markov chains. 2193-2197 - Erik Ordentlich, Tsachy Weissman:
Approximations for the entropy rate of a hidden Markov process. 2198-2202 - Alon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang:
Innovation and pattern entropy of stationary processes. 2203-2207 - George M. Gemelos, Tsachy Weissman:
On the relationship between process and pattern entropy rate. 2208-2212 - Jochen Giese, Mikael Skoglund:
Space-time constellation design for partial CSI at the receiver. 2213-2217 - Shivratna Giri Srinivasan, Mahesh K. Varanasi:
Code design for the low SNR noncoherent MIMO block Rayleigh fading channel. 2218-2222 - Göran Lindell:
Some exact union bound results for maximum likelihood detection in MIMO systems. 2223-2227 - Irina Gancheva, Torleiv Kløve:
Codes for error detection, good or not good. 2228-2231 - Rossitza Dodunekova, Stefan M. Dodunekov:
Error detection with a class of q-ary two-weight codes. 2232-2235 - Victor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov
Unequal error protection explained by state-transition graphs. 2236-2240 - Georg Schmidt, Carolin Huppert, Martin Bossert:
Multitrial decoding of concatenated Reed-Solomon codes. 2241-2245 - Jang-Won Lee
Distributed algorithms for optimal rate-reliability tradeoff in networks. 2246-2250 - Brooke Shrader, Anthony Ephremides:
Broadcast stability in random access. 2251-2255 - Jie Luo, Anthony Ephremides:
On the throughput, capacity and stability regions of random multiple access over standard multi-packet reception channels. 2256-2260 - K. C. V. Kalyanarama Sesha Sayee, Utpal Mukherji:
Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decoding. 2261-2265 - Tadashi Wadayama:
An authentication scheme based on an low-density parity-check matrix. 2266-2269 - Andreas J. Winter
Secret, public and quantum correlation cost of triples of random variables. 2270-2274 - Hideyuki Sakai, Hirosuke Yamamoto
Asymptotic optimality of tree-based group key management schemes. 2275-2279 - Darko Kirovski:
Collusion of fingerprints via the gradient attack. 2280-2284 - Lan Lan, Lingqi Zeng, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings. 2285-2289 - Masaya Fujisawa, Shojiro Sakata:
A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8. 2290-2294 - Norifumi Kamiya
High-rate quasi-cyclic low-density parity-check codes derived from finite affine planes. 2295-2299 - Kenneth S. Andrews, Sam Dolinar, Jeremy Thorpe:
Encoders for block-circulant LDPC codes. 2300-2304 - Seho Myung, Kyeongcheol Yang:
Extension of quasi-cyclic LDPC codes by lifting. 2305-2309 - Nihar Jindal:
High SNR analysis of MIMO broadcast channels. 2310-2314 - Amir F. Dana, Babak Hassibi:
The capacity region of multiple input erasure broadcast channels. 2315-2319 - Peter W. C. Chan, Roger Shu-Kwan Cheng
Reduced-complexity power allocation in zeroforcing MIMO-OFDM downlink system with multiuser diversity. 2320-2324 - Alireza Bayesteh, Amir K. Khandani:
On the user selection for MIMO broadcast channels. 2325-2329 - Cheng Huang, Lihao Xu:
Optimal broadcast scheduling for random-loss channels. 2330-2334 - Wei-Hsin Gu, Michelle Effros:
Source coding for a simple multi-hop network. 2335-2339 - Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú:
A universal lossless compressor with side information based on context tree weighting. 2340-2344 - Toshiyasu Matsushima, Shigeichi Hirasawa:
Bayes universal coding algorithm for side information context tree models. 2345-2348 - En-Hui Yang, Da-ke He
String matching-based universal source codes for source networks with asymptotically zero feedback. 2349-2353 - Ori Shental, Noam Shental, Shlomo Shamai
On the achievable information rates of finite-state input two-dimensional channels with memory. 2354-2358 - Tatsuto Murayama
On the asymptotic properties of sparse matrix codes in the CEO problem. 2359-2363 - Hiroki Suyari
Mathematical structures derived from the q-product uniquely determined by tsallis entropy. 2364-2368 - Nicolas Macris:
Correlation inequalities: a useful tool in the theory of LDPC codes. 2369-2373 - Ambedkar Dukkipati, Narasimha Murty Musti, Shalabh Bhatnagar
Properties of Kullback-Leibler cross-entropy minimization in nonextensive framework. 2374-2378 - Victor Buttigieg, Rennie Deguara:
Using variable-length error-correcting codes in MPEG-4 video. 2379-2383 - Jian-Qin Liu, Katsunori Shimohara:
On designing error-correctable codes by biomolecular computation. 2384-2388 - Geert Van Meerbergen, Marc Moonen, Hugo De Man:
Filterbank decompositions for BCH-codes with applications to soft decoding and code division multiple acces systems. 2389-2393 - Grzegorz Malewicz:
Toward a theory of avalanche-creating and error-controlling encoding schemes. 2394-2398
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-04 20:30 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: