default search action
ISIT 2010: Austin, Texas, USA
- IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings. IEEE 2010
- Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu:
Universal source coding for multiple decoders with side information. 1-5 - Jun Chen, Sorina Dumitrescu, Ying Zhang, Jia Wang:
Robust multiresolution coding with Hamming distortion measure. 6-10 - Mayank Bakshi
, Michelle Effros:
On zero-error source coding with feedback. 11-15 - Roy Timo, Terence Chan
Rate distortion with Side-Information at many receivers. 16-20 - Yang Yang, Yifu Zhang, Zixiang Xiong:
The generalized quadratic Gaussian CEO problem: New cases with tight rate region and applications. 21-25 - Rajiv Soundararajan, Aaron B. Wagner, Sriram Vishwanath:
Sum rate of the vacationing CEO problem. 26-30 - Haim H. Permuter
Cascade and triangular source coding with side information at the first two nodes. 31-35 - Yuval Kochman, Gregory W. Wornell:
On the excess distortion exponent of the quadratic-Gaussian Wyner-Ziv problem. 36-40 - Yang Yang, Yifu Zhang, Zixiang Xiong:
On the sum-rate loss of quadratic Gaussian multiterminal source coding. 41-45 - Jia Wang, Jun Chen:
On the sum rate of vector Gaussian multiterminal source coding. 46-50 - Yasutada Oohama:
Distributed source coding of correlated memoryless Gaussian observations. 51-55 - Md Saifur Rahman, Aaron B. Wagner:
Rate region of the Gaussian scalar-help-vector source-coding problem. 56-60 - Nan Ma, Prakash Ishwar
Interaction strictly improves the Wyner-Ziv rate-distortion function. 61-65 - Cheng Chang:
On the rate distortion function of Bernoulli Gaussian sequences. 66-70 - Neri Merhav:
On the physics of rate-distortion theory. 71-75 - Milan S. Derpich
Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sources. 76-80 - Serdar Yüksel:
On optimal causal coding of partially observed Markov sources under classical and non-classical information structures. 81-85 - Yonatan Kaspi, Neri Merhav:
Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side information. 86-90 - Mortuza Ali, Margreta Kuijper
Source coding with side information using list decoding. 91-95 - Hani-James Ebeid, Todd P. Coleman:
Source coding with feedforward using the posterior matching scheme. 96-100 - Takahiro Ota, Hiroyoshi Morita:
Asymptotic optimality of antidictionary codes. 101-105 - Sang-youn Oh, John C. Kieffer:
Fractal compression rate curves in lossless compression of balanced trees. 106-110 - John C. Kieffer, John Marcos:
Local coordinates of a trellis source code. 111-115 - Soheil Feizi, Muriel Médard:
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem. 116-120 - Jin Meng, En-Hui Yang:
On the error exponent to redundancy ratio of interactive encoding and decoding. 121-125 - Mitsuharu Arimura, Ken-ichi Iwata:
On the achievable redundancy rate of fixed length source code for general sources. 126-130 - Ryo Nomura
On the overflow probability of lossless codes with side information. 131-135 - Marius Kleiner, Bixio Rimoldi:
A tight bound on the performance of a minimal-delay joint source-channel coding scheme. 136-140 - Yang Gao, Ertem Tuncel
On optimality of a hybrid digital/analog scheme for Wyner-Ziv coding over broadcast channels. 141-145 - Chao Tian, Suhas N. Diggavi, Shlomo Shamai
The achievable distortion region of bivariate Gaussian source on Gaussian broadcast channel. 146-150 - Pulkit Grover
Distributed signal cancelation inspired by Witsenhausen's counterexample. 151-155 - Jing Wang, Jie Liang
Distortion exponents of two-way relaying cooperative networks. 156-160 - Changho Suh
Exact-repair MDS codes for distributed storage using interference alignment. 161-165 - Mohammad Ali Maddah-Ali, David Tse:
Interference neutralization in distributed lossy source coding. 166-170 - Rick Ma, Samuel Cheng:
Hamming coding for Multiple Sources. 171-175 - Han-I Su, Abbas El Gamal:
Two-way source coding through a relay. 176-180 - Fei Teng, En-Hui Yang, Xiang Yu:
Optimal multiresolution quantization for broadcast channels with random index assignment. 181-185 - Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto
Universal Slepian-Wolf source codes using low-density parity-check matrices. 186-190 - Ertem Tuncel
Identification and lossy reconstruction in noisy databases. 191-195 - Krishnamurthy Viswanathan:
On the memory required to compute functions of streaming data. 196-200 - Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer:
The capacity of the uniform noise rewritable channel with average cost. 201-205 - Mansoor I. Yousefi, Frank R. Kschischang
A Fokker-Planck differential equation approach for the zero-dispersion optical fiber channel. 206-210 - Rui A. Costa, Michael Langberg, João Barros
One-shot capacity of discrete channels. 211-215 - Siva K. Gorantla, Todd P. Coleman:
On reversible Markov chains and maximization of directed information. 216-220 - Yury Polyanskiy, H. Vincent Poor
Minimum energy to send k bits with and without feedback. 221-225 - Jaesang Ham, David J. Love:
On the achievable rate of the additive Gaussian noise channel with noisy feedback. 226-230 - Yury Polyanskiy, H. Vincent Poor
Variable-length coding with feedback in the non-asymptotic regime. 231-235 - Aditya Mahajan
Opportunistic capacity and error exponent regions for compound channel with feedback. 236-240 - Siva K. Gorantla, Baris Nakiboglu
Bit-wise unequal error protection for variable length blockcodes with feedback. 241-245 - Hari Palaiyanur, Anant Sahai:
An upper bound for the block coding error exponent with delayed feedback. 246-250 - Giacomo Como
Sphere-packing bound for block-codes with feedback and finite memory. 251-255 - Yu Xiang, Young-Han Kim:
On the AWGN channel with noisy feedback and peak energy constraint. 256-259 - Anelia Somekh-Baruch, Neri Merhav:
Exact random coding exponents for erasure decoding. 260-264 - Yücel Altug, Aaron B. Wagner:
Moderate deviation analysis of channel coding: Discrete memoryless case. 265-269 - Zheng Wang, Jie Luo:
Achievable error exponent of channel coding in random access communication. 270-274 - Andrew R. Barron, Antony Joseph:
Least squares superposition codes of moderate dictionary size, reliable at rates up to capacity. 275-279 - Venkat Chandar, Aslan Tchamkerten, David Tse:
Asynchronous capacity per unit cost. 280-284 - Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate
Coding against delayed adversaries. 285-289 - Sirin Nitinawarat:
On the deterministic code capacity region of an arbitrarily varying multiple-access channel under list decoding. 290-294 - Ning Cai, Terence Chan
The arbitrarily varying channel when the jammer knows the channel input. 295-299 - Fredrik Rusek, Angel E. Lozano
Mutual information of IID complex Gaussian signals on block Rayleigh-faded channels. 300-304 - Xiugang Wu, Liang-Liang Xie:
AEP of Output when Rate is above capacity: The Gaussian case. 305-309 - Mustafa Kesal, Uri Erez:
Gaussian causal dirty paper capacity is at most log (1 + SNR over e). 310-314 - Andrew R. Barron, Antony Joseph:
Toward fast reliable communication at rates near capacity with Gaussian noise. 315-319 - Veniamin I. Morgenshtern
The SIMO pre-log can be larger than the SISO pre-log. 320-324 - Sergey Loyka, François Gagnon
Error rates of capacity-achieving codes are convex. 325-329 - Lifeng Lai, Yingbin Liang, Shlomo Shamai
On the capacity region of the Poisson interference channels. 330-334 - Achaleshwar Sahai, Vaneet Aggarwal
Sum capacity of general deterministic interference channel with channel output feedback. 335-339 - Bernd Bandemer, Abbas El Gamal:
Interference decoding for deterministic channels. 340-344 - Wei Liu, Biao Chen:
Communicating correlated sources over interference channels: The lossy case. 345-349 - Yan Zhu, Dongning Guo:
On the capacity region of fading Z-interference channels without CSIT. 350-354 - Seyyed Hasan Mahboubi, Abolfazl S. Motahari, Amir K. Khandani:
Layered interference alignment: Achieving the total DOF of MIMO X-channels. 355-359 - Akbar Ghasemi, Abolfazl S. Motahari, Amir K. Khandani:
Interference alignment for the K user MIMO interference channel. 360-364 - Xi Liu, Elza Erkip
Coordination and bargaining over the Gaussian interference channel. 365-369 - Hossein Bagheri, Abolfazl S. Motahari, Amir K. Khandani:
Zero-forcing for the symmetric Interference Channel with conferencing encoders. 370-374 - Rui Wu, Vinod M. Prabhakaran, Pramod Viswanath:
Interference channels with half duplex source cooperation. 375-379 - I-Hsiang Wang, David N. C. Tse:
Interference mitigation through limited transmitter cooperation. 380-384 - V. Sreekanth Annapureddy, Aly El Gamal, Venugopal V. Veeravalli:
Degrees of freedom of the K-user interference channel with transmitter cooperation. 385-389 - Haishi Ning, Cong Ling, Kin K. Leung:
Relay-aided interference alignment: Feasibility conditions and algorithm. 390-394 - Onur Sahin, Osvaldo Simeone
Interference channel with a half-duplex Out-of-Band Relay. 395-399 - Ye Tian, Aylin Yener:
The ergodic fading interference channel with an on-and-off relay. 400-404 - Behzad Nourani, Abolfazl S. Motahari, Amir K. Khandani:
Relay-aided Interference Alignment for the quasi-static interference channel. 405-409 - Matthew Aldridge
Asymptotic sum-capacity of random Gaussian interference networks using interference alignment. 410-414 - Vaneet Aggarwal
Normalized sum-capacity of interference networks with partial information. 415-419 - Kamyar Moshksar, Amir K. Khandani:
On the achievable rates in decentralized networks with Randomized Masking. 420-424 - Sang Joon Kim, Besma Smida
Capacity bounds on multi-pair two-way communication with a base-station aided by a relay. 425-429 - Ehsan Ardestanizadeh, Michèle A. Wigger, Young-Han Kim, Tara Javidi
Linear sum capacity for Gaussian multiple access channel with feedback. 430-434 - Debdeep Chatterjee, Tan F. Wong, Ozgur Oyman:
On achievable rate regions for half-duplex causal cognitive radio channels. 435-439 - Chinmay S. Vaze, Mahesh K. Varanasi:
The degrees of freedom region of the MIMO cognitive interference channel with no CSIT. 440-444 - Hsuan-Yi Chu:
On the achievable rate regions for a class of cognitive radio channels: Interference channel with degraded message sets with unidirectional destination cooperation. 445-449 - Ofer Shayevitz, Michèle A. Wigger:
An achievable region for the discrete memoryless broadcast channel with feedback. 450-454 - Ramji Venkataramanan, S. Sandeep Pradhan:
Achievable rates for the broadcast channel with feedback. 455-459 - Alireza Vahid, Amir Salman Avestimehr:
The two-user deterministic interference channel with rate-limited feedback. 460-464 - Shraga I. Bross, Yossef Steinberg, Stephan Tinguely:
The discrete memoryless interference channel with one-sided generalized feedback. 465-469 - Deniz Gündüz
On the capacity region of a multiple access channel with common messages. 470-474 - Hideki Yagi, H. Vincent Poor
Coset codes for multiple access channels with common information based on LDPC codes. 475-479 - Amos Lapidoth, Yossef Steinberg:
The multiple access channel with two independent states each known causally to one encoder. 480-484 - Ali Haghi, Reza Khosravi-Farsani, Mohammad Reza Aref, Farokh Marvasti:
The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSIT. 485-489 - Dinkar Vasudevan, Vijay G. Subramanian
Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels. 490-494 - Chao Tian, Jun Chen, Suhas N. Diggavi, Shlomo Shamai
Optimality and approximate optimality of source-channel separation in networks. 495-499 - Shirin Jalali, Michelle Effros:
On the separation of lossy source-network coding and channel coding in wireline networks. 500-504 - Urs Niesen, Piyush Gupta, David Tse:
On the optimality of multi-hop communication in large wireless networks. 505-509 - Won-Yong Shin, Daniel Enrique Lucani
Multi-hop routing is order-optimal in underwater extended networks. 510-514 - Si-Hyeon Lee, Sae-Young Chung:
Capacity of a class of tree networks. 515-519 - Ali Nazari
Typicality graphs and their properties. 520-524 - Jörg Bühler, Gerhard Wunder:
On duality relations for the discrete memoryless multiple access and broadcast channel. 525-529 - Ankit Gupta, Sergio Verdú:
Operational duality between Gelfand-Pinsker and Wyner-Ziv coding. 530-534 - Ronit Bustin, Miquel Payaró, Daniel Pérez Palomar
On MMSE properties and I-MMSE implications in parallel MIMO Gaussian channels. 535-539 - Amin Aminzadeh Gohari
On an outer bound and an inner bound for the general broadcast channel. 540-544 - Yanlin Geng, Chandra Nair, Shlomo Shamai
On broadcast channels with binary inputs and symmetric outputs. 545-549 - Chandra Nair, Zizhou Vincent Wang, Yanlin Geng:
An information inequality and evaluation of Marton's inner bound for binary input broadcast channels. 550-554 - Ashish Khisti, Danilo Silva
Secure-broadcast codes over linear-deterministic channels. 555-559 - Ramy H. Gohary, Timothy N. Davidson
The capacity region of a product of two unmatched Gaussian broadcast channels with three particular messages and a common message. 560-564 - Ersen Ekrem, Sennur Ulukus:
On Gaussian MIMO broadcast channels with common and private messages. 565-569 - Kensuke Yasui, Toshiyasu Matsushima:
Toward computing the capacity region of degraded broadcast channel. 570-574 - Jun Muramatsu
Construction of broadcast channel code based on hash property. 575-579 - Michelle Effros:
Capacity bounds for networks of broadcast channels. 580-584 - Liang Chen:
Parallel relay broadcast channels. 585-589 - Arash Behboodi, Pablo Piantanida:
Capacity of a class of broadcast relay channels. 590-594 - Zizhou Vincent Wang, Chandra Nair:
The capacity region of a class of broadcast channels with a sequence of less noisy receivers. 595-598 - Sadaf Salehkalaibar, Leila Ghabeli
An outer bound on the capacity region of Broadcast-Relay-Channel. 599-603 - Sung Hoon Lim
Multi-source noisy network coding. 604-608 - Momin Uppal, Anders Høst-Madsen, Zixiang Xiong:
Outage capacity of the broadcast channel in the low power regime. 609-613 - Xiaohu Shang, H. Vincent Poor
On the weighted sum-rate capacity of broadcast channels that generate interference. 614-618 - Rajesh T. Krishnamachari, Mahesh K. Varanasi:
Interference alignment under limited feedback for MIMO interference channels. 619-623 - Pablo Piantanida, Shlomo Shamai
On the capacity of compound state-dependent channels with states known at the transmitter. 624-628 - Kittipong Kittichokechai
Source and channel coding with action-dependent partially known two-sided state information. 629-633 - Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref:
State-Dependent Relay Channel with Private Messages with partial causal and non-causal Channel State Information. 634-638 - Abdellatif Zaidi, Shlomo Shamai
Bounds on the capacity of the relay channel with noncausal state information at source. 639-643 - Ravi Tandon, Sennur Ulukus:
Diamond channel with partially separated relays. 644-648 - Hossein Bagheri, Abolfazl S. Motahari, Amir K. Khandani:
On the capacity of the half-duplex diamond channel. 649-653 - Lawrence Ong
The binary-symmetric parallel-relay network. 654-658 - Leila Ghabeli
On achievable rates for relay networks based on partial decode-and-forward. 659-663 - Lawrence Ong
Capacity Theorems for the AWGN multi-way relay channel. 664-668 - Ayfer Özgür
Approximately achieving Gaussian relay network capacity with lattice codes. 669-673 - Shahab Oveis Gharan, Amir K. Khandani:
Multiplexing gain of amplify-forward relaying in wireless multi-antenna relay networks. 674-678 - Nadia Fawaz
On the non-coherent wideband multipath fading relay channel. 679-683 - Shrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke:
Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC. 684-688 - Igal Sason, Boaz Shuval:
On universal LDPC code ensembles. 689-693 - Jossy Sayir
EXIT chart approximations using the role model approach. 694-698 - Kan Li, Aleksandar Kavcic, Raman Venkataramani, Mehmet Fatih Erden:
Channels with both random errors and burst erasures: Capacities, LDPC code thresholds, and code performances. 699-703 - Pascal O. Vontobel
Connecting the Bethe entropy and the edge zeta function of a cycle code. 704-708 - Michael Lentmaier, Gerhard P. Fettweis:
On the thresholds of generalized LDPC convolutional codes based on protographs. 709-713 - Iryna Andriyanova, Kenta Kasai:
Finite-length scaling of non-binary (c, d) LDPC codes for the BEC. 714-718 - Shadi Abu-Surra, Dariush Divsalar, William E. Ryan:
On the typical minimum distance of protograph-based generalized LDPC codes. 719-723 - Reza Asvadi
Lowering the error floor of LDPC codes using cyclic liftings. 724-728 - Takayuki Nozaki
Error floors of non-binary LDPC codes. 729-733 - Kejing Liu, Javier Garcia-Frías
Error floor analysis in LDGM codes. 734-738 - Gyu Bum Kyung, Chih-Chun Wang:
Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder. 739-743 - Nissim Halabi, Guy Even:
LP decoding of regular LDPC codes in memoryless channels. 744-748 - Meng Wang, Weiyu Xu, Ao Tang:
The limits of error correction with lp decoding. 749-753 - Byung-Hak Kim, Henry D. Pfister
On the joint decoding of LDPC codes and finite-state channels via linear programming. 754-758 - Jens Zumbrägel, Mark F. Flanagan
On the pseudocodeword redundancy. 759-763 - Roxana Smarandache:
On minimal pseudo-codewords. 764-768 - Shiva Kumar Planjery, David Declercq, Shashi Kiran Chilappagari, Bane Vasic:
Multilevel decoders surpassing belief propagation on the binary symmetric channel. 769-773 - Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen
Improved adaptive belief propagation decoding using edge-local complementation. 774-778 - Maja Ostojic, Hans-Andrea Loeliger:
Multitree decoding and multitree-aided LDPC decoding. 779-783 - Manabu Hagiwara, Marc P. C. Fossorier, Hideki Imai:
LDPC codes with fixed initialization decoding over binary symmetric channel. 784-788 - Jian-Jia Weng, Chih-Chieh Lai, Chung-Hsuan Wang:
Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective. 789-793 - Xuepeng Wang, Baoming Bai, Xiao Ma:
A low-complexity joint detection-decoding algorithm for nonbinary LDPC-coded modulation systems. 794-798 - Pablo M. Olmos, Juan José Murillo-Fuentes
Tree-structure expectation propagation for decoding LDPC codes over binary erasure channels. 799-803 - Jun Won Choi, Byonghyo Shim
Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. 804-808 - Brian K. Butler, Paul H. Siegel:
On distance properties of quasi-cyclic protograph-based LDPC codes. 809-813 - Li Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Bo Zhou:
Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes. 814-818 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
New low-density parity-check codes with large girth based on hypergraphs. 819-823 - David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes. 824-828 - Christine A. Kelley, Jörg Kliewer:
Algebraic constructions of graph-based nested codes from protographs. 829-833 - Eric Roy, Christian Cardinal, David Haccoun:
Recursive convolutional codes for time-invariant LDPC convolutional codes. 834-838 - Chao Chen, Baoming Bai, Xinmei Wang:
Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fields. 839-843 - Kenta Kasai, David Declercq, Charly Poulliat, Koichi Sakaniwa:
Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes. 844-848 - Chi-Jen Wu, Chung-Hsuan Wang, Chi-Chao Chao:
A new construction of UEP QC-LDPC codes. 849-853 - Alexander Barg, Arya Mazumdar:
Codes in permutations and error correction for rank modulation. 854-858 - Fan Zhang, Henry D. Pfister
LDPC codes for rank modulation in flash memories. 859-863 - Zhiying Wang
Partial rank modulation for flash memories. 864-868 - Moshe Schwartz
Constant-weight Gray codes for local rank modulation. 869-873 - Seyed Hamed Hassani, Rüdiger L. Urbanke:
On the scaling of polar codes: I. The behavior of polarized channels. 874-878 - Seyed Hamed Hassani, Kasra Alishahi, Rüdiger L. Urbanke:
On the scaling of polar codes: II. The behavior of un-polarized channels. 879-883 - Satish Babu Korada, Andrea Montanari, Emre Telatar, Rüdiger L. Urbanke:
An empirical scaling law for polar codes. 884-888 - Toshiyuki Tanaka, Ryuhei Mori
Refined rate of channel polarization. 889-893 - Ryuhei Mori
Channel polarization on q-ary discrete memoryless channels by arbitrary kernels. 894-898 - Erdal Arikan:
Source polarization. 899-903 - Harm S. Cronie, Satish Babu Korada:
Lossless source coding with polar codes. 904-908 - Mohammad Karzand, Emre Telatar:
Polar codes for q-ary source coding. 909-912 - Hessam Mahdavifar, Alexander Vardy
Achieving the secrecy capacity of wiretap channels using Polar codes. 913-917 - Mayank Bakshi
Concatenated Polar codes. 918-922 - Shilpa G, Andrew Thangaraj
Dirty paper coding using sign-bit shaping and LDPC codes. 923-927 - Chen Gong, Guosen Yue, Xiaodong Wang:
A practical message-wise unequal error protection coding scheme. 928-932 - Shashank V. Maiya, Thomas E. Fuja:
Cooperative communications based on trellis pruning. 933-937 - Ingmar Land
Bounding of MAP decode and forward relaying. 938-942 - João Luiz Rebelatto
Generalized distributed network coding based on nonbinary linear block codes for multi-user cooperative communications. 943-947 - Thuy Van Nguyen, Aria Nosratinia
Bilayer protograph codes for half-duplex relay channels. 948-952 - Momin Uppal, Guosen Yue, Xiaodong Wang, Zixiang Xiong:
A rateless coded protocol for half-duplex wireless relay channels. 953-957 - Aravind R. Iyengar, Paul H. Siegel, Jack K. Wolf:
Data-dependent write channel model for Magnetic Recording. 958-962 - Fabian Lim, Aleksandar Kavcic, Marc P. C. Fossorier:
On sufficient conditions for testing optimality of codewords in ISI channels. 963-967 - Luis Alfonso Lastras-Montaño, Ashish Jagmohan, Michele Franceschini:
Algorithms for memories with stuck cells. 968-972 - Thomas Mittelholzer, Luis Alfonso Lastras-Montaño, Mayank Sharma, Michele Franceschini:
Rewritable storage channels with limited number of rewrite iterations. 973-977 - Arya Mazumdar, Alexander Barg, Navin Kashyap:
Coding for high-density magnetic recording. 978-982 - Yingquan Wu:
A new encoding method for integrated-interleaved codes. 983-987 - Yuval Cassuto, Mario Blaum:
Codes for symbol-pair read channels. 988-992 - Mingqiang Li, Jiwu Shu:
On the equivalence between the B-Code constructions and perfect one-factorizations. 993-996 - Adam Kalai, Michael Mitzenmacher, Madhu Sudan:
Tight asymptotic bounds for the deletion channel with small deletion probabilities. 997-1001 - Yashodhan Kanoria, Andrea Montanari:
On the deletion channel with small deletion probability. 1002-1006 - Feng Wang, Dario Fertonani, Tolga M. Duman
Marker code optimization and symbol-level synchronization for insertion/deletion channels. 1007-1011 - Luca G. Tallini, Noha Elarief, Bella Bose:
On efficient repetition error correcting codes. 1012-1016 - Chen Feng
An algebraic approach to physical-layer network coding. 1017-1021 - Jiening Zhan, Bobak Nazer, Uri Erez, Michael Gastpar:
Integer-forcing linear receivers. 1022-1026 - Yair Yona, Meir Feder:
Complex low density lattice codes. 1027-1031 - Boris D. Kudryashov, Kirill V. Yurkov:
Near-optimum low-complexity lattice quantization. 1032-1036 - Neil J. A. Sloane, Vinay A. Vaishampayan
The lifting construction: A general solution for the fat strut problem. 1037-1041 - Kenichirou Takizawa, Hideki Yagi, Tsutomu Kawabata:
Closest point algorithms with lp norm for root lattices. 1042-1046 - Carmen Martínez
Perfect graph codes over two dimensional lattices. 1047-1051 - Ming-Yang Chen, Hua-Chieh Li, John M. Cioffi:
An improved 8 × 8 approximately universal code with the large normalized diversity product. 1052-1055 - Lakshmi Prasad Natarajan, B. Sundar Rajan:
Fast-group-decodable STBCs via codes over GF(4). 1056-1060 - Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Rotated modulations for outage probability minimization: a fading space approach. 1061-1065 - Wei Zhang
A systematic design of space-time block codes with reduced-complexity partial interference cancellation group decoding. 1066-1070 - Tianyi Xu, Xiang-Gen Xia:
On space-time code design with a conditional PIC group decoding. 1071-1075 - Smarajit Das:
Set-partition methods and orthogonal designs. 1076-1079 - Frédérique E. Oggier, Roope Vehkalahti
Fast-decodable MIDO codes from crossed product algebras. 1080-1084 - Fabian Lim, Marc P. C. Fossorier, Aleksandar Kavcic:
Permutation decoding the binary images of certain double-parity reed-solomon codes. 1085-1089 - Sabine Kampf, Martin Bossert:
A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithm. 1090-1094 - Phong S. Nguyen, Henry D. Pfister
A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes. 1095-1099 - Christian Senger, Vladimir Sidorenko
Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decoders. 1100-1104 - G. David Forney Jr.:
MacWilliams identities for terminated convolutional codes. 1105-1109 - Chiara Ravazzi, Fabio Fagnani:
Hayman-like techniques for computing input-output weight distribution of convolutional encoders. 1110-1114 - Alexander Barg, Oleg R. Musin:
Bounds on codes with few distances. 1115-1119 - Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
Heavy weight codes. 1120-1124 - Fernando Hernando
Subfield-subcodes of Generalized Toric codes. 1125-1129 - Mubarak Jibril, Martin Tomlinson, Mohammed Zaki Ahmed, Cen Tjhai:
Good codes from generalised algebraic geometry codes. 1130-1132 - Margreta Kuijper
The predictable leading monomial property for polynomial vectors over a ring. 1133-1137 - Pascale Charpin, Sumanta Sarkar:
Polynomials with linear structure and Maiorana-McFarland construction. 1138-1142 - Antonia Wachter, Vladimir Sidorenko
A basis for all solutions of the key equation for Gabidulin codes. 1143-1147 - Vladimir Sidorenko
Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesis. 1148-1152 - Terence H. Chan
Properties of quasi-uniform codes. 1153-1157 - Cátia Regina de Oliveira Quilles Queiroz, Reginaldo Palazzo Júnior:
Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings. 1158-1162 - Bruno Kindarji, Gérard D. Cohen, Hervé Chabanne:
On the threshold of Maximum-Distance Separable codes. 1163-1167 - Hideki Yagi, H. Vincent Poor
Performance analysis of linear codes under maximum likelihood decoding at low rates. 1168-1172 - Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
An upper bound on the separating redundancy of linear block codes. 1173-1177 - Eitan Yaakobi, Tuvi Etzion:
High dimensional error-correcting codes. 1178-1182 - Min-Zheng Shieh
On the minimum weight problem of permutation codes under Chebyshev distance. 1183-1187 - Lars Eirik Danielsen
On the classification of self-dual additive codes over GF(9). 1188-1192 - Hessam Mahdavifar, Alexander Vardy
Algebraic list-decoding on the operator channel. 1193-1197 - Alexander Zeh, Christian Senger:
A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes. 1198-1202 - Widad Machmouchi:
Local-testability and self-correctability of q-ary sparse linear codes. 1203-1207 - Artyom Sharov, Ron M. Roth:
Fixed-rate tiling encoders for 2-D constraints. 1208-1212 - Giovanni Sabato, Mehdi Molkaraie:
Generalized belief propagation algorithm for the capacity of multi-dimensional run-length limited constraints. 1213-1217 - Ling Cheng, Hendrik C. Ferreira
Moment balancing templates for (d, k) constrained codes. 1218-1222 - Erez Louidor:
The tradeoff function for a class of RLL(d, k) constraints. 1223-1227 - Qi Wang
The linear complexity of binary sequences with optimal autocorrelation. 1228-1232 - Nam Yul Yu
On the structure of M-ary Sidelnikov sequences of period p2m - 1. 1233-1237 - Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
On reconstructing a string from its substring compositions. 1238-1242 - Ki-Hyeon Park, Hong-Yeop Song:
Quasi-Hadamard matrix. 1243-1247 - Hongchao Zhou, Jehoshua Bruck
Generalizing the Blum-Elias method for generating random bits from Markov chains. 1248-1252 - Udaya Parampalli
On the construction of binary sequence families with low correlation and large sizes. 1253-1257 - Nam Yul Yu
Generalized constructions of polyphase sequence families using shift and addition of multiplicative character sequences. 1258-1262 - Ji-Youp Kim, Sung-Tai Choi, Jong-Seon No, Habong Chung:
A new family of p-ary decimated sequences with low correlation. 1263-1267 - Sung-Tai Choi, Jong-Seon No, Habong Chung:
On the cross-correlation of a ternary m-sequence of period 34k+2 - 1 and its decimated sequence by (32k+1+1)2 over 8. 1268-1271 - Frantisek Matús, Michal Kupsa
On colorings of bivariate random sequences. 1272-1276 - Tor Helleseth, Alexander Kholosha:
New binomial bent functions over the finite fields of odd characteristic. 1277-1281 - Jin-Ho Chung, Kyeongcheol Yang:
k-fold cyclotomic numbers and their applications to frequency-hopping sequences. 1282-1286 - Kohtaro Tadaki:
The Hausdorff dimension of the halting self-similar sets of T-universal prefix-free machines. 1287-1291 - Honggang Hu, Guang Gong:
A new class of ternary and quaternary sequences with two-level autocorrelation. 1292-1296 - Jinquan Luo:
Cross correlation of nonbinary niho-type sequences. 1297-1299 - Serdar Boztas
Nonbinary sequences with perfect and nearly perfect autocorrelations. 1300-1304 - Danilo Pelusi, Luca G. Tallini, Bella Bose:
On m-ary balanced codes with parallel decoding. 1305-1309 - Alexander Barg, Punarbasu Purkayastha:
Near MDS poset codes and distributions. 1310-1314 - Mingqiang Li, Jiwu Shu:
On cyclic lowest density MDS array codes constructed using starters. 1315-1319 - Andréa Santos Leite da Rocha, Luzinete Cristina Bonani de Faria, João H. Kleinschmidt
DNA sequences generated by ℤ4-linear codes. 1320-1324 - Arkadii G. D'yachkov, A. N. Voronina, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov:
On critical relative distance of DNA codes for additive stem similarity. 1325-1329 - Hongchao Zhou, Ho-Lin Chen
On the synthesis of stochastic flow networks. 1330-1334 - Tim van Erven
Rényi divergence and majorization. 1335-1339 - Aditya Guntuboyina
Minimax lower bounds via f-divergences. 1340-1344 - Peter Harremoës, Igor Vajda:
Joint range of f-divergences. 1345-1349 - Tomohiko Uyematsu:
Relating source coding and resolvability: A direct approach. 1350-1354 - Todd P. Coleman, Maxim Raginsky:
Mutual information saddle points in channels of exponential family type. 1355-1359 - Eren Sasoglu:
An entropy inequality for q-ary random variables and its application to channel polarization. 1360-1363 - Terence Chan
Existence of new inequalities for representable polymatroids. 1364-1368 - Mokshay M. Madiman, Ioannis Kontoyiannis:
The entropies of the sum and the difference of two IID random variables are not too different. 1369-1372 - Wei Wang, Martin J. Wainwright
Information-theoretic bounds on model selection for Gaussian Markov random fields. 1373-1377 - Zsolt Talata:
Divergence of information-criterion based Markov order estimators for infinite memory processes. 1378-1382 - Peter Grunwald, Wojciech Kotlowski:
Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong. 1383-1387 - Vincent Y. F. Tan, Matthew J. Johnson, Alan S. Willsky:
Necessary and sufficient conditions for high-dimensional salient feature subset recovery. 1388-1392 - Yan Wang, Yajun Mei:
Decentralized multihypothesis sequential detection. 1393-1397 - Joachim M. Buhmann:
Information theoretic model validation for clustering. 1398-1402 - Po-Hsiang Lai, Teemu Roos
MDL hierarchical clustering for stemmatology. 1403-1407 - Majid Fozunbal:
On regret of parametric mismatch in minimum mean square error estimation. 1408-1412 - Andreia Teixeira
Entropy measures vs. algorithmic information. 1413-1417 - Jorge F. Silva, Shrikanth S. Narayanan:
A near-optimal (minimax) tree-structured partition for mutual information estimation. 1418-1422 - Jorge F. Silva, Shrikanth S. Narayanan:
On data-driven histogram-based estimation for mutual information. 1423-1427 - Bharath K. Sriperumbudur, Kenji Fukumizu
Non-parametric estimation of integral probability metrics. 1428-1432 - Lei Zhao, Haim H. Permuter
Universal estimation of directed information. 1433-1437 - Sergey G. Bobkov, Mokshay M. Madiman:
Entropy and the hyperplane conjecture in convex geometry. 1438-1442 - Barlas Oguz, Venkat Anantharam:
Compressing a long range dependent renewal process. 1443-1447 - Siu-Wai Ho
Markov lemma for countable alphabets. 1448-1452 - Yihong Wu, Sergio Verdú:
Functional properties of MMSE. 1453-1457 - Maxim Raginsky:
Empirical processes and typical sequences. 1458-1462 - Yihong Wu, Sergio Verdú:
MMSE dimension. 1463-1467 - Guangyue Han, Brian H. Marcus:
Entropy rate of continuous-state hidden Markov chains. 1468-1472 - Neri Merhav:
Optimum estimation via partition functions and information measures. 1473-1477 - Benjamin G. Kelly, Thitidej Tularak, Aaron B. Wagner, Pramod Viswanath:
Universal hypothesis testing in the learning-limited regime. 1478-1482 - Narayana P. Santhanam, Mokshay M. Madiman:
Patterns and exchangeability. 1483-1487 - Wojciech Szpankowski, Marcelo J. Weinberger:
Minimax redundancy for large alphabets. 1488-1492 - Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam:
Classification using pattern probability estimators. 1493-1497 - Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan:
Exact calculation of pattern probabilities. 1498-1502 - Raghunandan H. Keshavan, Andrea Montanari:
Regularization for matrix completion. 1503-1507 - Sriram Vishwanath:
Information theoretic bounds for low-rank matrix completion. 1508-1512 - Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel J. Candès, Yi Ma:
Dense error correction for low-rank matrices via Principal Component Pursuit. 1513-1517 - Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. Candès, Yi Ma:
Stable Principal Component Pursuit. 1518-1522 - Weiyu Xu, Ao Tang:
On the uniqueness of positive semidefinite matrix solution under compressed observations. 1523-1527 - Mohsen Bayati, Andrea Montanari:
The dynamics of message passing on dense graphs, with applications to compressed sensing. 1528-1532 - Yoshiyuki Kabashima, Tadashi Wadayama, Toshiyuki Tanaka:
Statistical mechanical analysis of a typical reconstruction limit of compressed sensing. 1533-1537 - Koujin Takeda, Yoshiyuki Kabashima:
Statistical mechanical analysis of compressed sensing utilizing correlated compression matrix. 1538-1542 - Sundeep Rangan, Alyson K. Fletcher, Vivek K. Goyal
Extension of replica analysis to MAP estimation with applications to compressed sensing. 1543-1547 - Galen Reeves, Michael Gastpar:
"Compressed" compressed sensing. 1548-1552 - Ankit Gupta, Robert D. Nowak, Benjamin Recht:
Sample complexity for 1-bit compressed sensing and sparse classification. 1553-1557 - Yuzhe Jin, Young-Han Kim, Bhaskar D. Rao:
Performance tradeoffs for exact support recovery of sparse signals. 1558-1562 - Jarvis D. Haupt, Rui M. Castro, Robert D. Nowak:
Improved bounds for sparse recovery from adaptive measurements. 1563-1567 - Waheed U. Bajwa, A. Robert Calderbank, Sina Jafarpour:
Model selection: Two fundamental measures of coherence and their algorithmic significance. 1568-1572 - Karthik Mohan, Maryam Fazel:
New Restricted Isometry results for noisy low-rank recovery. 1573-1577 - Patrick Kuppinger, Giuseppe Durisi
Where is randomness needed to break the square-root bottleneck? 1578-1582 - Balakrishnan Narayanaswamy, Rohit Negi, Pradeep K. Khosla:
Robust lossy detection using sparse measurements: The regular case. 1583-1587 - Weiyu Xu, Ao Tang:
On the dynamics of ℓ1 decoding: A microscopic approach. 1588-1592 - Mihailo Stojnic:
Recovery thresholds for ℓ1 optimization in binary compressed sensing. 1593-1597 - Toshiyuki Tanaka, Jack Raymond:
Optimal incorporation of sparsity information by weighted ℓ1 optimization. 1598-1602 - M. Amin Khajehnejad, Weiyu Xu, Amir Salman Avestimehr, Babak Hassibi:
Improved sparse recovery thresholds with two-step reweighted ℓ1 minimization. 1603-1607 - Joffrey Villard, Pascal Bianchi:
High-rate vector quantization for the Neyman-Pearson detection of some stationary mixing processes. 1608-1612 - Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky:
Error exponents for composite hypothesis testing of Markov forest distributions. 1613-1617 - Dayu Huang, Sean P. Meyn:
Feature extraction for universal hypothesis testing via rank-constrained optimization. 1618-1622 - Mohammad Naghshvar, Tara Javidi
Active M-ary sequential hypothesis testing. 1623-1627 - Wenyi Zhang, H. Vincent Poor
On minimax robust detection of stationary Gaussian signals in white Gaussian noise. 1628-1632 - Emanuele Grossi
Robust waveform design for MIMO radars. 1633-1637 - Laura Balzano
High-dimensional Matched Subspace Detection when data are missing. 1638-1642 - Jibran Yousafzai
Towards robust phoneme classification with hybrid features. 1643-1647 - Han-I Su, Tsachy Weissman:
Universal lossless compression-based denoising. 1648-1652 - Erik Ordentlich, Krishnamurthy Viswanathan, Marcelo J. Weinberger:
Toward properties of twice-universality in denoising. 1653-1657 - Steffen Schober, Martin Bossert:
On spectral estimators of Boolean functions. 1658-1662 - Koby Todros
On order relations between lower bounds on the MSE of unbiased estimators. 1663-1667 - Kishor Barman, Onkar Dabeer:
Local popularity based collaborative filters. 1668-1672 - Romain Couillet, Jack W. Silverstein
Eigen-inference for multi-source power estimation. 1673-1677 - Mehdi Molkaraie, Hans-Andrea Loeliger:
Estimating the information rate of noisy two-dimensional constrained channels. 1678-1682 - Ying Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky:
Feedback message passing for inference in gaussian graphical models. 1683-1687 - Rahul Vaze, Kien T. Truong
Two-way transmission capacity of wireless ad-hoc networks. 1688-1692 - Radha Krishna Ganti
A new method for computing the transmission capacity of non-Poisson wireless networks. 1693-1697 - Michele Garetto
Information-theoretic capacity of clustered random networks. 1698-1702 - Roland Tresch, Maxime Guillaud
Performance of interference alignment in clustered wireless ad hoc networks. 1703-1707 - Sundaram Vanka, Martin Haenggi
Analysis of the benefits of Superposition Coding in random wireless networks. 1708-1712 - Si-Hyeon Lee, Sae-Young Chung:
Capacity scaling of wireless ad hoc networks: Effect of finite wavelength. 1713-1717 - Yuxin Chen, Jeffrey G. Andrews:
An upper bound on multi-hop transmission capacity with dynamic routing selection. 1718-1722 - Massimo Franceschetti, Marco Donald Migliore
Degrees of freedom of large planar wireless networks embedded in a 3D domain. 1723-1727 - Animashree Anandkumar, Joseph E. Yukich, Alan S. Willsky:
Limit laws for random spatial graphical models. 1728-1732 - Kostas Stamatiou, Martin Haenggi
The delay-optimal number of hops in Poisson multi-hop networks. 1733-1737 - Pouya Dehghani Tafti, Michael Unser
Fractional Brownian models for vector field data. 1738-1742 - Chengzhi Li, Huaiyu Dai:
Transport capacity and connectivity of Cognitive Radio networks with outage constraint. 1743-1747 - Bruce E. Hajek, Ji Zhu:
The missing piece syndrome in peer-to-peer communication. 1748-1752 - Florence Bénézit, Vincent D. Blondel, Patrick Thiran, John N. Tsitsiklis, Martin Vetterli
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. 1753-1757 - Michael Borokhovich, Chen Avin
Tight bounds for algebraic gossip on graphs. 1758-1762 - Debashis Dash, Ashutosh Sabharwal:
Distributed consensus with finite messaging. 1763-1767 - Nima Noorshams, Martin J. Wainwright
A near-optimal algorithm for network-constrained averaging with noisy links. 1768-1772 - Ning Wen, Randall A. Berry
Minimum delay packet-sizing for linear multi-hop networks with cooperative transmissions. 1773-1777 - Ali ParandehGheibi, Muriel Médard, Srinivas Shakkottai, Asuman E. Ozdaglar:
Avoiding interruptions - QoE trade-offs in block-coded streaming media applications. 1778-1782 - Joe Wenjie Jiang, Shaoquan Zhang, Minghua Chen
Minimizing streaming delay in homogeneous peer-to-peer networks. 1783-1787 - Harsha Gangammanavar, Atilla Eryilmaz:
Dynamic coding and rate-control for serving deadline-constrained traffic over fading channels. 1788-1792 - Dinkar Vasudevan, Vijay G. Subramanian
On ARQ for packet erasure channels with Bernoulli arrivals. 1793-1797 - Parimal Parag
On the queueing behavior of random codes over a gilbert-elliot erasure channel. 1798-1802 - Hassan Halabian, Ioannis Lambadaris, Chung-Horng Lung:
Network capacity region of multi-queue multi-server queueing system with time varying connectivities. 1803-1807 - Jing Yang, Sennur Ulukus:
Delay minimization with a general pentagon rate region. 1808-1812 - Ka-Hung Hui, Dongning Guo, Randall A. Berry
Medium access control via nearest-neighbor interactions for regular wireless networks. 1813-1817 - Yalin Evren Sagduyu, Randall A. Berry
Jamming games for power controlled medium access with dynamic traffic. 1818-1822 - Jie Luo, Anthony Ephremides:
A channel coding approach for random access communication with bursty sources. 1823-1827 - Kenneth W. Shum, Wing Shing Wong:
Construction of short protocol sequences with worst-case throughput guarantee. 1828-1832 - Kumar Viswanatha, Emrah Akyol
Towards optimum cost in multi-hop networks with arbitrary network demands. 1833-1837 - Yanina Shkel
Cooperative reliability for streaming multiple access. 1838-1842 - Rui Wang
Delay optimal power control and relay selection for two-hop cooperative OFDM systems via distributive stochastic learning. 1843-1847 - Nan Xie, Steven Weber:
Geometric approximations of some Aloha-like stability regions. 1848-1852 - Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network; revisited. 1853-1857 - Sagar Shenvi, Bikash Kumar Dey:
A necessary and sufficient condition for solvability of a 3s/3t sum-network. 1858-1862 - Hemant Kowshik, P. R. Kumar:
Optimal ordering of transmissions for computing Boolean threshold functions. 1863-1867 - Nan Ma, Prakash Ishwar
Infinite-message interactive function computation in collocated networks. 1868-1872 - Hemant Kowshik, P. R. Kumar:
Optimal computation of symmetric Boolean functions in tree networks. 1873-1877 - Abhik Kumar Das, Sriram Vishwanath, Syed Ali Jafar
Network coding for multiple unicasts: An interference alignment approach. 1878-1882 - Dan Zhang, Narayan B. Mandayam, Shyam Parekh:
DEDI: A framework for analyzing rank evolution of random network coding in a wireless network. 1883-1887 - Alexander Sprintson
A randomized algorithm and performance bounds for coded cooperative data exchange. 1888-1892 - Chih-Chun Wang:
On the capacity of wireless 1-hop intersession network coding - a broadcast packet erasure channel approach. 1893-1897 - Arun Kumar Singh
Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints. 1898-1902 - Abhik Kumar Das, Shweta Agrawal, Sriram Vishwanath:
On algebraic traceback in dynamic networks. 1903-1907 - Ori Rottenstreich, Isaac Keslassy
On the code length of TCAM coding schemes. 1908-1912 - Mahdi Cheraghchi
Graph-constrained group testing. 1913-1917 - Anxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck
Data movement and aggregation in flash memories. 1918-1922 - Luis Alfonso Lastras-Montaño, Michele Franceschini, Bipin Rajendran
Coding for sensing in Content Addressable Memories. 1923-1927 - Yunnan Wu:
Low complexity codes for writing a write-once memory twice. 1928-1932 - Eitan Yaakobi, Paul H. Siegel, Alexander Vardy
Multiple error-correcting WOM-codes. 1933-1937 - K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. 1938-1942 - Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
A flexible class of regenerating codes for distributed storage. 1943-1947 - Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho:
Security in distributed storage systems by communicating a logarithmic number of bits. 1948-1952 - Salim Y. El Rouayheb, Vinod M. Prabhakaran, Kannan Ramchandran:
Secure distributive storage of decentralized source data: Can interaction help? 1953-1957 - Mohsen Sardari, Ricardo Restrepo, Faramarz Fekri
Memory allocation in distributed storage networks. 1958-1962 - Alexander Barg, Arya Mazumdar:
Small ensembles of sampling matrices constructed from coding theory. 1963-1967 - Venkat Chandar, Devavrat Shah, Gregory W. Wornell:
A simple message-passing algorithm for compressed sensing. 1968-1972 - A. Robert Calderbank, Stephen D. Howard, Sina Jafarpour:
Sparse reconstruction via the Reed-Muller Sieve. 1973-1977 - Shashi Kiran Chilappagari, Michael Chertkov
Worst configurations (instantons) for Compressed Sensing over reals: A channel coding approach. 1978-1982 - Lotfollah Beygi
A novel rate allocation method for multilevel coded modulation. 1983-1987 - Srinath Puducheri, Thomas E. Fuja:
Coding versus feedback: Hybrid ARQ protocols for the packet erasure channel. 1988-1992 - Christian Schlegel, Marat V. Burnashev:
Optimal error control coding for iterative cancellation systems. 1993-1997 - Luis Salamanca, Juan José Murillo-Fuentes
Channel decoding with a Bayesian equalizer. 1998-2002 - Maxime Côte, Nicolas Sendrier:
Reconstruction of a turbo-code interleaver from noisy observation. 2003-2007 - Mathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Tillich:
Methods for the reconstruction of parallel turbo codes. 2008-2012 - Alexandre Graell i Amat
Stopping set analysis of 3-dimensional turbo code ensembles. 2013-2017 - Ghassan M. Kraidy, Joseph Jean Boutros, Albert Guillen i Fabregas
Irregular turbo codes in block-fading channels. 2018-2022 - Francesca Vatta
Termination and tailbiting of rate-k/n direct product convolutional codes. 2023-2027 - Chung-Hsuan Wang, Wei-Fan Wu, Jian-Jia Weng:
UEP-optimal convolutional encoders with smallest McMillan degree. 2028-2032 - Hassan Ghozlan, Gerhard Kramer
Interference focusing for mitigating cross-phase modulation in a simplified optical fiber model. 2033-2037 - Saikat Guha, Jonathan L. Habif, Masahiro Takeoka:
PPM demodulation: On approaching fundamental limits of optical communications. 2038-2042 - Luca Venturino
Performance analysis of an asynchronous multi-user communication system for optical networks. 2043-2047 - Nick Letzepis, Khoa D. Nguyen
Hybrid free-space optical and radio-frequency communications: Outage analysis. 2048-2052 - Hooman Shirani-Mehr, Giuseppe Caire, Haralabos C. Papadopoulos, Sean A. Ramprashad:
Joint scheduling and hybrid ARQ for multi-cell MU-MIMO downlink. 2053-2057 - Hoon Huh, Giuseppe Caire, Sung Hyun Moon, Inkyu Lee:
Multi-cell MIMO downlink with fairness criteria: The large system limit. 2058-2062 - Ali Tajer, Narayan Prasad, Xiaodong Wang:
Robust beamforming for multi-cell downlink transmission. 2063-2067 - Hayssam Dahrouj
Interference mitigation with joint beamforming and common message decoding in multicell systems. 2068-2072 - Jiaheng Wang, Gesualdo Scutari, Daniel Pérez Palomar
Robust cognitive radio via game theory. 2073-2077 - Ramy Tannious, Aria Nosratinia
Coexistence through ARQ retransmissions in fading cognitive radio channels. 2078-2082 - Ali Tajer, Narayan Prasad, Xiaodong Wang:
Fair rate adaptation in multiuser interference channels. 2083-2087 - Jun-Pyo Hong, Wan Choi
Capacity scaling law by multiuser diversity in cognitive radio systems. 2088-2092 - Shayan Dashmiz, Mohammad Reza Takapoui, Pedram Pad, Farokh Marvasti:
New bounds for the sum capacity of binary and nonbinary synchronous CDMA systems. 2093-2097 - Mikko Vehkaperä
Analysis of large MIMO DS-CDMA systems with imperfect CSI and spatial correlation. 2098-2102 - Adrià Tauste Campo
Large system analysis of iterative multiuser joint decoding with an uncertain number of users. 2103-2107 - Yuejie Chi
Regularized blind detection for MIMO communications. 2108-2112 - Amine Mezghani, Josef A. Nossek
Belief propagation based MIMO detection operating on quantized channel output. 2113-2117 - Desmond W. H. Cai, Tony Q. S. Quek
Max-min weighted SIR for MIMO downlink system: Optimality and algorithms. 2118-2122 - Gerhard Wunder, Jan Schreck, Peter Jung
A new robust transmission technique for the multiuser MIMO downlink. 2123-2127 - Christian Guthy, Wolfgang Utschick
Large system analysis of projection based algorithms for the MIMO broadcast channel. 2128-2132 - Illsoo Sohn, Jeffrey G. Andrews, Kwang Bok Lee:
Capacity scaling of MIMO broadcast channels with random user distribution. 2133-2137 - Chongbin Xu, Xiaojun Yuan, Li Ping
Joint FEC coding and linear precoding for MIMO ISI channels. 2138-2142 - Saif K. Mohammed, Emanuele Viterbo
X- and Y-Codes for MIMO precoding. 2143-2147 - Saif K. Mohammed, Emanuele Viterbo
Precoding with X-codes to increase capacity with discrete input alphabets. 2148-2152 - Florian Dupuy, Philippe Loubaton:
On the capacity achieving covariance matrix for frequency selective MIMO channels using the asymptotic approach. 2153-2157 - Sheng Yang, Jean-Claude Belfiore:
Distributed rotation recovers spatial diversity. 2158-2162 - Ahmed Hesham Mehana
Diversity of MMSE MIMO receivers. 2163-2167 - Khoa D. Nguyen
Outage diversity of MIMO block-fading channels with causal channel state information. 2168-2172 - Haewoon Nam, Mohamed-Slim Alouini
Multiuser switched scheduling systems with per-user threshold and post-user selection. 2173-2177 - Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the symmetric MIMO half-duplex relay channel. 2178-2182 - Luis Garcia Ordóñez
On the diversity, multiplexing, and array gain tradeoff in MIMO channels. 2183-2187 - Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the MIMO Z interference channel. 2188-2192 - Hsiao-feng Lu:
Diversity-multiplexing tradeoff in MIMO Gaussian interference channels. 2193-2197 - Manav Garg, Mahesh K. Varanasi:
Diversity-multiplexing-tradeoff-optimal 2-user scheduling in an M-user Gaussian multiple-access channel. 2198-2202 - Petros Elia
Fundamental rate-reliability-complexity limits in outage limited MIMO communications. 2203-2207 - Yao Xie, Andrea Goldsmith:
Diversity-multiplexing-delay tradeoffs in MIMO multihop networks with ARQ. 2208-2212 - Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the symmetric MIMO 2-user interference channel. 2213-2217 - Giyora Levin, Sergey Loyka:
Diversity-multiplexing tradeoff and outage probability in MIMO relay channels. 2218-2222 - Li Peng, Albert Guillen i Fabregas
Distortion outage probability in MIMO block-fading channels. 2223-2227 - K. Pavan Srinath, B. Sundar Rajan:
Reduced ML-decoding complexity, full-rate STBCs for 4 transmit antenna systems. 2228-2232 - Jagadeesh Harshan, B. Sundar Rajan, Are Hjørungnes:
Training-symbol embedded, high-rate complex orthogonal designs for relay networks. 2233-2237 - Xuehong Mao, Rong-Rong Chen, Behrouz Farhang-Boroujeny
Iterative data detection and decoding using list channel estimation and Markov Chain Monte Carlo. 2238-2242 - William R. Carson, Miguel R. D. Rodrigues, Ian J. Wassell:
Modelling the decoder and demapper EXIT chart curves in BICM-ID systems: BEC approximations. 2243-2247 - Walid Abediseid, Mohamed Oussama Damen:
Lattice sequential decoder for coded MIMO channel: Performance and complexity analysis. 2248-2252 - Qi Zhou, Xiaoli Ma, Robert Rice:
Near-ML detection based on semi-definite programming for UWB communications. 2253-2257 - Andreas Schenk, Robert F. H. Fischer:
Soft-output sphere decoder for multiple-symbol differential detection of impulse-radio ultra-wideband. 2258-2262 - Shuiyin Liu, Cong Ling, Damien Stehlé:
Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding. 2263-2267 - Vasanthan Raghavan, Venugopal V. Veeravalli, Stephen V. Hanly
Linear beamforming for the spatially correlated MISO broadcast channel. 2268-2272 - Mohammad Ali Maddah-Ali:
On the degrees of freedom of the compound MISO broadcast channels with finite states. 2273-2277 - Vasanthan Raghavan, Stephen V. Hanly
Statistical beamformer design for the two-antenna interference channel. 2278-2282 - Siddarth Hari, Wei Yu:
Partial zero-forcing precoding for the interference channel with partially cooperating transmitters. 2283-2287 - Behrang Nosrat-Makouei, Jeffrey G. Andrews, Robert W. Heath Jr.
A simple SINR characterization for linear interference alignment over uncertain MIMO channels. 2288-2292 - K. Raj Kumar, Feng Xue:
An iterative algorithm for joint signal and interference alignment. 2293-2297 - Huang Huang, Vincent K. N. Lau
Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSI. 2298-2302 - Romain Couillet, H. Vincent Poor
Self-organized spectrum sharing in large MIMO multiple-access channels. 2303-2307 - Pasquale Memmolo
Up-link multi-user MIMO capacity in low-power regime. 2308-2312 - Augusto Aubry
Multiple-access channel capacity region with incomplete channel state information. 2313-2317 - Viveck R. Cadambe
Sum-capacity and the unique separability of the parallel Gaussian MAC-Z-BC network. 2318-2322 - Chun-Hung Liu
Multicast capacity scaling of wireless networks with multicast outage. 2323-2327 - Kejie Lu, Wang Liu, Jianping Wang
Achieving the capacity bounds of multicast in large-scale wireless networks. 2328-2332 - Lihua Wan, Jie Luo:
Wireless multicasting via iterative optimization. 2333-2337 - Jung Hyun Bae, Achilleas Anastasopoulos:
A posterior matching scheme for finite-state channels with feedback. 2338-2342 - Rajesh T. Krishnamachari, Mahesh K. Varanasi:
Finite-rate feedback of input covariance matrices in MIMO systems. 2343-2347 - Wei Xu, Xiaodai Dong:
Limited feedback design for MIMO-relay assisted cellular networks with beamforming. 2348-2352 - Chinmay S. Vaze, Mahesh K. Varanasi:
CSI feedback scaling rate vs multiplexing gain tradeoff for DPC-based transmission in the Gaussian MIMO broadcast channel. 2353-2357 - Anders Høst-Madsen:
Minimum energy per bit in wireless networks with correlated information. 2358-2362 - Pulkit Grover
Shannon meets Tesla: Wireless information and power transfer. 2363-2367 - Chin Keong Ho, Rui Zhang
Optimal energy allocation for wireless communications powered by energy harvesters. 2368-2372 - Pulkit Grover
Information-theoretic tradeoffs of throughput and chip power consumption for decoding error-correcting codes. 2373-2377 - Terence Chan
On capacity regions of non-multicast networks. 2378-2382 - Sormeh Shadbakht, Babak Hassibi:
MCMC methods for entropy optimization and nonlinear network coding. 2383-2387 - Wei Mao, Matthew Thill, Babak Hassibi:
On group network codes: Ingleton-bound violations and independent sources. 2388-2392 - Tobias Lutz, Gerhard Kramer
Capacity for half-duplex line networks with two sources. 2393-2397 - Nikhil Karamchandani, Lorenzo Keller, Christina Fragouli, Massimo Franceschetti:
Function computation via subspace coding. 2398-2402 - Daniel Enrique Lucani
Systematic network coding for time-division duplexing. 2403-2407 - B. Javad Ebrahimi
Vector network coding algorithms. 2408-2412 - Shenghao Yang, Jin Meng, En-Hui Yang:
Coding for linear operator channels over finite fields. 2413-2417 - Prasad Krishnan, B. Sundar Rajan:
On network-error correcting convolutional codes under the BSC edge error model. 2418-2422 - Oliver Kosut, Lang Tong, David N. C. Tse:
Polytope codes against adversaries in networks. 2423-2427 - Danilo Silva
Universal secure error-correcting schemes for network coding. 2428-2432 - Eitaro Shioji, Ryutaroh Matsumoto
Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppers. 2433-2437 - Yu Cao, Steven D. Blostein, Wai-Yip Chan:
Unequal error protection rateless coding design for multimedia multicasting. 2438-2442 - Ali Talari, Behzad Shahrasbi, Nazanin Rahnavard:
Efficient symbol sorting for high intermediate recovery rate of LT codes. 2443-2447 - Yao Li, Emina Soljanin
Collecting coded coupons over generations. 2448-2452 - Ali Talari, Nazanin Rahnavard:
Distributed rateless codes with UEP property. 2453-2457 - Douglas J. Leith
Coding packets over reordering channels. 2458-2462 - Haitham Rashwan, Ernst M. Gabidulin, Bahram Honary:
A Smart approach for GPT cryptosystem based on rank codes. 2463-2467 - Stéphane Jacob:
Cryptanalysis of a fast encryption scheme for databases. 2468-2472 - Xin-Wen Wu
Primitive polynomials for robust scramblers and stream ciphers against reverse engineering. 2473-2477 - Céline Blondeau
Differential properties of power functions. 2478-2482 - Hiroki Koga:
A simple secret sharing scheme using a key and its security against substitution of shares. 2483-2487 - Christina Boura, Anne Canteaut:
A zero-sum property for the KECCAK-f permutation with 18 rounds. 2488-2492 - Mehdi M. Hassanzadeh, Tor Helleseth:
Algebraic attack on the Alternating Step(r, s) Generator. 2493-2497 - Mukundan Madhavan, Andrew Thangaraj
NLHB: A non-linear Hopper-Blum protocol. 2498-2502 - Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar:
Secure communication over fading channels with statistical QoS constraints. 2503-2507 - George T. Amariucai, Shuangqing Wei:
Active eavesdropping in fast fading channels: A Block-Markov Wyner secrecy encoding scheme. 2508-2512 - Omar Bakr, Raghuraman Mudumbai:
A new jamming technique for secrecy in multi-antenna wireless networks. 2513-2517 - Tzu-Han Chou, Stark C. Draper
Impact of channel sparsity and correlated eavesdropping on secret key generation from multipath channel randomness. 2518-2522 - Martin Hell
Using coding techniques to analyze weak feedback polynomials. 2523-2527 - N. Prasanth Anthapadmanabhan, Alexander Barg:
Two-level fingerprinting: Stronger definitions and code constructions. 2528-2532 - Hung D. Ly, Tie Liu, Yufei W. Blankenship:
Security embedding codes. 2533-2537 - Masahito Hayashi, Ryutaroh Matsumoto
Construction of wiretap codes from ordinary channel codes. 2538-2542 - Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
On secure distributed data storage under repair dynamics. 2543-2547 - Yeow-Khiang Chia, Abbas El Gamal:
Wiretap channel with causal state information. 2548-2552 - Amine Laourine, Aaron B. Wagner:
Secrecy capacity of the degraded Poisson wiretap channel. 2553-2557 - Mitsuru Hamada:
Security of concatenated encoders for wiretap channels. 2558-2562 - Mari Kobayashi, Pablo Piantanida, Sheng Yang, Shlomo Shamai
On the secrecy degress of freedom of the multi-antenna block fading wiretap channels. 2563-2567 - Ruoheng Liu, Tie Liu, H. Vincent Poor
The capacity-equivocation region of the MIMO Gaussian wiretap channel. 2568-2572 - Etienne Perron, Suhas N. Diggavi, Emre Telatar:
On cooperative secrecy for discrete memoryless relay networks. 2573-2577 - Ruoheng Liu, Tie Liu, H. Vincent Poor
MIMO Gaussian broadcast channels with confidential and common messages. 2578-2582 - Ersen Ekrem, Sennur Ulukus:
Gaussian MIMO broadcast channels with common and confidential messages. 2583-2587 - Ghadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani:
On the secure DoF of the single-antenna MAC. 2588-2592 - Imre Csiszár, Prakash Narayan:
Capacity of a shared secret key. 2593-2596 - Shun Watanabe
Secret key agreement from vector Gaussian sources by rate limited public communication. 2597-2601 - Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted common information. 2602-2606 - Matthieu R. Bloch:
Channel intrinsic randomness. 2607-2611 - Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
Secure computing. 2612-2616 - Motohiko Isaka:
On unconditionally secure oblivious transfer from continuous channels. 2617-2621 - Sirin Nitinawarat, Prakash Narayan:
Perfect secrecy and combinatorial tree packing. 2622-2626 - Satashu Goel, Vaneet Aggarwal
Modeling location uncertainty for eavesdroppers: A secrecy graph approach. 2627-2631 - Nebojsa Milosavljevic, Michael Gastpar, Kannan Ramchandran:
The role of game theory in key agreement over a public channel. 2632-2636 - Elizabeth Toher, Onur Ozan Koyluoglu, Hesham El Gamal:
Secrecy games over the cognitive channel. 2637-2641 - Lalitha Sankar, S. Raj Rajagopalan, H. Vincent Poor
A theory of utility and privacy of data sources. 2642-2646 - Manabu Koide, Hirosuke Yamamoto
Coding theorems for biometric systems. 2647-2651 - Farzad Farhadzadeh, Sviatoslav Voloshynovskiy
Performance analysis of identification system based on order statistics list decoder. 2652-2656 - Mark M. Wilde
Convolutional entanglement distillation. 2657-2661 - Yunfan Li, Ilya Dumer
Clustered bounded-distance decoding of codeword-stabilized quantum codes. 2662-2666 - Andreas Klappenecker:
Clifford subsystem codes. 2667-2671 - Runyao Duan, Markus Grassl
Multi-error-correcting amplitude damping codes. 2672-2676 - Y. Sano, Ryutaroh Matsumoto
Secure key rate of the BB84 protocol using finite sample bits. 2677-2681 - Hidenori Kuwakado, Masakatu Morii:
Quantum distinguisher between the 3-round Feistel cipher and the random permutation. 2682-2685 - Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler:
Perfect quantum network communication protocol based on classical network coding. 2686-2690 - Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
New classes of topological quantum codes derived from embeddings of graphs on compact surfaces. 2691-2694 - Jianxin Chen, Toby S. Cubitt
Super-duper-activation of the zero-error quantum capacity. 2695-2697 - Naresh Sharma:
Equality conditions for the quantum f-relative entropy and generalized data processing inequalities. 2698-2702 - Marco Tomamichel
Leftover Hashing against quantum side information. 2703-2707 - Manas K. Patra, Samuel L. Braunstein
An algebraic approach to information theory. 2708-2712 - Mark M. Wilde
Entanglement generation with a quantum channel and a shared state. 2713-2717 - Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel:
Entanglement transmission over arbitrarily varying quantum channels. 2718-2722
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: