Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2012: Cambridge, MA, USA
- Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012. IEEE 2012, ISBN 978-1-4673-2580-6
Source Coding with Side Information
- Avraham Reani, Neri Merhav:
Data processing lower bounds for scalar lossy source codes with side information at the decoder. 1-5 - Yi-Peng Wei, Shih-Chun Lin, Yu-Hsiu Lin, Hsuan-Jung Su
:
Graph-based code design for quadratic-Gaussian Wyner-Ziv problem with arbitrary side information. 6-10 - Osvaldo Simeone, Haim H. Permuter:
Source coding with delayed side information. 11-15 - Nan Ma, Kannan Ramchandran, David N. C. Tse:
A compression algorithm using mis-aligned side-information. 16-20
Multiple Access Codes
- Toni Ernvall, Roope Vehkalahti:
Construction of MIMO MAC codes achieving the pigeon hole bound. 21-25 - Babak Mamandipoor, Kamyar Moshksar, Amir K. Khandani:
On the sum-capacity of Gaussian MAC with peak constraint. 26-30 - Eli Haim, Yuval Kochman, Uri Erez:
Expurgation for discrete multiple-access channels via linear codes. 31-35 - Ebrahim MolavianJazi, J. Nicholas Laneman:
Simpler achievable rate regions for multiaccess with finite blocklength. 36-40
Two-Unicast Networks
- I-Hsiang Wang:
On two unicast wireless networks with destination-to-source feedback. 41-45 - I-Hsiang Wang, Suhas N. Diggavi:
On degrees of freedom of layered two unicast networks with delayed CSIT. 46-50 - Jianwei Xie, Sennur Ulukus:
On the sum secure degrees of freedom of two-unicast layered wireless networks. 51-55 - Sang-Woon Jeon, Chien-Yi Wang, Michael Gastpar:
Approximate ergodic capacity of a class of fading 2-user 2-hop networks. 56-60
Secrecy Modesl in Wiretap Channels
- Shun Watanabe, Yasutada Oohama:
Broadcast channels with confidential messages by randomness constrained stochastic encoder. 61-65 - Curt Schieler, Paul Cuff:
Secrecy is cheap if the adversary must reconstruct. 66-70 - Fan Cheng, Raymond W. Yeung, Kenneth W. Shum:
Imperfect secrecy in wiretap channel II. 71-75 - Rafael F. Wyrembelski, Holger Boche:
Strong secrecy in compound broadcast channels with confidential messages. 76-80
List Decoding and Reed-Solomon Codes
- Tom Kolan, Ron M. Roth:
Burst list decoding of interleaved Reed-Solomon codes. 81-85 - Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
List decoding algorithms based on Gröbner bases for general one-point AG codes. 86-90 - Jean-François Biasse, Guillaume Quintin:
An algorithm for list decoding number field codes. 91-95 - Guillaume Quintin:
A lifting decoding scheme and its application to interleaved linear codes. 96-100
Combinatorical Problems in Coding
- Alexander Barg, Marcelo Firer:
Translation association schemes, poset metrics, and the shape enumerator of codes. 101-105 - Eitan Yaakobi, Jehoshua Bruck:
On the uncertainty of information retrieval in associative memories. 106-110 - Erik Ordentlich, Ron M. Roth, Gadiel Seroussi:
On q-ary antipodal matchings and applications. 111-115 - Carl Bracken, Yeow Meng Chee, Punarbasu Purkayastha:
Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices. 116-119
Gaussian Channels
- Andrew R. Barron, Sanghee Cho:
High-rate sparse superposition codes with iteratively optimal estimates. 120-124 - Ronit Bustin, Shlomo Shamai (Shitz):
The capacity of the multi-MMSE constrained Gaussian channel. 125-129 - Amir Ingber, Ram Zamir:
Expurgated infinite constellations at finite dimensions. 130-134 - Tobias Koch, Alfonso Martinez, Albert Guillen i Fabregas:
The capacity loss of dense constellations. 135-139
Information Theoretic Tools and Properties
- Neri Merhav:
On optimum strategies for minimizing the exponential moments of a loss function. 140-144 - Sangwoo Park, Erchin Serpedin, Khalid A. Qaraqe:
On the equivalence between Stein identity and de Bruijn identity. 145-149 - Imre Csiszár, Frantisek Matús:
Minimization of entropy functionals revisited. 150-154 - Jorge F. Silva, Patricio Parada:
Shannon entropy convergence results in the countable infinite case. 155-159
Theory of Quantum Error Correction
- Marco Dalai:
Sphere packing bound for quantum channels. 160-164 - Sushma Nadella, Andreas Klappenecker:
Stabilizer codes over Frobenius rings. 165-169 - Andreas Klappenecker:
Nice nearrings. 170-173
Network Source Coding with Side Information
- Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula of rate-distortion functions for source coding with side information at many decoders. 174-178 - Behzad Ahmadi, Ravi Tandon, Osvaldo Simeone, H. Vincent Poor:
On the Heegard-Berger problem with common reconstruction constraints. 179-183 - Behzad Ahmadi, Osvaldo Simeone:
Distributed and cascade lossy source coding with a side information "vending machine". 184-188 - Thomas A. Courtade:
Information masking and amplification: The source coding setting. 189-193
Variations on Broadcast Channels
- Seçkin Anil Yildirim, Melda Yuksel:
Multiple description coding based compress-and-forward for the broadcast relay channel. 194-198 - Lin Song, Jun Chen, Chao Tian:
Broadcast correlated Gaussians: The vector-scalar case. 199-203 - Louis Tan, Ashish Khisti, Emina Soljanin:
Quadratic Gaussian source broadcast with individual bandwidth mismatches. 204-208 - Kfir M. Cohen, Avi Steiner, Shlomo Shamai (Shitz):
The broadcast approach under mixed delay constraints. 209-213
Multi-Hop Multi-Flow Wireless Networks
- Ilan Shomorony, Amir Salman Avestimehr:
Is Gaussian noise the worst-case additive noise in wireless networks? 214-218 - Chouchang Yang, Basel Alomair, Radha Poovendran:
Optimized flow allocation for anonymous communication in multipath wireless networks. 219-223 - Dinesh Ramasamy, Upamanyu Madhow:
Can geographic routing scale when nodes are mobile? 224-228 - Vasuki Narasimha Swamy, Rajesh Sundaresan, Pramod Viswanath:
An asymptotically optimal push-pull method for multicasting over a random network. 229-233
Wiretap Channels with Feedback, Side Information, and Common Messaes
- Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai (Shitz):
Broadcasting over fading wiretap channels. 234-238 - Zouheir Rezki, Ashish Khisti, Mohamed-Slim Alouini:
On the ergodic secret message capacity of the wiretap channel with finite-rate feedback. 239-243 - Bin Dai, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang:
Capacity region of non-degraded wiretap channel with noiseless feedback. 244-248 - Moritz Wiese, Holger Boche:
An achievable region for the Wiretap multiple-access channel with common message. 249-253
Reed-Muller Codes
- Matthieu Legeay, Pierre Loidreau:
Projected subcodes of the second order binary Reed-Muller code. 254-258 - Ilya Dumer, Olga Kapralova:
Spherically punctured biorthogonal codes. 259-263 - Iwan M. Duursma, Jiashun Shen:
Multiplicative secret sharing schemes from Reed-Muller type codes. 264-268 - José Joaquín Bernal, Juan Jacobo Simón:
Partial permutation decoding for abelian codes. 269-273
Constrained Coding
- Hiroshi Fujisaki:
On embedding conditions of shifts of finite type into the Fibonacci-Dyck shift. 274-278 - Farzad Parvaresh, Pascal O. Vontobel:
Approximately counting the number of constrained arrays via the sum-product algorithm. 279-283 - Luis Alfonso Lastras-Montaño, Mario Blaum:
On codes for structured bursts. 284-288 - Derek Leong, Tracey Ho:
Erasure coding for real-time streaming. 289-293
Capacity of Gaussian Channels
- Jihad Fahs, Ibrahim C. Abou-Faycal:
On the capacity of additive white alpha-stable noise channels. 294-298 - Hui-Ting Chang, Stefan M. Moser:
Bounds on the capacity of the additive inverse Gaussian noise channel. 299-303 - Hui Li, Dongning Guo:
Achievable rates of Gaussian channels with realistic duty cycle and power constraints. 304-308 - Georg Böcherer, Fabian Altenbach, Alex Alvarado, Steven Corroy, Rudolf Mathar:
An efficient algorithm to calculate BICM capacity. 309-313
Distributed Detection and Estimation
- Yan Wang, Yajun Mei:
Quantization effect on second moment of log-likelihood ratio and its application to decentralized sequential detection. 314-318 - Ge Xu, Biao Chen:
The sufficiency principle for decentralized data reduction. 319-323 - Jiayao Hu, Yingbin Liang, Eric P. Xing:
Nonparametric decentralized detection based on weighted count kernel. 324-328 - Lalitha Sankar, H. Vincent Poor:
Distributed estimation in multi-agent networks. 329-333
Quantum Codes from Classical Codes
- Mark M. Wilde, Joseph M. Renes:
Quantum polar codes for arbitrary channels. 334-338 - Lingfei Jin, Chaoping Xing:
A construction of quantum codes via a class of classical polynomial codes. 339-342 - Iryna Andriyanova, Denise Maurice, Jean-Pierre Tillich:
Quantum LDPC codes obtained by non-binary constructions. 343-347 - Alexandr Kovalev, Leonid P. Pryadko:
Improved quantum hypergraph-product LDPC codes. 348-352
Lossy Source Coding
- Yonatan Kaspi, Neri Merhav:
On real-time and causal secure source coding. 353-357 - David L. Neuhoff, S. Sandeep Pradhan:
Rate-distortion behavior at low distortion for densely sampled Gaussian data. 358-362 - Barlas Oguz, Venkat Anantharam:
Pointwise lossy source coding theorem for sources with memory. 363-367 - Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian rate-distortion via sparse linear regression over compact dictionaries. 368-372 - Vahid Aref, Nicolas Macris, Rüdiger L. Urbanke, Marc Vuffray:
Lossy source coding via spatially coupled LDGM ensembles. 373-377
Three-Receiver Broadcast Channels
- Chandra Nair, Lingxiao Xia:
On three-receiver more capable channels. 378-382 - Hon Fah Chong, Ying-Chang Liang:
The capacity region of some classes of parallel degraded broadcast channels with three receivers and three-degraded message sets. 383-387 - Tobias J. Oechtering, Michèle A. Wigger, Roy Timo:
Broadcast capacity regions with three receivers and message cognition. 388-392 - Saeed Hajizadeh, Ghosheh Abed Hodtani:
Three-receiver broadcast channels with side information. 393-397 - Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
Is non-unique decoding necessary? 398-402
*-and-Forward Relaying
- Chen Feng, Danilo Silva, Frank R. Kschischang:
Blind compute-and-forward. 403-407 - Talha A. Khan, Momin Uppal, Anders Høst-Madsen, Zixiang Xiong:
Rateless coded hybrid amplify/decode-forward cooperation for wireless multicast. 408-412 - Ayfer Özgür, Suhas N. Diggavi:
Dynamic QMF for half-duplex relay networks. 413-417 - Ramy H. Gohary, Halim Yanikomeroglu:
Joint optimization of the transmit covariance and the relay precoder in general Gaussian amplify-and-forward relay channels. 418-422 - Hieu T. Do, Tobias J. Oechtering, Mikael Skoglund:
Layered quantize-forward for the two-way relay channel. 423-427
Secure Communications
- László Czap, Vinod M. Prabhakaran, Suhas N. Diggavi, Christina Fragouli:
Broadcasting private messages securely. 428-432 - Ashish Khisti, Tie Liu:
On private broadcasting over independent parallel channels. 433-437 - Bin Dai, Jiehua Hong, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang:
Degraded broadcast channel with noncausal side information, confidential messages and noiseless feedback. 438-442 - Sergey Loyka, Charalambos D. Charalambous:
On optimal signaling over secure MIMO channels. 443-447 - Boulat A. Bash, Dennis Goeckel, Don Towsley:
Square root law for communication with low probability of detection on AWGN channels. 448-452
Spatially-Coupled Coding
- Shrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke:
Spatially coupled ensembles universally achieve capacity under belief propagation. 453-457 - Andrei Giurgiu, Nicolas Macris, Rüdiger L. Urbanke:
How to prove the Maxwell conjecture via spatial coupling - A proof of concept. 458-462 - Kenta Kasai, Takayuki Nozaki, Kohichi Sakaniwa:
Spatially-coupled binary MacKay-Neal codes for channels with non-binary inputs and affine subspace outputs. 463-467 - Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Improving spatially coupled LDPC codes by connecting chains. 468-472 - Hua Zhou, David G. M. Mitchell, Norbert Goertz, Daniel J. Costello Jr.:
Distance spectrum estimation of LDPC convolutional codes. 473-477
Codes and Their Applications
- Gianluigi Liva, Enrico Paolini, Michael Lentmaier, Marco Chiani:
Spatially-coupled random access on graphs. 478-482 - Michael Mitzenmacher, George Varghese:
Biff (Bloom filter) codes: Fast error correction for large data sets. 483-487 - Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic:
Distributed rateless coding with cooperative sources. 488-492 - Stefan Nowak, Ruediger Kays:
On matching short LDPC codes with spectrally-efficient modulation. 493-497 - Guang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus:
On the power transfer of error-control codes for RFID communications. 498-502
Deletion Channels
- Yuvalal Liron, Michael Langberg:
A characterization of the number of subsequences obtained via the deletion channel. 503-507 - Masato Inoue, Haruhiko Kaneko:
Adaptive synchronization marker for insertion/deletion/substitution error correction. 508-512 - Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash:
A coloring approach to constructing deletion correcting codes from constant weight subgraphs. 513-517
Directed Information, Common Information, and Divergence
- Charalambos D. Charalambous, Photios A. Stavrou:
Directed information on abstract spaces: Properties and extremum problems. 518-522 - Jiantao Jiao, Haim H. Permuter, Lei Zhao, Young-Han Kim, Tsachy Weissman:
Universal estimation of directed information via sequential probability assignments. 523-527 - Kumar Viswanatha, Emrah Akyol, Kenneth Rose:
Lossy common information of two dependent random variables. 528-532 - Peter Harremoës, Gábor E. Tusnády:
Information divergence is more χ2-distributed than the χ2-statistics. 533-537 - Amir Ahmadi-Javid:
Application of information-type divergences to constructing multiple-priors and variational preferences. 538-540
Communication Problems in Quantum Optics
- Sam Dolinar, Baris I. Erkmen, Bruce E. Moision, Kevin M. Birnbaum, Dariush Divsalar:
The ultimate limits of optical communication efficiency with photon-counting receivers. 541-545 - Saikat Guha, Mark M. Wilde:
Polar coding to achieve the Holevo capacity of a pure-loss optical channel. 546-550 - Mark M. Wilde, Saikat Guha, Si-Hui Tan, Seth Lloyd:
Explicit capacity-achieving receivers for optical communication and quantum reading. 551-555 - Ranjith Nair, Brent J. Yen, Saikat Guha, Jeffrey H. Shapiro, Stefano Pirandola:
Quantum M-ary phase shift keying. 556-560
TheSlepian-Wolf and CEO Problems
- Ahmad Beirami, Faramarz Fekri:
On lossless universal compression of distributed identical sources. 561-565 - Erdal Arikan:
Polar coding for the Slepian-Wolf problem based on monotone chain rules. 566-570 - Jia Wang, Jun Chen:
On the vector Gaussian L-terminal CEO problem. 571-575 - Ersen Ekrem, Sennur Ulukus:
An outer bound for the vector Gaussian CEO problem. 576-580
Capacity of Broadcast Channels
- Amin Aminzadeh Gohari, Chandra Nair, Venkat Anantharam:
On Marton's inner bound for broadcast channels. 581-585 - Yanlin Geng, Chandra Nair:
The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages. 586-590 - Amos Lapidoth, Ligong Wang:
The state-dependent semideterministic broadcast channel. 591-595 - Yossef Steinberg, Tsachy Weissman:
The degraded broadcast channel with action-dependent states. 596-600
Connectivity and Interference
- Olivier Dousse:
Percolation in directed random geometric graphs. 601-605 - Aris L. Moustakas, Nicholas Bambos:
Power optimization on a network: The effects of randomness. 606-610 - Andrés Altieri, Leonardo Rey Vega, Cecilia G. Galarza, Pablo Piantanida:
Cooperation versus interference in large wireless relay networks. 611-615 - Ralph Tanbourgi, Holger Jäkel, Leonid Chaichenets, Friedrich K. Jondral:
Interference and throughput in Aloha-based ad hoc networks with isotropic node distribution. 616-620
Structured Codes
- A. Makhdoumi Kakhaki, H. Karkeh Abadi, Pedram Pad, Hamid Saeedi, Farokh Marvasti, Kasra Alishahi:
Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel. 621-625 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested lattice codes for arbitrary continuous sources and channels. 626-630 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Codes over non-Abelian groups: Point-to-point communications and computation over MAC. 631-635 - Yeow Meng Chee, Punarbasu Purkayastha:
Efficient decoding of permutation codes obtained from distance preserving maps. 636-640
Codes and Graphs
- G. David Forney Jr., Heide Gluesing-Luerssen:
Observability, controllability and local reducibility of linear codes on graphs. 641-645 - Heide Gluesing-Luerssen, G. David Forney Jr.:
Reducing complexity of tail-biting trellises. 646-650 - Yongyi Mao, Terence H. Chan:
A graphical revisit of the Krawtchouk transform. 651-655 - Hans-Andrea Loeliger, Pascal O. Vontobel:
A factor-graph representation of probabilities in quantum mechanics. 656-660
Identifying Codes and Power Line Communications
- Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Chengmin Wang:
Importance of symbol equity in coded modulation for power line communications. 661-665 - Yeow Meng Chee, Han Mao Kiah, Alan C. H. Ling, Chengmin Wang:
Optimal equitable symbol weight codes for power line communications. 666-670 - Ville Junnila, Tero Laihonen, Aline Parreau:
Codes for locating objects in sensor networks. 671-675 - Ville Junnila, Tero Laihonen:
New lower bounds for identifying codes in infinite grids. 676-680
Capacity of Finite-Alphabet Channels
- Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
Improved upper bounds on the capacity of binary channels with causal adversaries. 681-685 - Brian M. Kurkoski, Hideki Yagi:
Finding the capacity of a quantized binary-input DMC. 686-690 - Mojtaba Rahmati, Tolga M. Duman:
On the capacity of binary input symmetric q-ary output channels with synchronization errors. 691-695 - Camilo G. Taborda, Fernando Pérez-Cruz:
Mutual information and relative entropy over the Binomial and Negative Binomial channels. 696-700
Information and Estimation
- Kartik Venkat, Tsachy Weissman:
Pointwise relations between information and estimation in Gaussian noise. 701-705 - Yeow-Khiang Chia, Rajiv Soundararajan, Tsachy Weissman:
Estimation with a helper who knows the interference. 706-710 - Tatsuto Murayama, Peter Davis:
Rate distortion codes for the collective estimation from independent noisy observations. 711-715 - Inaki Esnaola, Antonia Maria Tulino, H. Vincent Poor:
Mismatched MMSE estimation of multivariate Gaussian sources. 716-720
Quantum Channels in Network Information Theory
- Ivan Savov, Mark M. Wilde:
Classical codes for quantum broadcast channels. 721-725 - Minglai Cai, Ning Cai, Christian Deppe:
Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. 726-730 - Ivan Savov, Mark M. Wilde, Mai Vu:
Partial decode-forward for quantum relay channels. 731-735 - Pranab Sen:
Achieving the Han-Kobayashi inner bound for the quantum interference channel. 736-740
Coding for L1 Distance and Asymmetric Errors
- Luca G. Tallini, Bella Bose:
On symmetric L1 distance error control codes and elementary symmetric functions. 741-745 - Luca G. Tallini, Bella Bose:
On symmetric/asymmetric Lee distance error control codes and elementary symmetric functions. 746-750 - Markus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng:
New constructions of codes for asymmetric channels via concatenation. 751-755
Multiterminal Source Coding
- Badri N. Vellambi:
The effect of zero-rate encoders in the multi-terminal source coding problem. 756-760 - Thomas A. Courtade, Tsachy Weissman:
Multiterminal source coding under logarithmic loss. 761-765 - Milad Sefidgaran, Aslan Tchamkerten:
On cooperation in multi-terminal computation and rate distortion. 766-770 - Sheng Huang, Mikael Skoglund:
Polynomials and computing functions of correlated sources. 771-775
Relay Channels
- Feng Xue:
An upper bound on relaying over capacity. 776-780 - Nikola Zlatanov, Robert Schober, Lutz Lampe:
Buffer-aided relaying in a three node network. 781-785 - Lawrence Ong, Sarah J. Johnson:
The capacity region of restricted multi-way relay channels with deterministic uplinks. 786-790 - Lawrence Ong, Roy Timo, Sarah J. Johnson:
The finite field multi-way relay channel with correlated sources: Beyond three users. 791-795
Energy-Efficient Communication
- Anders Høst-Madsen, Nan Jiang, Yang Yang, Zixiang Xiong:
Reliable versus unreliable transmission for energy efficient transmission in relay networks. 796-800 - Ilan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr:
Bounds on the minimum energy-per-bit for bursty traffic in diamond networks. 801-805 - Mustafa Ozmen, Mustafa Cenk Gursoy:
Impact of channel and source variations on the energy efficiency under QoS constraints. 806-810 - Arun Sridharan, Changhee Joo, Can Emre Koksal:
Energy efficient greedy link scheduling and power control in wireless networks. 811-815
Finite Blocklength Analysis
- Ryo Nomura, Te Sun Han:
Second-order achievable rates in random number generation for mixed sources. 816-820 - Igal Sason:
Moderate deviations analysis of binary hypothesis testing. 821-825 - Pierre Moulin:
The log-volume of optimal constant-composition codes for memoryless channels, within O(1) bits. 826-830 - Yen-Wei Huang, Pierre Moulin:
Finite blocklength coding for multiple access channels. 831-835
Boolean Functions and Related Topics
- Sihem Mesnager, Jean-Pierre Flori:
Hyper-bent functions via Dillon-like exponents. 836-840 - Nian Li, Xiaohu Tang, Tor Helleseth:
New classes of generalized boolean bent functions over Z4. 841-845 - Paul Stankovski, Martin Hell:
An optimal sampling technique for distinguishing random S-boxes. 846-850 - Farhad Hemmati:
Cross-recurrence property of m-sequences. 851-854
Continuous Time Channels and Shannon Ordering
- Yuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith:
Channel capacity under general nonuniform sampling. 855-859 - Ioana Ivan, Michael Mitzenmacher, Justin Thaler, Henry S. Yuen:
Continuous time channels with interference. 860-864 - Yuan Zhang, Cihan Tepedelenlioglu:
On establishing the Shannon ordering for discrete memoryless channels. 865-869 - Adithya Rajan, Cihan Tepedelenlioglu:
Ergodic capacity ordering of fading channels. 870-874
Prediction and Estimation
- Zsolt Talata:
Penalized maximum likelihood methods for finite memory estimators of infinite memory processes. 875-879 - Erik Ordentlich, Marcelo J. Weinberger, Yihong Wu:
Piecewise constant prediction. 880-884 - András György, Tamás Linder, Gábor Lugosi:
Efficient tracking of large classes of experts. 885-889
Secrecy in Quantum Communications
- Masahito Hayashi:
Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker. 890-894 - Masahito Hayashi:
Quantum wiretap channel with non-uniform random number and its exponent of leaked information. 895-899 - Mario Berta, Matthias Christandl, Fernando G. S. L. Brandão, Stephanie Wehner:
Entanglement cost of quantum channels. 900-904 - Joanne L. Hall, Jan Stovicek:
Mutually unbiased bases as submodules and subspaces. 905-909
Finite Blocklength Analysis for Source Coding
- Shigeaki Kuzuoka:
A simple technique for bounding the redundancy of source coding with side information. 910-914 - Vincent Y. F. Tan, Oliver Kosut:
The dispersion of Slepian-Wolf coding. 915-919 - Vincent Y. F. Tan:
Moderate-deviations of lossy source coding for discrete and Gaussian sources. 920-924 - Neri Merhav:
Relations between redundancy patterns of the Shannon code and wave diffraction patterns of partially disordered media. 925-929
Code Design for Relay Channels
- Puripong Suthisopapan, Kenta Kasai, Anupap Meesomboon, Virasit Imtawil, Kohichi Sakaniwa:
Code design for very noisy relay channels. 930-934 - Camilla Hollanti, Nadya Markin:
Algebraic fast-decodable relay codes for distributed communications. 935-939 - Farzad Parvaresh, Raúl H. Etkin:
Superposition of binary and Gaussian codebooks to relay data in diamond networks. 940-944 - Marina Ivashkina, Iryna Andriyanova, Pablo Piantanida, Charly Poulliat:
Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channel. 945-949
Energy Harvesting
- Liang Liu, Rui Zhang, Kee-Chaing Chua:
Wireless information transfer with opportunistic energy harvesting. 950-954 - Shixin Luo, Rui Zhang, Teng Joon Lim:
Optimal save-then-transmit protocol for energy harvesting wireless transmitters. 955-959 - Patrick Mitran:
On optimal online policies in energy harvesting systems for compound poisson energy arrivals. 960-964 - Berk Gurakan, Omur Ozel, Jing Yang, Sennur Ulukus:
Energy cooperation in energy harvesting wireless communications. 965-969
Distributed Applications
- Keqin Liu, Qing Zhao:
Dynamic intrusion detection in resource-constrained cyber networks. 970-974 - Xiaofan He, Huaiyu Dai, Peng Ning:
A Byzantine attack defender: The Conditional Frequency Check. 975-979 - Kyomin Jung, Bo Young Kim, Milan Vojnovic:
Distributed ranking in networks with limited memory and communication. 980-984 - Qiaomin Xie, Yi Lu:
Degree-guided map-reduce task assignment with data locality constraint. 985-989
Coding for Flash Memories
- Eyal En Gad, Anxiao Jiang, Jehoshua Bruck:
Trade-offs between instantaneous and total capacity in multi-cell flash memories. 990-994 - Minghai Qin, Eitan Yaakobi, Paul H. Siegel:
Optimized cell programming for flash memories with quantizers. 995-999 - Ryan Gabrys, Eitan Yaakobi, Laura M. Grupp, Steven Swanson, Lara Dolecek:
Tackling intracell variability in TLC Flash through tensor product codes. 1000-1004 - Ramji Venkataramanan, Sekhar Tatikonda, Luis Alfonso Lastras-Montaño, Michele Franceschini:
Coding strategies for the uniform noise rewritable channel with hidden state. 1005-1009
Sequences: Theory and Applications
- Zi Long Liu, Yong Liang Guan:
Meeting the Levenshtein bound with equality by weighted-correlation complementary set. 1010-1013 - Ji-Youp Kim, Sung-Tai Choi, Tae-Hyung Lim, Jong-Seon No, Habong Chung:
On the cross-correlation of ternary m-sequences of period 34k+2 - 1 with decimation 34k+2 - 32k+1 +2/4 + 32k+1. 1014-1018 - Guang Gong, Fei Huo, Yang Yang:
Large zero periodic autocorrelation zone of Golay sequences. 1019-1023 - Yang Yang, Fei Huo, Guang Gong:
Large zero odd periodic autocorrelation zone of Golay sequences and QAM Golay sequences. 1024-1028
Tools for Bounding Capacity
- Shao-Lun Huang, Lizhong Zheng:
Linear information coupling problems. 1029-1033 - Silas L. Fong, Raymond W. Yeung, Gerhard Kramer:
Cut-set bound for generalized networks. 1034-1038 - Silas L. Fong, Raymond W. Yeung:
Cut-set bound for generalized networks with positive delay. 1039-1043 - Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari:
Achievability proof via output statistics of random binning. 1044-1048
Probability and Estimation
- Jan C. Willems:
Constrained probability. 1049-1053 - Martin A. Vinck, Francesco P. Battaglia, Vladimir B. Balakirsky, A. J. Han Vinck, Cyriel M. A. Pennartz:
Estimation of the entropy on the basis of its polynomial representation. 1054-1058 - Debarghya Ghoshdastidar, Ambedkar Dukkipati, Shalabh Bhatnagar:
q-Gaussian based Smoothed Functional algorithms for stochastic optimization. 1059-1063 - Amir Hesam Salavati, Amin Karbasi:
Multi-level error-resilient neural networks. 1064-1068
Tools for Quantum Information Theory
- Lev B. Levitin, Tommaso Toffoli:
Work recoverable from two-particle information. 1069-1071 - Katy Marchand, Jaideep Mulherkar, Bruno Nachtergaele:
Entropy rate calculations of algebraic measures. 1072-1076 - Kentaro Kato:
Necessary and sufficient conditions for minimax strategy in quantum signal detection. 1077-1081 - Joanne L. Hall, Asha Rao, Diane M. Donovan:
Planar difference functions. 1082-1086
Lossless and Universal Source Coding
- Ahmad Beirami, Mohsen Sardari, Faramarz Fekri:
Results on the fundamental gain of memory-assisted universal source coding. 1087-1091 - Hirotada Fukae, Takahiro Ota, Hiroyoshi Morita:
On fast and memory-efficient construction of an antidictionary array. 1092-1096 - Ryo Nomura, Toshiyasu Matsushima:
Information spectrum approach to overflow probability of variable-length codes with conditional cost function. 1097-1101 - Luciana Vitale, Alvaro Martín, Gadiel Seroussi:
Bounds on estimated Markov orders of individual sequences. 1102-1106 - Hongchao Zhou, Jehoshua Bruck:
Variable-length extractors. 1107-1111
Relay Channels in Wireless Networks
- Siddhartha Brahma, Ayfer Özgür, Christina Fragouli:
Simple schedules for half-duplex networks. 1112-1116 - Mohit Thakur, Nadia Fawaz, Muriel Médard:
Reducibility of joint relay positioning and flow optimization problem. 1117-1121 - Nikolaos Pappas, Jeongho Jeon, Anthony Ephremides, Apostolos Traganitis:
Wireless network-level partial relay cooperation. 1122-1126 - Fanggang Wang, Soung Chang Liew, Dongning Guo:
Wireless MIMO switching with MMSE relaying. 1127-1131
Cellular Networks
- Angel E. Lozano, Jeffrey G. Andrews, Robert W. Heath Jr.:
Spectral efficiency limits in pilot-assisted cooperative communications. 1132-1136 - Alexei E. Ashikhmin, Thomas L. Marzetta:
Pilot contamination precoding in multi-cell large scale antenna systems. 1137-1141 - Yunus Sarikaya, Özgür Erçetin, Can Emre Koksal:
Wireless network control with privacy using hybrid ARQ. 1142-1146 - Song-Nam Hong, Giuseppe Caire:
Reverse compute and forward: A low-complexity architecture for downlink distributed antenna systems. 1147-1151 - Rusdha Muharar, Randa Zakhour, Jamie S. Evans:
Base station cooperation with limited feedback: A large system analysis. 1152-1156
Secrecy in Computation and Communication
- Himanshu Tyagi:
Distributed computing with privacy. 1157-1161 - Navin Kashyap, V. Shashank, Andrew Thangaraj:
Secure computation in a bidirectional relay. 1162-1166 - Sadaf Salehkalaibar, Mohammad Reza Aref:
On the secrecy capacity of 3-receiver Broadcast Channel with causal states and conferencing. 1167-1171 - Matthieu R. Bloch, Jörg Kliewer:
On secure communication with constrained randomization. 1172-1176 - Joffrey Villard, Pablo Piantanida, Shlomo Shamai (Shitz):
Secure transmission of a Gaussian source over Gaussian channels with side information. 1177-1181
Regenerating Codes
- Zhiying Wang, Itzhak Tamo, Jehoshua Bruck:
Long MDS codes for optimal repair bandwidth. 1182-1186 - Itzhak Tamo, Zhiying Wang, Jehoshua Bruck:
Access vs. bandwidth in codes for storage. 1187-1191 - Kenneth W. Shum, Yuchong Hu:
Functional-repair-by-transfer regenerating codes. 1192-1196 - Nicolas Le Scouarnec:
Exact scalar minimum storage coordinated regenerating codes. 1197-1201 - K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating codes for errors and erasures in distributed storage. 1202-1206
Sequences and Their Properties
- Gohar M. Kyureghyan, Valentin Suder:
On inverses of APN exponents. 1207-1211 - Lilya Budaghyan, Claude Carlet, Tor Helleseth, Alexander Kholosha:
Generalized bent functions and their relation to Maiorana-McFarland class. 1212-1215 - Jinquan Luo, Tor Helleseth:
Binary Niho sequences with four-valued cross correlations. 1216-1220 - Min Zeng, Yuan Luo, Guang Gong:
Rotating-table game and construction of periodic sequences with lightweight calculation. 1221-1225 - Serdar Boztas, Udaya Parampalli:
Low Probability of Intercept properties of some binary sequence families with good correlation properties. 1226-1230
Approximate Belief Propagation
- David L. Donoho, Adel Javanmard, Andrea Montanari:
Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing. 1231-1235 - Sundeep Rangan, Alyson K. Fletcher, Vivek K. Goyal, Philip Schniter:
Hybrid generalized approximate message passing with applications to structured sparsity. 1236-1240 - Nima Noorshams, Martin J. Wainwright:
Quantized stochastic belief propagation: Efficient message-passing for continuous state spaces. 1241-1245 - Sundeep Rangan, Alyson K. Fletcher:
Iterative estimation of constrained rank-one matrices in noise. 1246-1250
Information Inequalities
- Terence H. Chan, Dongning Guo, Raymond W. Yeung:
Entropy functions and determinant inequalities. 1251-1255 - Siu-Wai Ho, Terence Chan, Alex J. Grant:
Non-entropic inequalities from information constraints. 1256-1260 - Ioannis Kontoyiannis, Mokshay M. Madiman:
Sumset inequalities for differential entropy and mutual information. 1261-1265 - Sangwoo Park, Erchin Serpedin, Khalid A. Qaraqe:
An information theoretic perspective over an extremal entropy inequality. 1266-1270 - Neri Merhav:
Data processing inequalities based on a certain structured class of information measures with application to estimation theory. 1271-1275
Compressive Sensing
- John Wright, Arvind Ganesh, Kerui Min, Yi Ma:
Compressive principal component pursuit. 1276-1280 - Arvind Ganesh, Kerui Min, John Wright, Yi Ma:
Principal Component Pursuit with reduced linear measurements. 1281-1285 - Tianyi Zhou, Dacheng Tao:
Bilateral random projections. 1286-1290 - Philipp Walk, Peter Jung:
Compressed sensing on the image of bilinear maps. 1291-1295 - Chinmay Hegde, Richard G. Baraniuk:
SPIN: Iterative signal recovery on incoherent manifolds. 1296-1300
Network Coding: Code Design and Resource Allocation
- Shigeki Miyake, Jun Muramatsu:
On a construction of universal network code using LDPC matrices. 1301-1305 - B. Javad Ebrahimi, Christina Fragouli:
Properties of network polynomials. 1306-1310 - Dan Zhang, Kai Su, Narayan B. Mandayam:
Network coding aware resource allocation to improve throughput. 1311-1315 - Xunrui Yin, Yan Wang, Xin Wang, Xiangyang Xue, Zongpeng Li:
Min-cost multicast networks in Euclidean space. 1316-1320
Relay Strategies for Network Communications
- Arash Behboodi, Pablo Piantanida:
Selective coding strategy for unicast composite networks. 1321-1325 - Ihn-Jung Baik, Sae-Young Chung:
Causal relay networks with causal side information. 1326-1330 - Zhuohua Wu, Mai Vu:
Partial decode-forward binning for full-duplex causal cognitive interference channels. 1331-1335 - Peng Zhong, Mai Vu:
Combined decode-forward and layered noisy network coding schemes for relay channels. 1336-1340
Energy Issues in Communication Systems
- Xi Liu, Osvaldo Simeone, Elza Erkip:
Energy-efficient sensing and communication of parallel Gaussian sources. 1341-1345 - Mostafa Khoshnevisan, J. Nicholas Laneman:
Achievable rates for intermittent communication. 1346-1350 - Omur Ozel, Sennur Ulukus:
Energy state amplification in an energy harvesting communication system. 1351-1355 - Lav R. Varshney:
On energy/information cross-layer architectures. 1356-1360
Multiple Description Coding
- Lin Song, Jun Chen, Jia Wang, Tie Liu:
Gaussian robust sequential and predictive coding. 1361-1365 - Himanshu Asnani, Haim H. Permuter, Tsachy Weissman:
Successive refinement with cribbing decoders and its channel coding duals. 1366-1370 - Emrah Akyol, Kumar Viswanatha, Kenneth Rose:
Combinatorial message sharing and random binning for multiple description coding. 1371-1375 - Ravi Tandon, Behzad Ahmadi, Osvaldo Simeone, H. Vincent Poor:
Gaussian multiple descriptions with common and constrained reconstruction constraints. 1376-1380
WOM Codes
- Nicolas Bitouze, Alexandre Graell i Amat, Eirik Rosnes:
Making WOM codes decodable using short synchronous WOM codes. 1381-1385 - Eitan Yaakobi, Amir Shpilka:
High sum-rate three-write and non-binary WOM codes. 1386-1390 - Yuval Cassuto, Eitan Yaakobi:
Short q-ary WOM codes with hot/cold write differentiation. 1391-1395 - Lele Wang, Minghai Qin, Eitan Yaakobi, Young-Han Kim, Paul H. Siegel:
WOM with retained messages. 1396-1400
New Sequence Constructions
- Elaheh Mohammadi, Amin Gohari, Hassan Aghaeinia:
Transmission of non-linear binary input functions over a CDMA system. 1401-1405 - Nam Yul Yu:
New near-optimal codebooks associated with binary Sidelnikov sequences. 1406-1410 - Chunlei Li, Tor Helleseth:
New nonbinary sequence families with low correlation and large linear span. 1411-1415 - Jin-Ho Chung, Kyeongcheol Yang:
New constructions of asymptotically optimal optical orthogonal codes with λ = 1. 1416-1420 - Andrzej K. Brodzik:
New polyphase sequence sets with all-zero cross-correlation. 1421-1424
Communication Theory
- Kostis Xenoulis, Nicholas Kalouptsidis, Igal Sason:
New achievable rates for nonlinear Volterra channels via martingale inequalities. 1425-1429 - Adithya Rajan, Cihan Tepedelenlioglu:
On the complete monotonicity of symbol error rates. 1430-1434 - Ryota Yoshizawa, Hideki Ochiai:
A serial concatenation of coding and trellis shaping for OFDM systems with peak power reduction. 1435-1439 - Stella Achtenberg, Dan Raphaeli:
Achievable gains in peak power reduction via single-carrier distribution shaping. 1440-1444
Estimation and Detection
- Gérard Biau, Adam Krzyzak, Luc Devroye, Vida Dujmovic:
An affine invariant k-nearest neighbor regression estimate. 1445-1447 - Swarnendu Kar, Pramod K. Varshney:
On linear coherent estimation with spatial collaboration. 1448-1452 - Hang Yu, Zheng Choo, Justin Dauwels, Philip Jonathan, Qiao Zhou:
Modeling spatially-dependent extreme events with Markov random field priors. 1453-1457 - Yiming Chen, Shayan Garani Srinivasa:
Signal detection algorithms for two-dimensional intersymbol-interference channels. 1458-1462
Sampling and Signaling
- Graeme Pope, Helmut Bölcskei:
Sparse signal recovery in Hilbert spaces. 1463-1467 - Jayakrishnan Unnikrishnan, Martin Vetterli:
On sampling a high-dimensional bandlimited field on a union of shifted lattices. 1468-1472 - Kishore Jaganathan, Samet Oymak, Babak Hassibi:
Recovery of sparse 1-D signals from the magnitudes of their Fourier transform. 1473-1477 - Jing Zhou, Daoben Li, Xuesong Wang:
Generalized faster-than-Nyquist signaling. 1478-1482
Network Coding: Security and Reliability
- Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Explicit construction of universal strongly secure network coding via MRD codes. 1483-1487 - Hessam Mahdavifar, Alexander Vardy:
List-decoding of subspace codes and rank-metric codes up to Singleton bound. 1488-1492 - Prasad Krishnan, B. Sundar Rajan:
A matroidal framework for network-error correcting codes. 1493-1497 - Chung Chan:
Matroidal undirected network. 1498-1502
Relaying over Interference Networks
- Anas Chaaban, Aydin Sezgin:
The DoF of the K-user interference channel with a cognitive relay. 1503-1507 - Anas Chaaban, Aydin Sezgin:
Lattice coding and the generalized degrees of freedom of the interference channel with relay. 1508-1512 - Ye Tian, Aylin Yener:
Guiding blind transmitters: Relay-aided interference alignment for the X channel. 1513-1517 - Mahdi Zamani, Amir K. Khandani:
Broadcast approaches to dual-hop parallel relay networks. 1518-1522
Degrees of Freedom and Scaling
- Massimo Franceschetti:
On the information content of scattered waves. 1523-1527 - Sang-Woon Jeon, Naveen Goela, Michael Gastpar:
Degrees of freedom of sparsely connected wireless networks. 1528-1532 - Alla Merzakreeva, Olivier Lévêque, Ayfer Özgür:
Hierarchical beamforming for large one-dimensional wireless networks. 1533-1537 - Aly El Gamal, V. Sreekanth Annapureddy, Venugopal V. Veeravalli:
Degrees of freedom (DoF) of locally connected interference channels with cooperating multiple-antenna transmitters. 1538-1542
Joint Source-Channel Codes
- Emrah Akyol, Kenneth Rose:
On linear transforms in zero-delay Gaussian source channel coding. 1543-1547 - Adrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Tobias Koch, Alfonso Martinez:
Achieving Csiszár's source-channel coding exponent with product distributions. 1548-1552 - Victoria Kostina, Sergio Verdú:
Lossy joint source-channel coding in the finite blocklength regime. 1553-1557 - Arya Mazumdar, Gregory W. Wornell, Venkat Chandar:
Update efficient codes for error correction. 1558-1562
Linear Codes and UEP Codes
- Yanling Chen, Markku Niemenmaa, A. J. Han Vinck, Danilo Gligoroski:
On some properties of a check digit system. 1563-1567 - Markus Grassl, Sunghyu Han:
Computing extensions of linear codes using a greedy algorithm. 1568-1572 - Felipe Cinelli Barbosa, Jörg Kliewer, Max H. M. Costa:
An algebraic framework for concatenated linear block codes in side information based problems. 1573-1577 - Jin Soo Park, Ki-Hyeon Park, Hong-Yeop Song:
Rate allocation for component codes of Plotkin-type UEP codes. 1578-1582
Synchrony and Perfect Secrecy
- Ueli Maurer, Björn Tackmann:
Synchrony amplification. 1583-1587 - Neri Merhav:
Perfectly secure encryption of individual sequences. 1588-1592 - Chinthani Uduwerelle, Siu-Wai Ho, Terence Chan:
Design of error-free perfect secrecy system by prefix codes and partition codes. 1593-1597
Medium Access Control
- Subhash Lakshminarayana, Bin Li, Mohamad Assaad, Atilla Eryilmaz, Mérouane Debbah:
A fast-CSMA based distributed scheduling algorithm under SINR model. 1598-1602 - Douglas S. Chan, Toby Berger:
Upper bound for the capacity of multiple access protocols on multipacket reception channels. 1603-1607 - Jeongho Jeon, Anthony Ephremides:
Effect of channel estimation errors on the stability of channel-aware random access. 1608-1612 - Fatemeh Fazel, Maryam Fazel, Milica Stojanovic:
Random access compressed sensing over fading and noisy communication channels. 1613-1617
Portfolios and Estimation
- Justin K. Rising, Abraham J. Wyner:
Partial Kelly portfolios and shrinkage estimators. 1618-1622 - Mariko Tsurusaki, Jun'ichi Takeuchi:
Constant Markov Portfolio and its application to universal portfolio with side information. 1623-1627 - Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Estimating multiple concurrent processes. 1628-1632 - Adel Javanmard, Li Zhang:
The minimax risk of truncated series estimators for symmetric convex polytopes. 1633-1637
Compressive Sensing and Phase Transitions
- Yihong Wu, Sergio Verdú:
Optimal phase transitions in compressed sensing with noisy measurements. 1638-1642 - Mohsen Bayati, Marc Lelarge, Andrea Montanari:
Universality in polytope phase transitions and iterative algorithms. 1643-1647 - Sangjun Park, Heung-No Lee:
Number of compressed measurements needed for noisy distributed compressed sensing. 1648-1651 - Ryuhei Mori, Toshiyuki Tanaka:
Central approximation in statistical physics and information theory. 1652-1656
Network Coding: Capadity and Bounds
- Sudeep Kamath, Pramod Viswanath:
An information-theoretic meta-theorem on edge-cut bounds. 1657-1661 - Jinjing Jiang, Neeharika Marukala, Tie Liu:
Symmetrical multilevel diversity coding with an all-access encoder. 1662-1666 - Mayank Bakshi, Michelle Effros:
On network coding capacity under on-off scheduling. 1667-1671 - Mahdi Jafari Siavoshani, Shenghao Yang, Raymond W. Yeung:
Non-coherent network coding: An arbitrarily varying channel approach. 1672-1676 - Jie Hou, Gerhard Kramer:
Short message noisy network coding for multiple sources. 1677-1681
Multiple Access Channels with Side Information
- Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai (Shitz):
Wyner-Ziv type versus noisy network coding for a state-dependent MAC. 1682-1686 - Lior Dikstein, Haim H. Permuter, Shlomo Shamai (Shitz):
MAC with action-dependent state information at one encoder. 1687-1691 - Ziv Goldfeld, Haim H. Permuter, Benjamin M. Zaidel:
Capacity region of the finite state MAC with cooperative encoders and delayed CSI. 1692-1696 - Nevroz Sen, Fady Alajaji, Serdar Yüksel, Giacomo Como:
Multiple access channel with various degrees of asymmetric state information. 1697-1701 - Elham Bahmani, Ghosheh Abed Hodtani:
Achievable rate regions for the dirty multiple access channel with partial side information at the transmitters. 1702-1706
MIMO Capacity
- Jun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, Kai-Kit Wong:
On asymptotic capacity of coordinated multi-point MIMO channels with spatial correlation and LOS. 1707-1711 - Puripong Suthisopapan, Kenta Kasai, Virasit Imtawil, Anupap Meesomboon:
Approaching capacity of large MIMO systems by non-binary LDPC codes and MMSE detection. 1712-1716 - Wei Yang, Giuseppe Durisi, Erwin Riegler:
Unitary isotropically distributed inputs are not capacity-achieving for large-MIMO fading channels. 1717-1721 - Mahdi Zamani, Amir K. Khandani:
Maximum throughput and expected-rate in multiple transmit antenna systems. 1722-1726
Coding with Lattices
- Yair Yona, Meir Feder:
Max-product algorithm for low density lattice codes. 1727-1731 - Yuval Domb, Meir Feder:
Non-random coding error exponent for lattices. 1732-1736 - Hironori Uchikawa, Brian M. Kurkoski, Kenta Kasai, Kohichi Sakaniwa:
Iterative encoding with Gauss-Seidel method for spatially-coupled low-density lattice codes. 1737-1741 - Ayal Hitron, Uri Erez:
Optimality of linear codes over PAM for the modulo-additive Gaussian channel. 1742-1746 - Fuchun Lin, Frédérique E. Oggier:
Secrecy gain of Gaussian wiretap codes from 2- and 3-modular lattices. 1747-1751
Rateless Codes
- Megasthenis Asteris, Alexandros G. Dimakis:
Repairable Fountain codes. 1752-1756 - Jesper H. Sørensen, Toshiaki Koike-Akino, Philip V. Orlik, Jan Østergaard, Petar Popovski:
Ripple design of LT codes for AWGN channel. 1757-1761 - Birgit Schotsch, Radu Lupoaie:
Finite length LT codes over Fq for unequal error protection with biased sampling of input nodes. 1762-1766 - Jesper H. Sørensen, Toshiaki Koike-Akino, Philip V. Orlik:
Rateless feedback codes. 1767-1771 - Navot Blits, Meir Feder:
Universal rateless coding with finite message set. 1772-1776
Secret Key Generation and Sharing
- Remi A. Chou, Matthieu R. Bloch:
One-way rate-limited sequential key-distillation. 1777-1781 - Chung Chan:
Agreement of a restricted secret key. 1782-1786 - Himanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan:
Fault-tolerant secret key generation. 1787-1791 - Frans M. J. Willems, Tanya Ignatenko:
Authentication based on secret-key generation. 1792-1796 - Osman Yagan, Armand M. Makowski:
Connectivity results for sensor networks under a random pairwise key predistribution scheme. 1797-1801
Cognitive Channels
- Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, Moe Z. Win:
Optimal active sensing in heterogeneous cognitive radio networks. 1802-1806 - Anthony Fanous, Anthony Ephremides:
Effect of secondary nodes on the primary's stable throughput in a cognitive wireless network. 1807-1811 - Stefano Rini, Carolin Huppert:
The capacity of the semi-deterministic cognitive interference channel with a common cognitive message and approximate capacity for the Gaussian case. 1812-1816 - Myung Gil Kang, Wan Choi:
The capacity of a three-user interference channel with a cognitive transmitter in strong interference. 1817-1821 - Ruchen Duan, Yingbin Liang:
Gaussian cognitive interference channels with state. 1822-1826
Group Testing and Detection
- Mark A. Davenport, Ery Arias-Castro:
Compressive binary search. 1827-1831 - Matthew Aldridge:
Adaptive group testing as channel coding with feedback. 1832-1836 - Chun Lam Chan, Sidharth Jaggi, Venkatesh Saligrama, Samar Agnihotri:
Non-adaptive group testing: Explicit bounds and novel algorithms. 1837-1841 - Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
Adaptive sensing using deterministic partial Hadamard matrices. 1842-1846 - Amin Emad, Olgica Milenkovic:
Semi-quantitative group testing. 1847-1851
Compressive Sensing and Algorithms
- Sina Jafarpour, Marco F. Duarte, A. Robert Calderbank:
Beyond worst-case reconstruction in deterministic compressed sensing. 1852-1856 - Shirin Jalali, Arian Maleki, Richard G. Baraniuk:
Minimum complexity pursuit: Stability analysis. 1857-1861 - Tianyi Zhou, Dacheng Tao:
1-bit Hamming compressed sensing. 1862-1866 - Francisco Ramirez-Javega, Meritxell Lamarca, Javier Villares:
Binary graphs and message passing strategies for Compressed Sensing in the noiseless setting. 1867-1871 - Yaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris:
Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensing. 1872-1876
Interference Channels with Delayed CSI
- Ravi Tandon, Soheil Mohajer, H. Vincent Poor, Shlomo Shamai:
On X-channels with feedback and delayed CSI. 1877-1881 - Alireza Vahid, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Binary fading interference channel with delayed feedback. 1882-1886 - Jinyuan Chen, Raymond Knopp, Petros Elia:
Interference alignment for achieving both full DoF and full diversity in the broadcast channel with delayed CSIT. 1887-1891 - Akbar Ghasemi, Mohammad Javad Abdoli, Amir K. Khandani:
On the degrees of freedom of MIMO X channel with delayed CSIT. 1892-1896
Network Coding for Multiple Unicast Sessions
- Zongpeng Li, Chuan Wu:
Space information flow: Multiple unicast. 1897-1901 - Teja Damodaram Bavirisetti, Abhinav Ganesan, Prasad Krishnan, B. Sundar Rajan:
A transform approach to linear network coding for acyclic networks with delay. 1902-1906 - Chun Meng, Abinesh Ramakrishnan, Athina Markopoulou, Syed Ali Jafar:
On the feasibility of precoding-based network alignment for three unicast sessions. 1907-1911 - Wentu Song, Rongquan Feng, Kai Cai, Junshan Zhang:
Network coding for two-unicast with rate (1, 2). 1912-1916
Deterministic Models
- Seyyed Hasan Mahboubi, Ehsan Ebrahimzadeh, Amir K. Khandani:
Random access in wireless X network: A deterministic view. 1917-1921 - Javad Behrouzi Moghaddam, Akbar Ghasemi, Amir K. Khandani:
A deterministic approach to random access interference channel. 1922-1926 - Se Yong Park, Gireeja Ranade, Anant Sahai:
Carry-free models and beyond. 1927-1931 - Onur Ozan Koyluoglu, Kumar Appaiah, Hongbo Si, Sriram Vishwanath:
Expansion coding: Achieving the capacity of an AEN channel. 1932-1936
Joint Source-Channel Coding in Networks
- Yonathan Murin, Ron Dabora, Deniz Gündüz:
Joint source-channel coding for the multiple-access relay channel. 1937-1941 - Sadaf Salehkalaibar, Mohammad Reza Aref:
On source transmission over some classes of relay channels. 1942-1946 - Hamidreza Ebrahimzadeh Saffar, Masoud Badiei Khuzani, Patrick Mitran:
Lossy source-channel communication over a phase-incoherent interference relay channel. 1947-1951 - Eliron Amir, Yossef Steinberg:
Joint source-channel coding for cribbing models. 1952-1956
Polar Codes: Theory and Practice
- Ali Goli, Seyed Hamed Hassani, Rüdiger L. Urbanke:
Universal bounds on the scaling behavior of polar codes. 1957-1961 - Seyed Hamed Hassani, Rüdiger L. Urbanke:
Polar codes: Robustness of the successive cancellation decoder with respect to quantization. 1962-1966 - Sinan Kahraman, Mehmet Ertugrul Çelebi:
Code based efficient maximum-likelihood decoding of short polar codes. 1967-1971 - David Burshtein, Alona Strugatski:
Polar write once memory codes. 1972-1976
Authentication and Signatures
- Vladimir B. Balakirsky, A. J. Han Vinck:
Authentication over noisy data with the use of memory containing metric functions. 1977-1981 - Philippe Gaborit, Julien Schrek:
Efficient code-based one-time signature from automorphism groups with syndrome compatibility. 1982-1986 - Ely Porat, Erez Waisbard:
Efficient signature scheme for network coding. 1987-1991
Message Passing Algorithms
- Erman Ayday, Arash Einolghozati, Faramarz Fekri:
BPRS: Belief Propagation based iterative recommender system. 1992-1996 - Guoqiang Zhang, Richard Heusdens:
Convergence of generalized linear coordinate-descent message-passing for quadratic optimization. 1997-2001 - Yousef El-Kurdi, Dennis Giannacopoulos, Warren J. Gross:
Relaxed Gaussian Belief Propagation. 2002-2006 - XuanLong Nguyen, Arash A. Amini, Ram Rajagopal:
Message-passing sequential detection of multiple change points in networks. 2007-2011
Patterns, Estimation, Hypothesis Testing
- Pascal O. Vontobel:
The Bethe approximation of the pattern maximum likelihood distribution. 2012-2016 - Farzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic:
Alternating Markov chains for distribution estimation in the presence of errors. 2017-2021 - Zineb Noumir, Paul Honeine, Cedue Richard:
On simple one-class classification methods. 2022-2026 - Jayakrishnan Unnikrishnan:
On optimal two sample homogeneity tests for finite alphabets. 2027-2031
L1-Regularized Least Squares and Frames
- Samet Oymak, M. Amin Khajehnejad, Babak Hassibi:
Recovery threshold for optimal weight ℓ1 minimization. 2032-2036 - Tiebin Mi, Shidong Li, Yulong Liu:
The ℓ1 analysis approach by sparse dual frames for sparse signal recovery represented by frames. 2037-2041 - Yulong Liu, Shidong Li, Tiebin Mi, Hong Lei, Weidong Yu:
Performance analysis of ℓ1-synthesis with coherent frames. 2042-2046 - Céline Aubel, Christoph Studer, Graeme Pope, Helmut Bölcskei:
Sparse signal separation in redundant dictionaries. 2047-2051
Network Coding for Wireless
- Samar Agnihotri, Sidharth Jaggi, Minghua Chen:
Analog network coding in general SNR regime. 2052-2056 - Xiaohang Song, Onurcan Iscan:
Network coding for the broadcast Rayleigh fading channel with feedback. 2057-2061 - Chih-Chun Wang, David J. Love:
Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback. 2062-2066 - Vijayvaradharaj T. Muralidharan, B. Sundar Rajan:
Wireless network coding for MIMO two-way relaying using Latin Rectangles. 2067-2071
Interference Alignment
- Or Ordentlich, Uri Erez, Bobak Nazer:
The approximate sum capacity of the symmetric Gaussian K-user interference channel. 2072-2076 - Urs Niesen, Mohammad Ali Maddah-Ali:
Interference alignment: From degrees-of-freedom to constant-gap capacity approximations. 2077-2081 - Hua Sun, Chunhua Geng, Tiangao Gou, Syed Ali Jafar:
Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibility. 2082-2086 - Anas Chaaban, Aydin Sezgin:
Signal space alignment for the Gaussian Y-channel. 2087-2091
Deterministic Channels
- Zhiyu Cheng, Natasha Devroye:
On the capacity of multi-user two-way linear deterministic channels. 2092-2096 - Suvarup Saha, Randall A. Berry:
Sum capacity of 3-user deterministic interference channels with connectivity constraints. 2097-2101 - Sy-Quoc Le, Ravi Tandon, Mehul Motani, H. Vincent Poor:
On the sum-capacity of the linear deterministic interference channel with partial feedback. 2102-2106 - Diana Maamari, Daniela Tuninetti, Natasha Devroye:
The sum-capacity of the linear deterministic three-user cognitive interference channel. 2107-2111
Classical and Adversarial Joint Source-Channel Coding
- Yuval Kochman, Arya Mazumdar, Yury Polyanskiy:
The adversarial joint source-channel problem. 2112-2116 - Da Wang, Amir Ingber, Yuval Kochman:
A strong converse for joint source-channel coding. 2117-2121 - Albert No, Kartik Venkat, Tsachy Weissman:
Joint source-channel coding of one random variable over the Poisson channel. 2122-2126 - Antonio Campello, Cristiano Torezzan, Sueli I. R. Costa:
Curves on torus layers and coding for continuous alphabet sources. 2127-2131
Polar Codes over Non-Binary Alphabets
- Ido Tal, Artyom Sharov, Alexander Vardy:
Constructing polar codes for non-binary alphabets and MACs. 2132-2136 - Eren Sasoglu:
Polar codes for discrete alphabets. 2137-2141 - Woomyoung Park, Alexander Barg:
Polar codes for q-ary channels, q=2r. 2142-2146 - Junya Honda, Hirosuke Yamamoto:
Polar coding without alphabet extension for asymmetric channels. 2147-2151
Cryptanalysis and Distributed Guessing
- Jingguo Bi, Mingjie Liu, Xiaoyun Wang:
Cryptanalysis of a homomorphic encryption scheme from ISIT 2008. 2152-2156 - Robby G. McKilliam, Alex J. Grant:
Finding short vectors in a lattice of Voronoi's first kind. 2157-2160 - Serdar Boztas:
Oblivious distributed guessing. 2161-2165
Fading Channels
- Jiang Xue, Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah, Caijun Zhong:
Error exponents for Rayleigh fading product MIMO channels. 2166-2170 - Dushyantha A. Basnayaka, Peter J. Smith, Philippa A. Martin:
Ergodic sum capacity of macrodiversity MIMO systems in flat Rayleigh fading. 2171-2175 - Miguel R. D. Rodrigues:
Characterization of the constrained capacity of multiple-antenna fading coherent channels driven by arbitrary inputs. 2176-2180 - Jakob Hoydis, Romain Couillet, Pablo Piantanida, Mérouane Debbah:
A random matrix approach to the finite blocklength regime of MIMO fading channels. 2181-2185 - Jae Won Yoo, Tie Liu, Shlomo Shamai (Shitz):
Worst-case expected-rate loss of slow-fading channels. 2186-2190
Hypothesis Testing
- Mohammad Naghshvar, Tara Javidi:
Extrinsic Jensen-Shannon divergence with application in active hypothesis testing. 2191-2195 - George K. Atia, Venugopal V. Veeravalli:
Controlled sensing for sequential multihypothesis testing. 2196-2200 - Nidhin K. Vaidhiyan, S. P. Arun, Rajesh Sundaresan:
Active sequential hypothesis testing with application to a visual search problem. 2201-2205 - Yury Polyanskiy:
Hypothesis testing via a comparator. 2206-2210
L1-Regularized Least Squares and Sparsity
- David L. Donoho, Galen Reeves:
The sensitivity of compressed sensing performance to relaxation of sparsity. 2211-2215 - Anastasios Kyrillidis, Volkan Cevher:
Combinatorial selection and least absolute shrinkage via the Clash algorithm. 2216-2220 - Masahiro Yukawa, Shun-ichi Amari:
ℓp-constrained least squares (0 < p < 1) and its critical path. 2221-2225 - Tien-Ju Yang, Yi-Min Tsai, Chung-Te Li, Liang-Gee Chen:
WarmL1: A warm-start homotopy-based reconstruction algorithm for sparse signals. 2226-2230
Index Coding
- Ishay Haviv, Michael Langberg:
On linear index coding for random graphs. 2231-2235 - Hamed Maleki, Viveck R. Cadambe, Syed Ali Jafar:
Index coding: An interference alignment perspective. 2236-2240 - Son Hoang Dau, Vitaly Skachek, Yeow Meng Chee:
Optimal index codes with near-extreme rates. 2241-2245 - Arash Saber Tehrani, Alexandros G. Dimakis, Michael J. Neely:
Bipartite index coding. 2246-2250 - Siddhartha Brahma, Christina Fragouli:
Pliable index coding. 2251-2255
Interference Channels
- Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
A new achievable rate region for the 3-user discrete memoryless interference channel. 2256-2260 - Lei Lin, Xiao Ma, Xiujie Huang, Baoming Bai:
An information-spectrum approach to the capacity region of general interference channel. 2261-2265 - Yuanpeng Liu, Elza Erkip:
On a class of discrete memoryless broadcast interference channels. 2266-2270 - Fangfang Zhu, Biao Chen:
On the sum capacity of the discrete memoryless interference channel with one-sided weak interference and mixed interference. 2271-2275 - Bernd Bandemer:
An achievable rate region for three-pair interference channels with noise. 2276-2280
MIMO Precoding
- Jianwen Zhang, Xiaojun Yuan, Li Ping:
Hermitian precoding for distributed MIMO systems. 2281-2285 - Mari Kobayashi, Giuseppe Caire:
On the net DoF comparison between ZF and MAT over time-varying MISO broadcast channels. 2286-2290 - Shuiyin Liu, Cong Ling, Xiaofu Wu:
Proximity factors of lattice reduction-aided precoding for multiantenna broadcast. 2291-2295 - Ahmed Hesham Mehana, Aria Nosratinia:
High-SNR analysis of MIMO linear precoders. 2296-2300 - Christos Masouros, Mathini Sellathurai, Tharmalingam Ratnarajah:
A transmit-power efficient MIMO-THP design. 2301-2305
Gaussian Wiretap Channels
- Cong Ling, Laura Luzzi, Jean-Claude Belfiore:
Lattice codes achieving strong secrecy over the mod-Λ Gaussian Channel. 2306-2310 - Ali Zibaeenejad:
Key agreement over Gaussian wiretap models with known interference at the transmitter. 2311-2315 - Xiang He, Aylin Yener:
The Gaussian interference wiretap channel when the eavesdropper channel is arbitrarily varying. 2316-2320 - S. Ali A. Fakoorian, A. Lee Swindlehurst:
Optimal power allocation for GSVD-based beamforming in the MIMO Gaussian wiretap channel. 2321-2325 - Thang Van Nguyen, Tony Q. S. Quek, Hyundong Shin:
Switched power allocation for MISOME wiretap channels. 2326-2330
Analysis of LDPC Codes
- Nicolas Macris, Marc Vuffray:
Beyond the Bethe free energy of LDPC codes via polymer expansions. 2331-2335 - Hosein Mamani, Hamid Saeedi, Ali Eslami, Hossein Pishro-Nik:
On Generalized EXIT charts of LDPC code ensembles over binary-input output-symmetric memoryless channels. 2336-2340 - Takayuki Nozaki, Kenta Kasai, Kohichi Sakaniwa:
Analysis of error floors of generalized non-binary LDPC codes over q-ary memoryless symmetric channels. 2341-2345 - Pablo M. Olmos, Fernando Pérez-Cruz, Luis Salamanca, Juan José Murillo-Fuentes:
Finite-length analysis of the TEP decoder for LDPC ensembles over the BEC. 2346-2350
Convolutional and Turbo Codes
- Vladimir Sidorenko, Martin Bossert, Francesca Vatta:
Properties and encoding aspects of direct product convolutional codes. 2351-2355 - Antonia Wachter-Zeh, Markus Stinner, Martin Bossert:
Efficient decoding of Partial Unit Memory codes of arbitrary rate. 2356-2360 - Yonghui Li, Md. Shahriar Rahman, Branka Vucetic:
SISO MAP decoding of rate-1 recursive convolutional codes: A revisit. 2361-2365 - John B. Anderson, Mehdi Zeinali:
Best rate 1/2 convolutional codes for turbo equalization with severe ISI. 2366-2370 - Jan Geldmacher, Klaus Hueske, Jürgen Götze, Martin Kosakowski:
Low complexity syndrome based decoding of Turbo codes. 2371-2375
Communication Systems
- Mihai-Alin Badiu, Gunvor Elisabeth Kirkelund, Carles Navarro i Manchon, Erwin Riegler, Bernard H. Fleury:
Message-passing algorithms for channel estimation and decoding using approximate inference. 2376-2380 - Fei Teng, Dongning Guo, Michael L. Honig:
Bidirectional channel estimation using adaptive pilots. 2381-2385 - Alexander Fish, Akbar M. Sayeed, Shamgar Gurevich, Ronny Hadani, Oded Schwartz:
Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov. 2386-2390 - Li Bing, Tor Aulin, Baoming Bai:
Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systems. 2391-2395 - Murthy V. Devarakonda, Hans-Andrea Loeliger:
Joint synchronization and demodulation by forward filtering. 2396-2400
Coded Modulation
- Alex Alvarado, Alexandre Graell i Amat, Fredrik Brännström, Erik Agrell:
On the equivalence of TCM encoders. 2401-2405 - Andreas Schenk, Robert F. H. Fischer, Johannes B. Huber:
Performance estimation of bit-interleaved coded modulation based on information processing characteristics. 2406-2410 - Lai Wei, Thomas E. Fuja:
Cooperative diversity via set-partitioning in BICM: Outage analysis and frame interleaving. 2411-2415 - Li Peng, Albert Guillen i Fabregas, Alfonso Martinez:
Mismatched shaping schemes for bit-interleaved coded modulation. 2416-2420 - Erik Agrell, Alex Alvarado:
Achieving the Shannon limit with probabilistically shaped BICM. 2421-2425
Fourier Subsampling
- Mojtaba Vaezi, Fabrice Labeau:
Systematic DFT frames: Principle and eigenvalues structure. 2426-2430 - Adel Javanmard, Andrea Montanari:
Subsampling at information theoretically optimal rates. 2431-2435 - Nam Yul Yu:
New construction of a near-optimal partial Fourier codebook using the structure of binary m-sequences. 2436-2440 - Gabriel H. Tucci, Philip A. Whiting:
Behavior of the minimum singular value of a random Vandermonde matrix. 2441-2445 - Eric Price, David P. Woodruff:
Applications of the Shannon-Hartley theorem to data streams and sparse recovery. 2446-2450
Network Erasure Correction
- Bin Tang, Shenghao Yang, Yitong Yin, Baoliu Ye, Sanglu Lu:
Expander graph based overlapped chunked codes. 2451-2455 - Sameh Sorour, Shahrokh Valaee:
On densifying coding opportunities in instantly decodable network coding graphs. 2456-2460 - Anoosheh Heidarzadeh, Amir H. Banihashemi:
How fast can dense codes achieve the min-cut capacity of line networks? 2461-2465 - Vahid Shah-Mansouri, Vincent W. S. Wong:
On decoding delay of intra-session random linear network coding for line networks. 2466-2470
Subspace Interference Alignment and Feasibility Conditions
- Chenwei Wang, Tiangao Gou, Syed Ali Jafar:
Subspace alignment chains and the degrees of freedom of the three-user MIMO interference channel. 2471-2475 - Chenwei Wang, Hua Sun, Syed Ali Jafar:
Genie chains and the degrees of freedom of the K-user MIMO interference channel. 2476-2480 - Oscar Gonzalez, Ignacio Santamaría, Carlos Beltrán:
A general test to check the feasibility of linear interference alignment. 2481-2485 - Liangzhong Ruan, Vincent K. N. Lau, Moe Z. Win:
The feasibility conditions of interference alignment for MIMO interference networks. 2486-2490
Multiple-Antenna Broadcast Channels
- Yang Li, Aria Nosratinia:
Grassmannian-Euclidean superposition for MIMO broadcast channels. 2491-2495 - Juyul Lee:
Throughput penalty of fair scheduling algorithms on multiple antenna broadcast channels. 2496-2500 - Mari Kobayashi, Sheng Yang, David Gesbert, Xinping Yi:
On the degrees of freedom of time correlated MISO broadcast channel with delayed CSIT. 2501-2505 - Hon Fah Chong, Ying-Chang Liang:
An extremal inequality and the capacity region of the degraded MIMO compound Gaussian broadcast channel with multiple users. 2506-2510
Game Theory
- Jiaming Xu, Bruce E. Hajek:
The supermarket game. 2511-2515 - Srinivas Yerramalli, Rahul Jain, Urbashi Mitra:
A game theoretic model for the Gaussian broadcast channel. 2516-2520 - Dileep M. Kalathil, Rahul Jain:
Incentives for cooperative relaying in a simple information-theoretic model. 2521-2525
New Constructions of LDPC Codes
- Dariush Divsalar, Lara Dolecek:
Graph cover ensembles of non-binary protograph LDPC codes. 2526-2530 - David Declercq, Valentin Savin, Lam Pham Sy:
Analysis and design of ultra-sparse non-binary cluster-LDPC codes. 2531-2535 - Kai Zhang, Xiao Ma, Shancheng Zhao, Baoming Bai, Xiaoyi Zhang:
A new ensemble of rate-compatible LDPC codes. 2536-2540 - Valentin Savin:
Fourier domain representation of non-binary LDPC codes. 2541-2545
Applications of Codes in Cryptography
- Hervé Chabanne, Gérard D. Cohen, Alain Patey:
Secure network coding and non-malleable codes: Protection against linear tampering. 2546-2550 - Zihui Liu, Xin-Wen Wu:
On a class of three-weight codes with cryptographic applications. 2551-2555 - Matthieu Finiasz, Kannan Ramchandran:
Private Stream Search at the same communication cost as a regular search: Role of LDPC codes. 2556-2560 - Michael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan:
Mutual information for a deletion channel. 2561-2565
Topics in Shannon Theory
- Ertem Tuncel:
Recognition capacity versus search speed in noisy databases. 2566-2570 - Yen-Wei Huang, Pierre Moulin:
On fingerprinting capacity games for arbitrary alphabets and their asymptotics. 2571-2575 - Yuval Lomnitz, Meir Feder:
Universal communication over unknown vector channels. 2576-2580 - Vinith Misra, Tsachy Weissman:
The porosity of additive noise sequences. 2581-2585
High-Dimensional Inference
- Dayu Huang, Sean P. Meyn:
Classification with high-dimensional sparse samples. 2586-2590 - Francesca Bassi, Alfred O. Hero III:
Large scale correlation detection. 2591-2595 - Gabriel H. Tucci, Ke Wang:
An innovative approach for analysing rank deficient covariance matrices. 2596-2600 - Po-Ling Loh, Martin J. Wainwright:
Corrupted and missing predictors: Minimax bounds for high-dimensional linear regression. 2601-2605
Data Exchange and Gathering
- Mira Gonen, Michael Langberg:
Coded cooperative data exchange problem for general topologies. 2606-2610 - Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Data exchange problem with helpers. 2611-2615 - Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard:
Network coded gossip with correlated data. 2616-2620 - Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Wireless networks with symmetric demands. 2621-2625
Opportunistic and Relay-Aided Interference Alignment
- Oliver Johnson, Matthew Aldridge, Robert J. Piechocki:
Delay-rate tradeoff in ergodic interference alignment. 2626-2630 - Nguyen Minh Tri, Tony Q. S. Quek, Hyundong Shin:
Opportunistic interference alignment in MIMO femtocell networks. 2631-2635 - Hyun Jong Yang, Won-Yong Shin, Bang Chul Jung, Arogyaswami Paulraj:
Opportunistic interference alignment for MIMO IMAC: Effect of user scaling over degrees-of-freedom. 2636-2640 - Xuesong Wang, Yongping Zhang, Philipp Zhang, Xiaotao Ren:
Relay-aided interference alignment for MIMO cellular networks. 2641-2645
Topics in MIMO
- Lakshmi Prasad Natarajan, B. Sundar Rajan:
Generalized Distributive Law for ML decoding of STBCs: Further results. 2646-2650 - Ronen Dar, Meir Feder, Mark Shtaif:
The Jacobi MIMO channel. 2651-2655 - Ralf R. Müller, Burak Çakmak:
Channel modelling of MU-MIMO systems by quaternionic free probability. 2656-2660 - Ayal Hitron, Anatoly Khina, Uri Erez:
Transmission over arbitrarily permuted parallel Gaussian channels. 2661-2665
Delay and Distributed Scheduling
- Roy D. Yates, Sanjit Krishnan Kaul:
Real-time status updating: Multiple sources. 2666-2670 - Vangelis Angelakis, Anthony Ephremides, Qing He, Di Yuan:
On emptying a wireless network in minimum time. 2671-2675 - Ka-Kit Lam, Chi-Kin Chau, Minghua Chen, Soung Chang Liew:
Mixing time and temporal starvation of general CSMA networks with multiple frequency agility. 2676-2680 - Chul-Ho Lee, Do Young Eun, Se-Young Yun, Yung Yi:
From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA. 2681-2685
Decoding Algorithms for Codes on Graphs
- Nissim Halabi, Guy Even:
Linear-programming decoding of Tanner codes with local-optimality certificates. 2686-2690 - Nissim Halabi, Guy Even:
Hierarchies of local-optimality characterizations in decoding Tanner codes. 2691-2695 - Yung-Yih Jian, Henry D. Pfister, Krishna R. Narayanan:
Approaching capacity at high rates with iterative hard-decision decoding. 2696-2700 - Phong S. Nguyen, Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan:
On the maximum a posteriori decoding thresholds of multiuser systems with erasures. 2701-2705
Fundamental Limits on Complexity
- Ulrich Speidel, T. Aaron Gulliver:
An analytic upper bound on T-complexity. 2706-2710 - Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
On the query computation and verification of functions. 2711-2715 - Pulkit Grover, Andrea Goldsmith, Anant Sahai:
Fundamental limits on the power consumption of encoding and decoding. 2716-2720
Tree Learning
- Yashodhan Kanoria, Omer Tamuz:
Tractable Bayesian social learning on trees. 2721-2725 - Jalal Etesami, Negar Kiyavash, Todd P. Coleman:
Learning minimal latent directed information trees. 2726-2730 - Abhik Kumar Das, Praneeth Netrapalli, Sujay Sanghavi, Sriram Vishwanath:
Learning Markov graphs up to edit distance. 2731-2735 - Jing Yang, Stark C. Draper, Robert D. Nowak:
Passive learning of the interference graph of a wireless network. 2735-2740
Strings, Sorting, and Biology
- Abolfazl S. Motahari, Guy Bresler, David Tse:
Information theory for DNA sequencing: Part I: A basic model. 2741-2745 - Ludwig M. Busse, Morteza Haghir Chehreghani, Joachim M. Buhmann:
The information content in sorting algorithms. 2746-2750 - Aryeh Kontorovich, Ari Trachtenberg:
String reconciliation with unknown edit distance. 2751-2755 - David T. Lee, Jehoshua Bruck:
Modeling biological circuits with urn functions. 2756-2760
Coded Storage and Caching
- Vasileios Ntranos, Giuseppe Caire, Alexandros G. Dimakis:
Allocations for heterogenous distributed storage. 2761-2765 - Longbo Huang, Sameer Pawar, Hao Zhang, Kannan Ramchandran:
Codes can reduce queueing delay in data centers. 2766-2770 - Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Locally repairable codes. 2771-2775 - N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal linear codes with a local-error-correction property. 2776-2780 - Negin Golrezaei, Alexandros G. Dimakis, Andreas F. Molisch:
Wireless device-to-device communications with distributed caching. 2781-2785
Gaussian Interference Channels
- Xiaohu Shang, H. Vincent Poor:
Capacity for MIMO Gaussian interference channels with generally strong and noisy interference. 2786-2790 - Yu Zhao, Fangfang Zhu, Biao Chen:
The Han-Kobayashi region for a class of Gaussian interference channels with mixed interference. 2791-2795 - Jung Hyun Bae, Jungwon Lee, Inyup Kang:
Simple transmission strategies for interference channel. 2796-2800 - Changho Suh, I-Hsiang Wang, David Tse:
Two-way interference channels. 2801-2805 - Junyoung Nam, Giuseppe Caire:
A new outer bound on the capacity region of Gaussian interference channels. 2806-2810
MIMO Coding
- Lakshmi Prasad Natarajan, K. Pavan Srinath, B. Sundar Rajan:
On the sphere decoding complexity of high rate multigroup ML decodable STBCs. 2811-2815 - Arun Kumar Singh, Petros Elia:
Feedback-aided complexity reductions in ML and lattice decoding. 2816-2820 - Dieter Duyck, Marc Moeneclaey, Sheng Yang, Fambirai Takawira, Joseph Jean Boutros:
Time-varying space-only codes. 2821-2825 - Nadya Markin, Frédérique E. Oggier:
A class of iterated fast decodable space-time codes for 2n Tx antennas. 2826-2830 - Idan Livni, Anatoly Khina, Ayal Hitron, Uri Erez:
Space-time MIMO multicasting. 2831-2835
Delay and Deadline Constrained Communication
- Sina Lashgari, Amir Salman Avestimehr:
Approximating the timely throughput of heterogeneous wireless networks. 2836-2840 - Karthikeyan Shanmugam, Giuseppe Caire:
Wireless downloading delay under proportional fair scheduling with coupled service and requests: An approximated analysis. 2841-2845 - Ying Cui, Vincent K. N. Lau, Edmund M. Yeh:
Delay-optimal buffered decode-and-forward for two-hop networks with random link connectivity. 2846-2850 - Khoa D. Nguyen:
Delay-exponent of delay-universal compress-and-forward relaying. 2851-2855 - Gauri Joshi, Yuval Kochman, Gregory W. Wornell:
On playback delay in streaming communication. 2856-2860
Decoding Techniques for LDPC Codes
- En-Hui Yang, Jin Meng:
Jar decoding: LDPC coding theorems for binary input memoryless channels. 2861-2865 - A. Dinesh Kumar, Ambedkar Dukkipati:
A two stage selective averaging LDPC decoding. 2866-2870 - Xiaojie Zhang, Paul H. Siegel:
Quantized min-sum decoders with low error floor for LDPC codes. 2871-2875 - Shiva Kumar Planjery, Bane Vasic, David Declercq:
Enhancing the error correction of finite alphabet iterative decoders via adaptive decimation. 2876-2880 - Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin:
Selecting two-bit bit flipping algorithms for collective error correction. 2881-2885
Cyclic Codes and Symbol-Pair Codes
- Yeow Meng Chee, Han Mao Kiah, Chengmin Wang:
Maximum distance separable symbol-pair codes. 2886-2890 - Eitan Yaakobi, Jehoshua Bruck, Paul H. Siegel:
Decoding of cyclic codes over symbol-pair read channels. 2891-2895 - Alexander Zeh, Sergey Bezzateev:
Describing a cyclic code by another cyclic code. 2896-2900 - Sung-Tai Choi, Ji-Youp Kim, Jong-Seon No, Habong Chung:
Weight distribution of some cyclic codes. 2901-2903 - Kenza Guenda, T. Aaron Gulliver:
Self-dual repeated root cyclic and negacyclic codes over finite fields. 2904-2908
Feedback
- Changho Suh, Naveen Goela, Michael Gastpar:
Approximate feedback capacity of the Gaussian multicast channel. 2909-2913 - Achilleas Anastasopoulos:
A sequential transmission scheme for unifilar finite-state channels with feedback based on posterior matching. 2914-2918 - Tharaka Samarasinghe, Hazer Inaltekin, Jamie S. Evans:
Optimal selective feedback policies for opportunistic beamforming under peak feedback constraints. 2919-2923 - Adam R. Williamson, Tsung-Yi Chen, Richard D. Wesel:
A rate-compatible sphere-packing analysis of feedback coding with limited retransmissions. 2924-2928 - Wei Liu, Mathini Sellathurai, Jing Lei, Jibo Wei, Chaojing Tang:
Completely decoupled space-time block codes with low-rate feedback. 2929-2933
Error Exponents
- Da Wang, Venkat Chandar, Sae-Young Chung, Gregory W. Wornell:
On reliability functions for single-message unequal error protection. 2934-2938 - Erez Sabbag, Neri Merhav:
Error exponents of optimum erasure/list and ordinary decoding for channels with side information. 2939-2943 - Mine Alsan:
Extremality properties for Gallager's random coding exponent. 2944-2948 - Yücel Altug, Aaron B. Wagner:
Refinement of the sphere-packing bound. 2949-2953 - Marat V. Burnashev, Hirosuke Yamamoto:
On decoding error exponent of Gaussian channel with noisy feedback: Nonexponential number of messages. 2954-2958
Information Theory in Biology
- Arash Einolghozati, Mohsen Sardari, Faramarz Fekri:
Collective sensing-capacity of bacteria populations. 2959-2963 - Jie Xing, Toby Berger, Terrence J. Sejnowski:
A Berger-Levy energy efficient neuron model with unequal synaptic weights. 2964-2968 - William B. Levy, Toby Berger:
Design principles and specifications for neural-like computation under constraints on information preservation and energy costs as analyzed with statistical theory. 2969-2972 - Andrew W. Eckford, K. V. Srinivas, Raviraj S. Adve:
The peak constrained additive inverse Gaussian noise channel. 2973-2977
Rank-Modulation Coding
- Hongchao Zhou, Anxiao Jiang, Jehoshua Bruck:
Systematic error-correcting codes for rank modulation. 2978-2982 - Yonatan Yehezkeally, Moshe Schwartz:
Snake-in-the-box codes for rank modulation. 2983-2987 - Farzad Farnoud, Vitaly Skachek, Olgica Milenkovic:
Rank modulation for translocation error correction. 2988-2992 - Manabu Hagiwara:
On ML-certificate linear constraints for rank modulation with linear programming decoding and its application to compact graphs. 2993-2997 - Fabian Lim, Manabu Hagiwara:
Linear programming upper bounds on permutation code sizes from coherent configurations related to the Kendall-tau distance metric. 2998-3002
Communication and Computation over Multiple Access Channels
- Paolo Minero, Safitha Jayaraj:
Lossy communication over multiple-access channels with feedback. 3003-3007 - Or Ordentlich, Uri Erez, Bobak Nazer:
The compute-and-forward transform. 3008-3012 - Ashish Khisti, Brett Hern, Krishna R. Narayanan:
On modulo-sum computation over an erasure multiple access channel. 3013-3017 - Lóránt Farkas, Tamás Kói:
Capacity regions of partly asynchronous multiple access channels. 3018-3022
MIMO Equalization, Diversity and Optimization
- Ahmed Hesham Mehana, Aria Nosratinia:
Performance of MIMO single-carrier frequency domain zero-forcing equalizer. 3023-3027 - Panayotis Mertikopoulos, Elena Veronica Belmega, Aris L. Moustakas:
Matrix exponential learning: Distributed optimization in MIMO systems. 3028-3032 - Siddhartan Govindasamy:
Asymptotic data rates of receive-diversity systems with MMSE estimation and interferers at correlated locations. 3033-3037 - Roope Vehkalahti, Laura Luzzi:
Connecting DMT of division algebra space-time codes and point counting in Lie groups. 3038-3042 - K. Pavan Srinath, B. Sundar Rajan:
DMT-optimal, low ML-complexity STBC-schemes for asymmetric MIMO systems. 3043-3047
Comunication Models
- Farzin Haddadpour, Mohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref:
Coordination via a relay. 3048-3052 - Mohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref:
Channel simulation via interactive communications. 3053-3057 - Chiranjib Choudhuri, Urbashi Mitra:
Action dependent strictly causal state communication. 3058-3062 - Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund:
Multi-stage coding for channels with a rewrite option and reversible input. 3063-3067 - Chao Tian:
Amplification of the hidden Gaussian channel states. 3068-3072
Cyclic and Quasicyclic LDPC Codes
- Qin Huang, Keke Liu, Zulin Wang:
Low-density arrays of circulant matrices: Rank and row-redundancy, and QC-LDPC codes. 3073-3077 - Mehdi Karimi, Amir H. Banihashemi:
On the girth of quasi cyclic protograph LDPC codes. 3078-3082 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
A greedy search for improved QC LDPC codes with good girth profile and degree distribution. 3083-3087 - Qiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping set structure of finite geometry LDPC codes. 3088-3092 - Hosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin:
A new parity structure with multi-weight circulants for QC LDPC codes. 3093-3097
Codes over Rings
- Li-Ping Wang:
Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matrices. 3098-3100 - Muhammad Bilal, Joaquim Borges, Steven T. Dougherty, Cristina Fernández-Córdoba:
Extensions of Z2Z4-additive self-dual codes preserving their properties. 3101-3105 - Kenza Guenda, T. Aaron Gulliver, S. Arash Sheikholeslam:
Greedy codes over Z4. 3106-3109 - J. Harshan, Emanuele Viterbo, Jean-Claude Belfiore:
Construction of Barnes-Wall lattices from linear codes over rings. 3110-3114 - Marcus Greferath, Jens Zumbrägel:
On the algebraic representation of selected optimal non-linear binary codes. 3115-3119
Interference Channels with Feedback
- Mohammad Javad Abdoli, Akbar Ghasemi, Amir K. Khandani:
Full-duplex transmitter cooperation, feedback, and the degrees of freedom of SISO Gaussian interference and X channels. 3120-3124 - Soheil Mohajer, Ravi Tandon, H. Vincent Poor:
Generalized degrees of freedom of the symmetric K-user interference channel with feedback. 3125-3129 - Dimitris S. Papailiopoulos, Changho Suh, Alexandros G. Dimakis:
Feedback in the K-user interference channel. 3130-3134 - Sanjay Karmakar, Mahesh K. Varanasi:
The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedback. 3135-3139 - Mohamed S. Nafea, Doha Hamza, Karim G. Seddik, Mohammed Nafie, Hesham El Gamal:
On the ARQ protocols over the Z-interference channels: Diversity-multiplexing-delay tradeoff. 3140-3144
a service of 
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-04-17 21:37 CEST 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:
