default search action
IEEE Transactions on Information Theory, Volume 56
Volume 56, Number 1, January 2010
- Robert G. Gallager, Baris Nakiboglu
:
Variations on a theme by Schalkwijk and Kailath. 6-17 - Tyrone E. Duncan:
Mutual information for stochastic signals and Lévy processes. 18-24 - Krishnan Eswaran, Anand D. Sarwate
Zero-rate feedback can achieve the empirical capacity. 25-39 - Raúl Hernán Etkin, Neri Merhav, Erik Ordentlich:
Error exponents of optimum decoding for the interference channel. 40-56 - Young-Han Kim:
Feedback capacity of stationary Gaussian channels. 57-85 - Adam Kirsch, Eleni Drinea:
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications. 86-102 - Sarah Spence Adams, Nathaniel J. Karst
The final case of the decoding delay problem for maximum rate complex orthogonal designs. 103-112 - Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace polynomials and limits to list decoding of Reed-Solomon codes. 113-120 - Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Victor V. Zyablov
Woven graph codes: asymptotic performances and examples. 121-129 - Yaotsu Chang, Chong-Dao Lee
Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula. 130-139 - Yeow Meng Chee
Linear size optimal q-ary constant-weight codes and constant-composition codes. 140-151 - Mao-Ching Chiu:
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes. 152-167 - Ngoc-Dung Dào, Chintha Tellambura:
Semiorthogonal space-time block codes. 168-180 - Lara Dolecek, Zhengya Zhang
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. 181-201 - Stefania Fanali, Massimo Giulietti
One-point AG codes on the GK maximal curves. 202-210 - Paul D. Fiore:
Scale-recursive lattice-based multiple-access symbol constellations. 211-223 - Zhenming Liu, Michael Mitzenmacher:
Codes for deletion and insertion channels with segmented errors. 224-232 - Jin Lu, José M. F. Moura:
Linear time encoding of LDPC codes. 233-249 - Frédérique E. Oggier, Babak Hassibi:
Cyclic distributed space-time codes for wireless relay networks with no channel information. 250-265 - Josep Rifà
New completely regular q-ary codes based on Kronecker products. 266-272 - Sudharshan Srinivasan, Steven S. Pietrobon:
Decoding of high rate convolutional codes using the dual trellis. 273-295 - Chung-Hsuan Wang, Mao-Ching Chiu, Chi-Chao Chao:
On unequal error protection of convolutional codes from an algebraic perspective. 296-315 - Wei Zhang, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Braided convolutional codes: a new class of turbo-like codes. 316-331 - Kapil Bhattad, Krishna R. Narayanan:
A note on the rate of decay of mean-squared error with SNR for the AWGN channel. 332-335 - Marco Chiani
MIMO networks: the effects of interference. 336-349 - Anand K. Dhulipala, Christina Fragouli, Alon Orlitsky:
Silence-based communication. 350-366 - Giuseppe Durisi
Noncoherent capacity of underspread fading channels. 367-395 - Matthew R. McKay
Achievable sum rate of MIMO MMSE receivers: a general analytic framework. 396-410 - Raghuraman Mudumbai, João Pedro Hespanha, Upamanyu Madhow, Gwen Barriac:
Distributed transmit beamforming using feedback control. 411-426 - Ayfer Özgür
Information-theoretic operating regimes of large wireless networks. 427-437 - Prahladh Harsha
The communication complexity of correlation. 438-449 - Tian Tian, Wen-Feng Qi:
2-adic complexity of binary m-sequences. 450-454 - Frederik Vercauteren
Optimal pairings. 455-461 - Aram W. Harrow
Time reversal and exchange symmetries of unitary gate capacities. 462-475 - Peiyu Tan, Jing Li:
Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions. 476-491 - Mehmet Akçakaya
Shannon-theoretic limits on noisy compressive sampling. 492-504 - Yonina C. Eldar, Holger Rauhut
Average case analysis of multichannel sparse recovery using convex relaxation. 505-519 - Joel A. Tropp
Beyond Nyquist: efficient sampling of sparse bandlimited signals. 520-544 - Noga Alon, Simon Litsyn, Alexander Shpunt:
Typical peak sidelobe level of binary sequences. 545-554 - Qun-Xiong Zheng, Wen-Feng Qi:
Distribution properties of compressing sequences derived from primitive sequences over Z/(pe). 555-563 - Saurabha Tavildar, Pramod Viswanath, Aaron B. Wagner:
The Gaussian many-help-one distributed source coding problem. 564-581 - Qasim M. Chaudhari, Erchin Serpedin, Jang-Sub Kim:
Energy-efficient estimation of clock offset for inactive nodes in wireless sensor networks. 582-596 - Marie Sauvé:
Piecewise polynomial estimation of a regression function. 597-613 - Carlo Bardaro
Prediction by samples from the past with error estimates covering discontinuous signals. 614-633 - Kyomin Jung, Devavrat Shah, Jinwoo Shin:
Distributed averaging via lifted Markov chains. 634-647
Volume 56, Number 2, February 2010
- Olgica Milenkovic, Gil Alterovitz, Gerard Battail, Todd P. Coleman
Introduction to the special issue on information theory in molecular biology and neuroscience. 649-652 - Don H. Johnson:
Information theory and neural information processing. 653-666 - David J. Galas, Matti Nykter, Gregory W. Carter, Nathan D. Price
Biological information as set-based complexity. 667-677 - Gerard Battail:
Heredity as an encoded communication process. 678-687 - Haris Vikalo, Babak Hassibi, Arjang Hassibi:
Limits of performance of quantitative polymerase chain reaction systems. 688-695 - Pavol Hanus, Janis Dingel, Georg Chalkidis, Joachim Hagenauer:
Compression of whole genome alignments. 696-705 - Yaniv Erlich, Assaf Gordon, Michael Brand
Compressed genotyping. 706-723 - Xiaomeng Shi, Desmond S. Lun, Muriel Médard, Ralf Kötter, James C. Meldrim, Andrew J. Barry:
Joint base-calling of two DNA sequences with factor graphs. 724-733 - Joan Maynou, Joan-Josep Gallardo-Chacón, Montserrat Vallverdú, Pere Caminal, Alexandre Perera
Computational detection of transcription factor binding sites through differential Rényi entropy. 734-741 - Faruck Morcos
Belief propagation estimation of protein and domain interactions using the sum-product algorithm. 742-755 - Andrzej K. Brodzik
Rapid sequence homology assessment by subsampling the genome space using difference sets. 756-770 - Lorenzo Galleani, Roberto Garello
The minimum entropy mapping spectrum of a DNA sequence. 771-783 - Amin Zollanvari
Joint sampling distribution between actual and estimated classification errors for linear discriminant analysis. 784-804 - Igor Zinovik, Yury Chebiryak, Daniel Kroening
Periodic orbits and equilibria in glass models for gene regulatory networks. 805-820 - Aurel A. Lazar
Population encoding with Hodgkin-Huxley neurons. 821-837 - Prapun Suksompong
Capacity analysis for integrate-and-fire neurons with descending action potential thresholds. 838-851 - Toby Berger, William B. Levy:
A mathematical theory of energy efficient neural computation and communication. 852-874 - Mehdi Aghagolzadeh, Seif Eldawlatly
Synergistic coding by cortical neural ensembles. 875-889 - Michael Gastpar, Patrick R. Gill, Alexander G. Huth, Frédéric E. Theunissen:
Anthropic correction of information estimates and its application to neural coding. 890-900 - Albert E. Parker, Alexander G. Dimitrov
Symmetry breaking in soft clustering decoding of neural codes. 901-927 - Mark D. McDonnell
A channel model for inferring the optimal number of electrodes for future cochlear implants. 928-940
Volume 56, Number 3, March 2010
- Jason Bellorado, Aleksandar Kavcic:
Low-complexity soft-decoding algorithms for Reed-Solomon codes-part I: an algebraic soft-in hard-out chase decoder. 945-959 - Jason Bellorado, Aleksandar Kavcic, Marcus Manow, Li Ping
Low-complexity soft-decoding algorithms for Reed-Solomon codes-part II: soft-input soft-output iterative decoding. 960-967 - Flavio Chierichetti, Hilary K. Finucane, Zhenming Liu, Michael Mitzenmacher:
Designing floating codes for expected performance. 968-978 - Noha Elarief, Bella Bose:
Optimal, systematic, q-ary codes correcting all asymmetric and symmetric errors of limited magnitude. 979-983 - Daniel M. Gordon, Victor S. Miller, Peter Ostapenko:
Optimal hash functions for approximate matches on the n-cube. 984-991 - Chun-Hao Hsu, Achilleas Anastasopoulos:
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding. 992-1006 - Yuan Luo, A. J. Han Vinck, Yanling Chen:
On the optimum distance profiles about linear block codes. 1007-1014 - Robby G. McKilliam
Linear-time nearest point algorithms for coxeter lattices. 1015-1022 - Irina Naydenova, Torleiv Kløve:
Some necessary conditions for codes to be good for error detection. 1023-1027 - Moshe Schwartz
On the capacity of the precision-resolution system. 1028-1037 - Shumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar, Zhi Ding
Burst decoding of cyclic codes based on circulant parity-check matrices. 1038-1047 - Julien Dumont, Walid Hachem, Samson Lasaulce, Philippe Loubaton, Jamal Najim:
On the capacity achieving covariance matrix for Rician MIMO channels: an asymptotic approach. 1048-1069 - Fernando Pérez-Cruz
MIMO Gaussian channels with arbitrary inputs: optimal precoding and power allocation. 1070-1084 - Dominik Seethaler, Helmut Bölcskei:
Performance and complexity analysis of infinity-norm sphere-decoding. 1085-1105 - Songsri Sirianunpiboon, Yiyue Wu, A. Robert Calderbank, Stephen D. Howard:
Fast optimal decoding of multiplexed orthogonal designs by conditional optimization. 1106-1113 - Giorgio Taricco
Optimum receiver design and performance analysis of arbitrarily correlated Rician fading MIMO channels with imperfect channel state information. 1114-1134 - Genyuan Wang, Weifeng Su, Xiang-Gen Xia:
Orthogonal-like space-time-coded CPM systems with fast decoding for three and four transmit antennas. 1135-1146 - Dian-Wu Yue, Q. T. Zhang:
Generic approach to the performance analysis of correlated transmit/receive diversity MIMO systems with/without co-channel interference. 1147-1157 - Tobias Koch
Gaussian fading is the worst fading. 1158-1165 - Yin Sun, Árpád Baricz, Shidong Zhou:
On the monotonicity, log-concavity, and tight bounds of the generalized marcum and nuttall Q-functions. 1166-1186 - Antonia M. Tulino
Capacity of channels with frequency-selective and time-selective fading. 1187-1215 - Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes. 1216-1229 - Konstantinos Drakakis, Verónica Requena, Gary McGuire:
On the nonlinearity of exponential welch costas functions. 1230-1238 - Antoine Joux:
On the security of blockwise secure modes of operation beyond the birthday bound. 1239-1246 - Jean-Marie Le Bars, Alfredo Viola:
Equivalence classes of Boolean functions for first-order correlation. 1247-1261 - Weiming Zhang, Xinpeng Zhang, Shuozhong Wang:
Near-optimal codes for information embedding in gray-scale signals. 1262-1270 - Konstantinos Drakakis:
On the hops present in costas permutations. 1271-1277 - Xiaohu Tang, Guang Gong:
New constructions of binary sequences with optimal autocorrelation value/magnitude. 1278-1286 - Guangyue Han, Brian H. Marcus:
Asymptotics of entropy rate in special families of hidden Markov chains. 1287-1295 - Danilo Silva
Communication over finite-field matrix channels. 1296-1305 - Arthur L. da Cunha, Minh N. Do
On the information rates of the plenoptic function. 1306-1321 - Maria Fresia, Giuseppe Caire:
A linear encoding approach to index assignment in lossy source-channel coding. 1322-1344 - Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes. 1345-1350 - Martin J. Wainwright
Lossy source compression using low-density generator matrix codes: analysis and algorithms. 1351-1368 - Ayfer Özgür
Throughput-delay tradeoff for hierarchical cooperation in ad hoc wireless networks. 1369-1377 - Vitaly Skachek:
Recursive code construction for random networks. 1378-1382 - Gongguo Tang, Arye Nehorai:
Performance analysis for sparse support recovery. 1383-1399 - Neri Merhav, Dongning Guo, Shlomo Shamai
Statistical physics of signal estimation in Gaussian noise: theory and examples of phase transitions. 1400-1416 - Adil M. Bagirov
An L2-boosting algorithm for estimation of a regression function. 1417-1429 - Daniil Ryabko, Boris Ryabko:
Nonparametric statistical inference for ergodic processes. 1430-1435 - Zhou Zhou, Zhiwei Xu
Long-term prediction intervals of time series. 1436-1446 - Francesco Buscemi
The quantum capacity of channels with arbitrarily correlated noise. 1447-1460 - Soraya Taghavi, Robert L. Kosut, Daniel A. Lidar
Channel-optimized quantum error correction. 1461-1473
Volume 56, Number 4, April 2010
- Laura Cottatellucci, Ralf R. Müller, Mérouane Debbah:
Asynchronous CDMA systems with random spreading-part I: fundamental limits. 1477-1497 - Laura Cottatellucci, Ralf R. Müller, Mérouane Debbah:
Asynchronous CDMA systems with random spreading-part II: design criteria. 1498-1520 - Alberto Perotti
Capacity-achieving CPM schemes. 1521-1541 - Erwin Riegler, Giorgio Taricco
Asymptotic statistics of the mutual information for spatially correlated rician fading MIMO channels with interference. 1542-1559 - Ram Somaraju, Jochen Trumpf
Degrees of freedom of a communication channel: using DOF singular values. 1560-1573 - Marc André Armand:
A note on interleaved Reed-Solomon codes over Galois rings. 1574-1581 - Yuval Cassuto, Moshe Schwartz
Codes for asymmetric limited-magnitude errors with application to multilevel flash memories. 1582-1595 - Yeow Meng Chee
New constant-weight codes from propagation rules. 1596-1599 - Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin:
On trapping sets and guaranteed error correction capability of LDPC codes and GLDPC codes. 1600-1611 - Masaaki Harada, Michael Kiermaier, Alfred Wassermann, Radinka Yorgova:
New binary singly even self-dual codes. 1612-1617 - Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
A rate R = 5/20 hypergraph-based woven convolutional code with free distance 120. 1618-1623 - Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2D constraints using Rayleigh quotients. 1624-1639 - Andrew McGregor, Olgica Milenkovic:
On the hardness of approximating stopping and trapping sets. 1640-1650 - Enrico Paolini
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel. 1651-1672 - Jos H. Weber, Kees A. Schouhamer Immink:
Knuth's balanced codes revisited. 1673-1679 - Shixin Zhu, Yu Wang, Minjia Shi:
Some results on cyclic codes over F2 + UpsilonF2. 1680-1684 - Jin-Ho Chung, Kyeongcheol Yang:
Optimal frequency-hopping sequences with new parameters. 1685-1693 - Cunsheng Ding
The cross-correlation of binary sequences with optimal autocorrelation. 1694-1701 - Honggang Hu, Guang Gong:
New sets of zero or low correlation zone sequences via interleaving techniques. 1702-1713 - Ming Su, Arne Winterhof
Autocorrelation of Legendre-Sidelnikov sequences. 1714-1718 - Zhe-Xian Wan, Kai Zhou:
Strict optimal rational approximants of multisequences. 1719-1728 - Qi Wang
Optimal sets of frequency hopping sequences with large linear spans. 1729-1736 - Shirin Jalali, Sergio Verdú, Tsachy Weissman:
A universal scheme for Wyner-Ziv coding of discrete sources. 1737-1750 - Satish Babu Korada, Rüdiger L. Urbanke:
Polar codes are optimal for lossy source coding. 1751-1768 - Jayanth Nayak, Ertem Tuncel
Successive refinement of vector sources under individual distortion criteria. 1769-1781 - Jayanth Nayak, Ertem Tuncel
Wyner-Ziv coding over broadcast channels: digital schemes. 1782-1799 - Artyom Sharov, Ron M. Roth:
Two-dimensional constrained coding based on tiling. 1800-1807 - En-Hui Yang, Da-ke He:
Interactive encoding and decoding for one way learning: near lossless recovery with side information at the decoder. 1808-1824 - Venkat Anantharam:
Counterexamples to a proposed stam inequality on finite groups. 1825-1827 - Ron Dabora, Andrea J. Goldsmith:
The capacity region of the degraded finite-state broadcast channel. 1828-1851 - Amos Lapidoth, Stephan Tinguely:
Sending a bivariate Gaussian source over a Gaussian MAC with feedback. 1852-1864 - Ruoheng Liu, Tie Liu, H. Vincent Poor
A vector generalization of costa's entropy-power inequality with applications. 1865-1879 - Ivana Maric
Bandwidth and power allocation for cooperative strategies in Gaussian relay networks. 1880-1889 - Parimal Parag
Queueing analysis of a butterfly network for comparing network coding to classical routing. 1890-1908 - Chih-Chun Wang:
Pruning network coding traffic by network coding: a new class of max-flow algorithms. 1909-1929 - S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Gerhard Kramer
On the multimessage capacity region for undirected ring networks. 1930-1947 - Sergey Loyka, Victoria Kostina
Error rates of the maximum-likelihood detector for arbitrary constellations: convex/concave behavior and applications. 1948-1960 - Vasanthan Raghavan, Venugopal V. Veeravalli:
Quickest change detection of a Markov process across a sensor array. 1961-1981 - Richard G. Baraniuk, Volkan Cevher
Model-based compressive sensing. 1982-2001 - David L. Donoho, Jared Tanner:
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling. 2002-2016 - Jüri Lember, Alexey A. Koloydenko:
A constructive proof of the existence of Viterbi processes. 2017-2033 - Gérard Biau, Frédéric Cérou, Arnaud Guyader:
Rates of convergence of the functional k-nearest neighbor estimate. 2034-2040 - Ciamac Cyrus Moallemi, Benjamin Van Roy:
Convergence of min-sum message-passing for convex optimization. 2041-2050
Volume 56, Number 5, May 2010
- Emmanuel J. Candès, Terence Tao:
The power of convex relaxation: near-optimal matrix completion. 2053-2080 - Taher Abualrub
On the construction of skew quasi-cyclic codes. 2081-2090 - Stefka Bouyuklieva
Automorphisms of extremal self-dual codes. 2091-2096 - Maximilien Gadouleau, Zhiyuan Yan:
Packing and covering properties of subspace codes for error control in random linear network coding. 2097-2108 - Jong Yoon Hyun:
A bound on equitable partitions of the hamming space. 2109-2111 - Anxiao Jiang, Moshe Schwartz
Correcting charge-constrained errors in the rank-modulation scheme. 2112-2120 - Hsiao-feng Lu, Camilla Hollanti:
Optimal diversity-multiplexing tradeoff and code constructions of some constrained asymmetric MIMO systems. 2121-2129 - Jinquan Luo, Yuansheng Tang, Hongyu Wang:
Cyclic codes and sequences: the generalized Kasami case. 2130-2142 - Jun Muramatsu
Hash property and coding theorems for sparse matrices and maximum-likelihood coding. 2143-2167 - Tadashi Wadayama:
On the undetected error probability of binary matrix ensembles. 2168-2176 - Jianmin Wang, Jianxing Yin:
Two-dimensional optical orthogonal codes and semicyclic group divisible designs. 2177-2187 - Hui Zhang, Gennian Ge:
Optimal ternary constant-weight codes of weight four and distance six. 2188-2203 - Shi Jin, Matthew R. McKay
Ergodic capacity analysis of amplify-and-forward MIMO dual-hop systems. 2204-2224 - Shivaprasad Kotagiri, J. Nicholas Laneman:
Variations on information embedding in multiple access and broadcast channels. 2225-2240 - Nathan Levy, Shlomo Shamai
Information theoretic aspects of users' activity in a Wyner-like cellular model. 2241-2248 - Urs Niesen, Piyush Gupta, Devavrat Shah:
The balanced unicast and multicast capacity regions of large wireless networks. 2249-2271 - Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative relaying with state available noncausally at the relay. 2272-2298 - José A. Adell, Alberto Lekuona, Yaming Yu:
Sharp bounds on the entropy of the poisson law and related quantities. 2299-2306 - Yury Polyanskiy, H. Vincent Poor
Channel coding rate in the finite blocklength regime. 2307-2359 - Santosh Kumar
Random matrix model for Nakagami-Hoyt fading. 2360-2372 - Khoa D. Nguyen
Outage exponents of block-fading channels with power allocation. 2373-2381 - Xin Wang
Stochastic resource allocation over fading multiple access and broadcast channels. 2382-2391 - Avi Steiner, Shlomo Shamai
On queueing and multilayer coding. 2392-2415 - Vijay G. Subramanian
Joint scheduling and resource allocation in CDMA systems. 2416-2432 - Holger Boche, Ullrich J. Mönich:
Behavior of the quantization operator for bandlimited, nonoversampled signals. 2433-2440 - Vivek F. Farias, Ciamac Cyrus Moallemi, Benjamin Van Roy, Tsachy Weissman:
Universal reinforcement learning. 2441-2454 - Daniel Marco, David L. Neuhoff:
Entropy of highly correlated quantized data. 2455-2478 - Chung-Yi Chang, Ying Li, Jonathan Hirata:
New 64-QAM Golay complementary sequences. 2479-2485 - Andrew Klapper:
Expected pi-adic security measures of sequences. 2486-2501 - Shu Yang, Eric D. Kolaczyk:
Target detection via network filtering. 2502-2515 - Ewout van den Berg, Michael P. Friedlander:
Theoretical and empirical results for recovery from multiple measurements. 2516-2527 - Sungwook Kim, Jung Hee Cheon:
Parameterized splitting systems for the discrete logarithm. 2528-2535
Volume 56, Number 6, June 2010
- Kenji Yasunaga, Toru Fujiwara:
On correctable errors of binary linear codes. 2537-2548 - Daniel J. J. Versfeld
On systematic generator matrices for Reed-Solomon codes. 2549-2550 - Itzhak Tamo, Moshe Schwartz
Correcting limited-magnitude errors in the rank-modulation scheme. 2551-2560 - Ido Tal, Ron M. Roth:
Bounds on the rate of 2-D bit-stuffing encoders. 2561-2567 - Asha Rao
A family of two-weight irreducible cyclic codes. 2568-2570 - Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps:
The perfect binary one-error-correcting codes of length 15: part II-properties. 2571-2582 - Shachar Lovett
Holes in generalized Reed-Muller codes. 2583-2586 - Kwankyu Lee
Algebraic soft-decision decoding of Hermitian codes. 2587-2600 - Ghassan M. Kraidy, Nicolas Gresset, Joseph Jean Boutros:
Coding for the nonorthogonal amplify-and-forward cooperative channel. 2601-2610 - Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai, Wen-Guey Tzeng:
Permutation arrays under the Chebyshev distance. 2611-2617 - Silas L. Fong
Variable-rate linear network coding. 2618-2625 - Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin:
Error correction capability of column-weight-three LDPC codes under the Gallager A algorithm-Part II. 2626-2639 - Lei Zhao, Haim H. Permuter
Zero-error feedback capacity of channels with state information via dynamic programming. 2640-2650 - Sergio Verdú, Shlomo Shamai
Variable-rate channel capacity. 2651-2667 - Seyed Saeed Changiz Rezaei, Shahab Oveis Gharan, Amir K. Khandani:
Relay scheduling in the half-duplex Gaussian parallel relay channel. 2668-2687 - Jun Muramatsu
Hash property and fixed-rate universal coding theorems. 2688-2698 - Mokshay M. Madiman, Prasad Tetali:
Information inequalities for joint distributions, with interpretations and applications. 2699-2713 - Amos Lapidoth, Stephan Tinguely:
Sending a bivariate Gaussian over a Gaussian MAC. 2714-2752 - Dario Fertonani, Tolga M. Duman
Novel bounds on the capacity of the binary deletion channel. 2753-2765 - Salem Said, Christian Lageman, Nicolas Le Bihan
Decompounding on compact lie groups. 2766-2777 - Gábor Molnár-Sáska, Gusztáv Morvai:
Intermittent estimation for Gaussian processes. 2778-2782 - Hana Godrich, Alexander M. Haimovich, Rick S. Blum
Target localization accuracy gain in MIMO radar-based systems. 2783-2803 - Pedro Comesaña
Asymptotically optimum universal watermark embedding and detection in the high-SNR regime. 2804-2815 - Hajar Mahdavi-Doost, Masoud Ebrahimi, Amir K. Khandani:
Characterization of SINR region for interfering links with constrained power. 2816-2828 - Arun Pachai Kannu, Philip Schniter
On the spectral efficiency of noncoherent doubly selective block-fading channels. 2829-2844 - Giuseppe Caire, Nihar Jindal, Mari Kobayashi, Niranjay Ravindran:
Multiuser MIMO achievable rates with downlink training and channel state. 2845-2866 - Peng-Jun Wan, Chih-Wei Yi
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks. 2867-2874 - Jordi Ros, Wei Kang Tsai:
A lexicographic optimization framework to the flow control problem. 2875-2886 - Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides:
Random access in wireless networks with overlapping cells. 2887-2892 - Qasim M. Chaudhari, Erchin Serpedin, Khalid A. Qaraqe
On minimum variance unbiased estimation of clock offset in a two-way message exchange mechanism. 2893-2904 - Haim H. Permuter
Two-way source coding with a helper. 2905-2919 - Mohammadali Khosravifard
A Kraft-type sufficient condition for the existence of D-ary fix-free codes. 2920-2927 - Michael Drmota, Yuriy A. Reznik, Wojciech Szpankowski:
Tunstall code, Khodak variations, and random walks. 2928-2937 - Long Wang, Keqin Feng, San Ling
Asymmetric quantum codes: characterization and constructions. 2938-2945 - Frédéric Dupuis
A father protocol for quantum broadcast channels. 2946-2956 - Branislav M. Popovic, Oskar Mauritz:
Generalized chirp-like sequences with zero correlation zone. 2957-2960 - Elena Dubrova:
Finding matching initial states for equivalent NLFSRs in the Fibonacci and the Galois configurations. 2961-2966 - Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
Information-theoretic limits on sparse signal recovery: dense versus sparse measurement matrices. 2967-2979 - Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh
Matrix completion from a few entries. 2980-2998 - Ronghui Tu, Yongyi Mao
Is SP BP? 2999-3032 - Elmar Diederichs, Anatoli B. Juditsky, Vladimir G. Spokoiny
Sparse non-Gaussian component analysis. 3033-3047 - Qichun Wang, Jie Peng, Haibin Kan, Xiangyang Xue:
Constructions of cryptographically significant boolean functions using primitive polynomials. 3048-3053
Volume 56, Number 7, July 2010
- Shraga I. Bross, Amos Lapidoth, Stephan Tinguely:
Broadcasting correlated Gaussians. 3057-3068 - Michelle Effros, Andrea J. Goldsmith, Yifan Liang:
Generalizing capacity: new definitions and capacity theorems for composite channels. 3069-3087 - Ashish Khisti, Gregory W. Wornell:
Secure transmission with multiple antennas I: the MISOME wiretap channel. 3088-3104 - Anand D. Sarwate
Rateless codes for AVC models. 3105-3114 - Avi Steiner, Amichai Sanderovich, Shlomo Shamai
The multisession multilayer broadcast approach for two cooperating receivers: how many sessions are required? 3115-3138 - Roy Timo, Kim L. Blackmore
Word-valued sources: an ergodic theorem, an AEP, and the conservation of entropy. 3139-3148 - Yaming Yu:
Squeezing the Arimoto-Blahut algorithm for faster convergence. 3149-3157 - Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. 3158-3165 - Peter Beelen
Affine Grassmann codes. 3166-3176 - Mathieu Bogaerts:
Isometries and construction of permutation arrays. 3177-3179 - Allan De Oliveira Moura, Marcelo Firer:
Duality for poset codes. 3180-3186 - Salim Y. El Rouayheb, Alexander Sprintson
On the index coding problem and its relation to network coding and matroid theory. 3187-3195 - Yuichiro Fujiwara
A combinatorial approach to X-tolerant compaction circuits. 3196-3206 - Maximilien Gadouleau, Zhiyuan Yan:
Constant-rank codes and their connection to constant-dimension codes. 3207-3216 - Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh:
Optimal single deletion correcting code of length four over an alphabet of even size. 3217-3220 - G. Susinder Rajan, B. Sundar Rajan:
Multigroup ML decodable collocated and distributed space-time block codes. 3221-3247 - Christian Schlegel, Shuai Zhang:
On the dynamics of the error floor behavior in (regular) LDPC codes. 3248-3264 - Kenneth W. Shum, Wing Shing Wong, Chung Shue Chen:
A general upper bound on the size of constant-weight conflict-avoiding codes. 3265-3276 - Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn
A separation algorithm for improved LP-decoding of linear block codes. 3277-3289 - Luis Javier García-Villalba
On the efficiency of shortened cyclic single-burst-correcting codes. 3290-3296 - Syed Ali Jafar
Generalized degrees of freedom of the symmetric Gaussian K user interference channel. 3297-3303 - Tùng T. Kim, Mikael Skoglund:
On the DMT-optimality of nondynamic DF relaying in asymmetric Nakagami fading channels. 3304-3309 - Vaneet Aggarwal
Power-controlled feedback and training for two-way MIMO channels. 3310-3331 - Namyoon Lee
Degrees of freedom of the MIMO Y channel: signal space alignment for network coding. 3332-3342 - Kin Kwong Leung, Chi Wan Sung
Optimal phase control for equal-gain transmission in MIMO systems with scalar quantization: complexity and algorithms. 3343-3355 - Olivier Lévêque, Christophe Vignat, Melda Yüksel
Diversity-multiplexing tradeoff for the MIMO static half-duplex relay. 3356-3368 - Zhihua Shi, Wei Xu, Shi Jin, Chunming Zhao, Zhi Ding
On wireless downlink scheduling of MIMO systems with homogeneous users. 3369-3377 - Majid Nasiri Khormuji, Mikael Skoglund:
On instantaneous relaying. 3378-3394 - Bilal Sadiq, Gustavo de Veciana:
Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler. 3395-3412 - Feng Xue, Jun Shi:
On the product-determinant-sum of central Wishart matrices and its application to wireless networks. 3413-3421 - Han-I Su, Abbas El Gamal:
Distributed lossy averaging. 3422-3437 - Nikolai K. Vereshchagin
Rate distortion and denoising of individual data using Kolmogorov complexity. 3438-3454 - Simon Pierre Desrosiers, Frédéric Dupuis
Quantum entropic security and approximate quantum encryption. 3455-3464 - Vittorio Giovannetti
Quantum private queries: security analysis. 3465-3477 - Debbie W. Leung, Jonathan Oppenheim, Andreas J. Winter
Quantum network communication: the butterfly and beyond. 3478-3490 - Yurii Lyubarskii
Uncertainty principles and vector quantization. 3491-3501 - Javier Vía, David Ramírez
Properness and widely linear processing of quaternion random vectors. 3502-3515 - T. Tony Cai, Lie Wang, Guangwu Xu:
Stable recovery of sparse signals and an oracle inequality. 3516-3522 - Rémi Gribonval, Karin Schnass
Dictionary identification: sparse matrix-factorization via l1-minimization. 3523-3539 - John Wright, Yi Ma:
Dense error correction via l1-minimization. 3540-3560 - Huan Xu, Constantine Caramanis
Robust regression and Lasso. 3561-3574 - Wlodzimierz Greblicki
Nonparametric input density-free estimation of the nonlinearity in wiener systems. 3575-3580 - George N. Karystinos, Athanasios P. Liavas:
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form. 3581-3593 - Kai Cai, Guobiao Weng, Xueqi Cheng:
Binary almost-perfect sequence sets. 3594-3604 - Cunsheng Ding
Optimal sets of frequency hopping sequences from linear cyclic codes. 3605-3612 - Masanori Sawa:
Optical orthogonal signature pattern codes with maximum collision parameter 2 and weight 4. 3613-3620 - Ewaryst Rafajlowicz
Nonparametric sequential change-point detection by a vertically trimmed box method. 3621-3634 - Xiaoyong Guo, Xiang-Gen Xia:
Correction to "on full diversity space-time block codes with partial interference cancellation group decoding". 3635-3636
Volume 56, Number 8, August 2010
- Imre Csiszár, Zsolt Talata:
On rate of convergence of statistical estimation of stationary ergodic processes. 3637-3641 - Radhendushka Srivastava, Debasis Sengupta:
Consistent estimation of non-bandlimited spectral density from uniformly spaced samples. 3642-3659 - Jun Chen, Haim H. Permuter
Tighter bounds on the capacity of finite-state channels via Markov set-chains. 3660-3691 - Shmuel Friedland, Per Håkan Lundow, Klas Markström:
The 1-vertex transfer matrix and accurate estimation of channel capacity. 3692-3699 - Tùng T. Kim, H. Vincent Poor
Secure communications with insecure feedback: breaking the high-SNR ceiling. 3700-3711 - Sergio Verdú:
Mismatched estimation and relative entropy. 3712-3720 - Yihong Wu, Sergio Verdú:
Rényi information dimension: fundamental limits of almost lossless analog compression. 3721-3748 - Ling Cheng, Hendrik C. Ferreira
Moment balancing templates for spectral null codes. 3749-3753 - Eran Hof, Igal Sason, Shlomo Shamai
Performance bounds for erasure, list and decision feedback schemes with linear block codes. 3754-3778 - Patric R. J. Östergård:
Classification of binary constant weight codes. 3779-3785 - Ying-Wah Wu, Shih-Chun Chang:
Coding schemes for noiseless and noisy asynchronous CDMA systems. 3786-3792 - Shengshan Cui, Alexander M. Haimovich, Oren Somekh, H. Vincent Poor
Throughput scaling of wireless networks with random connections. 3793-3806 - Xiang He, Aylin Yener:
Cooperation with an untrusted relay: a secrecy perspective. 3807-3827 - Yao-Win Peter Hong
Exploiting cooperative advantages in slotted ALOHA random access networks. 3828-3846 - Birsen Sirkeci-Mergen, Michael Gastpar:
On the broadcast capacity of wireless networks with cooperative relays. 3847-3861 - Elona Erez, Meir Feder:
Efficient network code design for cyclic networks. 3862-3878 - Chih-Chun Wang, Ness B. Shroff:
Pairwise intersession network coding on directed networks. 3879-3900 - Vishal Doshi, Devavrat Shah, Muriel Médard, Michelle Effros:
Functional compression through graph coloring. 3901-3917 - Mordecai J. Golin
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. 3918-3929 - Alina Maor, Neri Merhav:
On successive refinement for the Kaspi/Heegard-Berger problem. 3930-3945 - Jia Wang, Jun Chen, Xiaolin Wu:
On the sum rate of Gaussian multiterminal source coding: new proofs and results. 3946-3960 - Simon R. Blackburn, Tuvi Etzion, Keith M. Martin, Maura B. Paterson
Distinct difference configurations: multihop paths and key predistribution in sensor networks. 3961-3972 - Amin Aminzadeh Gohari
Information-theoretic key agreement of multiple terminals: part I. 3973-3996 - Amin Aminzadeh Gohari
Information-theoretic key agreement of multiple terminal: part II: channel model. 3997-4010 - Keijo Petteri Kononen, Marko Juhani Rinta-Aho, Keijo O. Väänänen:
On integer values of Kloosterman sums. 4011-4013 - Panagiotis Rizomiliotis:
On the resistance of Boolean functions against algebraic attacks using univariate polynomial representation. 4014-4024 - Palash Sarkar:
Pseudo-random functions and parallelizable modes of operations of a block cipher. 4025-4037 - Xiaohu Tang, Pingzhi Fan, Jürgen Lindner:
Multiple binary ZCZ sequence sets with good cross-correlation property based on complementary sequence sets. 4038-4045 - Qi Wang
The linear complexity of some binary sequences with three-level autocorrelation. 4046-4052 - Dianhua Wu, Hengming Zhao, Pingzhi Fan, Satoshi Shinohara:
Optimal variable-weight optical orthogonal codes via difference packings. 4053-4060 - Nam Yul Yu
New construction of M -ary sequence families with low correlation from the structure of Sidelnikov sequences. 4061-4070 - Masahito Hayashi:
Capacity with energy constraint in coherent state channel. 4071-4079 - San Ling
Generalization of Steane's enlargement construction of quantum codes and applications. 4080-4084 - Lukasz Pankowski, Marco Piani
A few steps more towards NPT bound entanglement. 4085-4100 - Tuncer C. Aysal, Kenneth E. Barner:
Convergence of consensus models with stochastic disturbances. 4101-4113 - John MacLaren Walsh, Phillip A. Regalia:
Belief propagation, Dykstra's algorithm, and iterated information projections. 4114-4128 - Holger Boche, Ullrich J. Mönich:
System representations for the Zakai class with applications. 4129-4134 - Jonathan M. Lilly
On the analytic wavelet transform. 4135-4156 - Fatma Abdelkefi:
Performance of sigma-delta quantizations in finite frames. 4157-4165 - Moshe Dubiner:
Bucketing coding and information theory for the statistical high-dimensional nearest-neighbor problem. 4166-4179 - Ana Salagean
Apology for citation omission in "an algorithm for computing minimal bidirectional linear recurrence relations". 4180
Volume 56, Number 9, September 2010
- Paul Cuff, Haim H. Permuter
Coordination capacity. 4181-4206 - Chandra Nair:
Capacity regions of two new classes of two-receiver broadcast channels. 4207-4214 - Ruoheng Liu, Tie Liu
Multiple-input multiple-output Gaussian broadcast channels with confidential messages. 4215-4227 - Peter Harremoës
Thinning, entropy, and the law of thin numbers. 4228-4244 - Alvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Twice-universal simulation of Markov sources and individual sequences. 4245-4255 - Tsachy Weissman:
The relationship between causal and noncausal mismatched estimation in continuous-time AWGN channels. 4256-4273 - Neri Merhav:
Physics of the shannon limits. 4274-4285 - Joseph Jean Boutros, Albert Guillen i Fabregas
Low-density parity-check codes for nonergodic block-fading channels. 4286-4300 - Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes. 4301-4308 - Yanling Chen, A. J. Han Vinck:
A lower bound on the optimum distance profiles of the second-order Reed-Muller codes. 4309-4320 - Giacomo Como
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels. 4321-4334 - Nathan Drake, Gretchen L. Matthews
Minimum distance decoding of general algebraic geometry codes via lists. 4335-4340 - Peter Trifonov
Efficient interpolation in the Guruswami-Sudan algorithm. 4341-4349 - Thomas Britz
Code enumerators and tutte polynomials. 4350-4358 - Roope Vehkalahti
The coding gain of real matrix lattices: bounds and existence results. 4359-4366 - Soheil Mohajer
Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions. 4367-4387 - T. Tony Cai, Lie Wang, Guangwu Xu:
New bounds for restricted isometry constants. 4388-4394 - Mark A. Davenport, Michael B. Wakin
Analysis of orthogonal matching pursuit using the restricted isometry property. 4395-4401 - Kiryung Lee, Yoram Bresler
ADMiRA: atomic decomposition for minimum rank approximation. 4402-4416 - Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozdaglar, Muriel Médard:
On resource allocation in fading multiple-access channels-an efficient approximate projection approach. 4417-4437 - Hongxiang Li
OFDMA capacity analysis in MIMO channels. 4438-4446 - Hazer Inaltekin
Average message delivery time for small-world networks in the continuum limit. 4447-4470 - Sibi Raj Bhaskaran, Stephen V. Hanly
Maximizing the sum rate in symmetric networks of interfering links. 4471-4487 - Alejandro Ribeiro
Separation principles in wireless networking. 4488-4505 - Sundar Subramanian, Sanjay Shakkottai
Geographic routing with limited information in sensor networks. 4506-4519 - Abhay T. Subramanian, Andrew Thangaraj
Path gain algebraic formulation for the scalar linear network coding problem. 4520-4531 - Da Wang, Danilo Silva
Robust network coding in the presence of untrusted nodes. 4532-4538 - Alexandros G. Dimakis
Network coding for distributed storage systems. 4539-4551 - Viveck R. Cadambe
Interference alignment with asymmetric complex signaling: settling the Høst-Madsen-Nosratinia conjecture. 4552-4565 - Guy Bresler, Abhay Parekh, David N. C. Tse:
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels. 4566-4592 - Nihat Ay, Markus Müller, Arleta Szkola:
Effective complexity and its relation to logical depth. 4593-4607 - Saswati Sarkar, Eitan Altman, Pramod Vaidyanathan:
Information concealing games. 4608-4630 - David Rebollo-Monedero
Optimized query forgery for private information retrieval. 4631-4642 - Graham H. Norton:
Minimal polynomial algorithms for finite sequences. 4643-4645 - Tor Helleseth, Alexander Kholosha:
New binomial bent functions over the finite fields of odd characteristic. 4646-4652 - Xiaohu Tang, Udaya Parampalli
On the noncyclic property of Sylvester Hadamard matrices. 4653-4658 - Mohammad M. Alem-Karladani, Jawad A. Salehi:
Spectral classification and multiplicative partitioning of constant-weight sequences based on circulant matrix representation of optical orthogonal codes. 4659-4667 - Mikel Sanz
A quantum version of Wielandt's inequality. 4668-4673 - Marco Tomamichel
Duality between smooth min- and max-entropies. 4674-4681 - Min-Hsiu Hsieh
Entanglement-assisted communication of classical and quantum information. 4682-4704 - Min-Hsiu Hsieh
Trading classical communication, quantum communication, and entanglement in quantum Shannon theory. 4705-4730 - Zhuo Li, Li-Juan Xing:
On a problem concerning the quantum hamming bound for impure quantum codes. 4731-4734 - Lingfei Jin, San Ling
Application of classical hermitian self-orthogonal MDS codes to quantum MDS codes. 4735-4740 - Abdourrahmane M. Atto, Dominique Pastor
Wavelet packets of fractional Brownian motion: asymptotic analysis and spectrum estimation. 4741-4753 - Davide Cescato, Helmut Bölcskei:
QR decomposition of Laurent polynomial matrices sampled on the unit circle. 4754-4761 - Jun Muramatsu
Corrections to "hash property and coding theorems for sparse matrices and maximum-likelihood coding". 4762 - Ender Tekin, Aylin Yener:
Correction to: "the Gaussian multiple access wire-tap channel" and "the general Gaussian multiple access and two-way wire-tap channels: achievable rates and cooperative jamming". 4762 - S. Sandeep Pradhan, Kannan Ramchandran:
Correction to "on functional duality in multiuser source and channel coding problems having one-sidedcollaboration". 4763
Volume 56, Number 10, October 2010
- Joakim Jaldén
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models. 4765-4780 - Sergey Loyka, George Levin:
Finite-SNR diversity-multiplexing tradeoff via asymptotic analysis of large MIMO systems. 4781-4792 - Minhua Ding
Maximum mutual information design for MIMO systems with imperfect channel knowledge. 4793-4801 - Jing Liu, Timothy N. Davidson
Diversity analysis and design of space-time multiblock codes for MIMO systems equipped with linear MMSE receivers. 4802-4819 - Mahmoud Taherzadeh, Amir K. Khandani:
On the limitations of the naive lattice decoding. 4820-4826 - Christoph Studer, Helmut Bölcskei:
Soft-input soft-output single tree-search sphere decoding. 4827-4842 - Vasanthan Raghavan, Jayesh H. Kotecha, Akbar M. Sayeed:
Why does the Kronecker model result in misleading capacity estimates? 4843-4864 - Manish Agarwal, Michael L. Honig:
Wideband fading channel capacity with training and partial feedback. 4865-4873 - Stefano Buzzi, H. Vincent Poor
Transmitter waveform and widely linear receiver design: noncooperative games for wireless multiple-access networks. 4874-4892 - Shuangqing Wei, Dennis Goeckel, Patrick A. Kelly:
Convergence of the complex envelope of bandlimited OFDM signals. 4893-4904 - Tadashi Wadayama:
Interior point decoding for linear vector channels based on convex optimization. 4905-4921 - Makesh Pravin Wilson, Krishna R. Narayanan, Giuseppe Caire:
Joint source channel coding with side information using hybrid digital analog codes. 4922-4940 - Aleksandar Jovicic, Hua Wang, Pramod Viswanath:
On network interference management. 4941-4955 - Yuan Shen
Fundamental limits of wideband localization: part I: a general framework. 4956-4980 - Yuan Shen
Fundamental limits of wideband localization: part II: cooperative networks. 4981-5000 - Philippe Jacquet, Bernard Mans
Information propagation speed in mobile and delay tolerant networks. 5001-5015 - Michele Garetto
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks. 5016-5029 - Xiaohu Shang, Biao Chen, Gerhard Kramer
Capacity regions and sum-rate capacities of vector Gaussian interference channels. 5030-5044 - Koby Todros
General classes of performance lower bounds for parameter estimation: part I: non-Bayesian bounds for unbiased estimators. 5045-5063 - Koby Todros
General classes of performance lower bounds for parameter estimation: part II: Bayesian bounds. 5064-5082 - Rodney A. Martin:
A state-space approach to optimal level-crossing prediction for linear Gaussian processes. 5083-5096 - Ingrid Daubechies, C. Sinan Güntürk, Yang Wang
The golden ratio encoder. 5097-5110 - Shuchin Aeron, Venkatesh Saligrama
Information theoretic bounds for compressed sensing. 5111-5130 - Xiaohui Chen, Z. Jane Wang, Martin J. McKeown
Asymptotic analysis of robust LASSOs in the presence of noise with large variance. 5131-5149 - Florence Bénézit, Alexandros G. Dimakis, Patrick Thiran, Martin Vetterli
Order-optimal consensus through randomized path averaging. 5150-5167 - Dominik Janzing, Bernhard Schölkopf:
Causal inference using the algorithmic Markov condition. 5168-5194 - Venkatesan Guruswami, Atri Rudra:
The existence of concatenated codes list-decodable up to the hamming bound. 5195-5206 - Luciano Panek
Classification of Niederreiter-Rosenbloom-Tsfasman block codes. 5207-5216 - Qi Cheng
Complexity of decoding positive-rate primitive Reed-Solomon codes. 5217-5222 - Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
Correcting deletions using linear and cyclic codes. 5223-5234 - Filip Paluncic, Hendrik C. Ferreira
A variable length approach to moment balancing. 5235-5244 - Georg Schmidt, Vladimir Sidorenko
Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis. 5245-5252 - Fabian Lim, Marc P. C. Fossorier, Aleksandar Kavcic:
Code automorphisms and permutation decoding of certain Reed-Solomon binary images. 5253-5273 - Michael Lentmaier, Arvind Sridharan, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Iterative decoding threshold analysis for LDPC convolutional codes. 5274-5289 - Anxiao Jiang, Robert Mateescu, Eitan Yaakobi, Jehoshua Bruck
Storage coding for wear leveling in flash memories. 5290-5299 - Anxiao Jiang, Vasken Bohossian, Jehoshua Bruck
Rewriting codes for joint information storage in flash memories. 5300-5313 - Lucile Sassatelli, David Declercq:
Nonbinary hybrid LDPC codes. 5314-5334 - Josep Cotrina Navau, Marcel Fernandez:
A family of asymptotically good binary fingerprinting codes. 5335-5343 - Chao Tian
New coding schemes for the symmetric K -description problem. 5344-5365 - Kaoru Kurosawa:
Power of a public random permutation and its application to authenticated encryption. 5366-5374
Volume 56, Number 11, November 2010
- Gustavo L. Gilardoni
On Pinsker's and Vajda's Type Inequalities for Csiszár's f-Divergences. 5377-5386 - Oliver Johnson
Monotonicity, Thinning, and Discrete Versions of the Entropy Power Inequality. 5387-5395 - Tsachy Weissman:
Capacity of Channels With Action-Dependent States. 5396-5411 - Philippe Jacquet, Wojciech Szpankowski:
Noisy Constrained Capacity for BSC Channels. 5412-5423 - Erez Sabbag, Neri Merhav:
Achievable Error Exponents for Channels With Side Information - Erasure and List Decoding. 5424-5431 - Amos Lapidoth, Michèle A. Wigger:
On the AWGN MAC With Imperfect Feedback. 5432-5476 - Hung D. Ly, Tie Liu, Yingbin Liang:
Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages. 5477-5487 - Wooseok Nam, Sae-Young Chung, Yong Hoon Lee:
Capacity of the Gaussian Two-Way Relay Channel to Within 1øver 2 Bit. 5488-5494 - Nathan Levy, Ofer Zeitouni
On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip. 5495-5514 - Ashish Khisti, Gregory W. Wornell:
Secure Transmission With Multiple Antennas - Part II: The MIMOME Wiretap Channel. 5515-5532 - Zhenning Kong, Edmund M. Yeh:
Resilience to Degree-Dependent and Cascading Node Failures in Random Geometric Networks. 5533-5546 - Keqin Liu, Qing Zhao:
Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access. 5547-5567 - Anna Pantelidou
A Cross-Layer View of Optimal Scheduling. 5568-5580 - Jie Luo, Anthony Ephremides:
Superiority of Superposition Multiaccess With Single-User Decoding Over TDMA in the Low SNR Regime. 5581-5589 - Satish Babu Korada, Nicolas Macris:
Tight Bounds on the Capacity of Binary Input Random CDMA Systems. 5590-5613 - Giuseppa Alfano
A Theoretical Framework for LMS MIMO Communication Systems Performance Analysis. 5614-5630 - Tùng T. Kim, Khoa D. Nguyen
Coded Modulation With Mismatched CSIT Over MIMO Block-Fading Channels. 5631-5640 - Makesh Pravin Wilson, Krishna R. Narayanan, Henry D. Pfister
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying. 5641-5654 - Sung Sik Nam, Mohamed-Slim Alouini
An MGF-Based Unified Framework to Determine the Joint Statistics of Partial Sums of Ordered Random Variables. 5655-5672 - Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction for Computationally Bounded Noise. 5673-5680 - Venkatesan Guruswami, Salil P. Vadhan:
A Lower Bound on List Size for List Decoding. 5681-5688 - Alexei E. Ashikhmin, A. Robert Calderbank:
Grassmannian Packings From Operator Reed-Muller Codes. 5689-5714 - Nicolas Bitouze, Alexandre Graell i Amat
Error Correcting Coding for a Nonsymmetric Ternary Channel. 5715-5729 - Min-Zheng Shieh
Decoding Frequency Permutation Arrays Under Chebyshev Distance. 5730-5737 - Yeow Meng Chee
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. 5738-5746 - Hung-Lin Fu, Yi-Hean Lin, Miwako Mishima:
Optimal Conflict-Avoiding Codes of Even Length and Weight 3. 5747-5756 - Derek H. Smith
Exploiting Spatial Separations in CDMA Systems With Correlation Constrained Sets of Hadamard Matrices. 5757-5761 - Konstantinos Drakakis:
A Structural Constraint for Golomb Costas Arrays. 5762-5764 - Ying Li:
A Construction of General QAM Golay Complementary Sequences. 5765-5771 - Heekwan Lee, Solomon W. Golomb:
A New Construction of 16-QAM Near Complementary Sequences. 5772-5779 - Kenneth W. Shum, Wing Shing Wong:
Construction and Applications of CRT Sequences. 5780-5795 - Xiang Yu, Haiquan Wang, En-Hui Yang:
Design and Analysis of Optimal Noisy Channel Quantization With Random Index Assignment. 5796-5804 - Nima Sarshar, Xiaolin Wu:
On Linfinity Properties of Multiresolution Scalar Quantizers. 5805-5810 - Richard J. Barton, Rong L. Zheng:
Order-Optimal Data Aggregation in Regular Wireless Sensor Networks. 5811-5821 - Augusto Aubry
On MIMO Detection Under Non-Gaussian Target Scattering. 5822-5838 - Augusto Maurer, Massimiliano Pontil:
K -Dimensional Coding Schemes in Hilbert Spaces. 5839-5846 - XuanLong Nguyen, Martin J. Wainwright
Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization. 5847-5861 - Jarvis D. Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, Robert D. Nowak:
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation. 5862-5875 - Alexandra Boldyreva, Hideki Imai, Kazukuni Kobara
How to Strengthen the Security of RSA-OAEP. 5876-5886 - Chik How Tan, Guomin Yang
Comments on "Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting". 5887-5888 - Jacob Löfvenberg, Jan-Åke Larsson
Comments on "New Results on Frame-Proof Codes and Traceability Schemes". 5888-5889
Volume 56, Number 12, December 2010
- Siu-Wai Ho
On Information Divergence Measures and a Unified Typicality. 5893-5905 - Siu-Wai Ho
The Interplay Between Entropy and Variational Distance. 5906-5929 - Siu-Wai Ho
On the Interplay Between Conditional Entropy and Error Probability. 5930-5942 - Russell John Higgs
Bounds for General Transmission Systems. 5943-5944 - Tobias Koch
On Multipath Fading Channels at High SNR. 5945-5957 - Ron Dabora, Andrea J. Goldsmith:
Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation. 5958-5983 - Nan Liu, Deniz Gündüz
Interference Channels With Correlated Receiver Side Information. 5984-5998 - Emmanuel Abbe, Lizhong Zheng:
Linear Universal Decoding for Compound Channels. 5999-6013 - Yang Gao, Ertem Tuncel
New Hybrid Digital/Analog Schemes for Transmission of a Gaussian Source Over a Gaussian Channel. 6014-6019 - Ola Ayaso, Devavrat Shah, Munther A. Dahleh:
Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels. 6020-6039 - Tiangao Gou, Syed Ali Jafar
Degrees of Freedom of the K User M times N MIMO Interference Channel. 6040-6057 - Shashi Borade, Lizhong Zheng:
Wideband Fading Channels With Feedback. 6058-6065 - Ahmed A. Farid, Steve Hranilovic:
Capacity Bounds for Wireless Optical Intensity Channels With Gaussian Noise. 6066-6077 - Narayan Prasad, Luca Venturino
Diversity-Multiplexing Tradeoff Analysis for OFDM Systems With Subcarrier Grouping, Linear Precoding, and Linear Detection. 6078-6096 - Siavash Ekbatani, Farzad Etemadi, Hamid Jafarkhani
Outage Behavior of Slow Fading Channels With Power Control Using Partial and Erroneous CSIT. 6097-6102 - Wiroonsak Santipach
Optimization of Training and Feedback Overhead for Beamforming Over Block Fading Channels. 6103-6115 - Manish Agarwal, Dongning Guo, Michael L. Honig:
Limited-Rate Channel State Feedback for Multicarrier Block Fading Channels. 6116-6132 - Che Lin, Venugopal V. Veeravalli, Sean P. Meyn:
A Random Search Framework for Convergence Analysis of Distributed Beamforming With Feedback. 6133-6141 - Deniz Gündüz
Multiple Multicasts With the Help of a Relay. 6142-6158 - Sandeep Bhadra, Sanjay Shakkottai
Buffer Asymptotics for Coding Over Networks. 6159-6181 - Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean C. Walrand:
Distributed Random Access Algorithm: Scheduling and Congestion Control. 6182-6207 - Wenjun Li, Huaiyu Dai, Yanbing Zhang:
Location-Aided Fast Distributed Consensus in Wireless Networks. 6208-6227 - Behtash Babadi, Vahid Tarokh:
GADIA: A Greedy Asynchronous Distributed Interference Avoidance Algorithm. 6228-6252 - Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke:
Polar Codes: Characterization of Exponent, Bounds, and Constructions. 6253-6264 - Shuhong Gao, Todd D. Mateer:
Additive Fast Fourier Transforms Over Finite Fields. 6265-6272 - W. Wesley Peterson, James B. Nation, Marc P. C. Fossorier:
Reflection Group Codes and Their Decoding. 6273-6293 - Tamir Hazan, Amnon Shashua:
Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference. 6294-6316 - Kiran Misra, Shirish Karande, Hayder Radha:
Maximal Recovery Network Coding Under Topology Constraint. 6317-6331 - Hamid Saeedi
New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel. 6332-6346 - Daniel J. J. Versfeld
Constructing Coset Codes With Optimal Same-Symbol Weight for Detecting Narrowband Interference in M-FSK Systems. 6347-6353 - Jan Østergaard
n -Channel Asymmetric Entropy-Constrained Multiple-Description Lattice Vector Quantization. 6354-6375 - Nam Yul Yu
Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation. 6376-6387 - Qi Wang
The Linear Complexity of Binary Sequences With Optimal Autocorrelation. 6388-6397 - Xiaohu Tang, Cunsheng Ding
New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value. 6398-6405 - Vladislav B. Tadic:
Analyticity, Convergence, and Convergence Rate of Recursive Maximum-Likelihood Estimation in Hidden Markov Models. 6406-6432 - Duc-Son Pham
Bayesian Minimax Estimation of the Normal Model With Incomplete Prior Covariance Matrix Specification. 6433-6449 - Iaroslav V. Blagouchine
Unbiased Efficient Estimator of the Fourth-Order Cumulant for Random Zero-Mean Non-i.i.d. Signals: Particular Case of MA Stochastic Process. 6450-6458 - Holger Boche, Ullrich J. Mönich:
Approximation of Wide-Sense Stationary Stochastic Processes by Shannon Sampling Series. 6459-6469 - Yuan Yao:
On Complexity Issues of Online Learning Algorithms. 6470-6481 - Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Prakash Narayan, Alex Reznik:
Secret Key Generation for a Pairwise Independent Network Model. 6482-6489 - Sirin Nitinawarat, Prakash Narayan:
Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing. 6490-6500 - Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Deterministic Extractors for Independent-Symbol Sources. 6501-6512 - Alex Alvarado
Corrections to "Bit-Interleaved Coded Modulation in the Wideband Regime" [Dec 08 5447-5455]. 6513 - Daniel J. Katz:
Correction to "Sharp p -Divisibility of Weights in Abelian Codes Over BBZ/pdBBZ " [Dec 08 5354-5380]. 6513
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-12-26 00:57 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: