Abstract is missing.
- Lattice codes for the compute-and-forward protocol: The flatness factorJean-Claude Belfiore. 1-4 [doi]
- Flip-OFDM for optical wireless communicationsNirmal Fernando, Yi Hong, Emanuele Viterbo. 5-9 [doi]
- Generalized distributive law for ML decoding of STBCsLakshmi Prasad Natarajan, K. Pavan Srinath, B. Sundar Rajan. 10-14 [doi]
- Approaching the capacity of sampled analog channelsYuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith. 15-19 [doi]
- Symmetric group testing and superimposed codesAmin Emad, Jun Shen, Olgica Milenkovic. 20-24 [doi]
- An algorithmic approach for finding deletion correcting codesFarzaneh Khajouei, Mahdy Zolghadr, Negar Kiyavash. 25-29 [doi]
- Self-Repairing Codes for distributed storage - A projective geometric constructionFrédérique E. Oggier, Anwitaman Datta. 30-34 [doi]
- The expected write deficiency of index-less flash codes and their improvementYuichi Kaji. 35-39 [doi]
- Non-binary WOM-codes for multilevel flash memoriesRyan Gabrys, Eitan Yaakobi, Lara Dolecek, Paul H. Siegel, Alexander Vardy, Jack K. Wolf. 40-44 [doi]
- Quasicyclic MDS codes for distributed storage with efficient exact repairAndrew Thangaraj, Chinnadhurai Sankar. 45-49 [doi]
- Embedding information flows into renewal trafficStefano Maranò, Vincenzo Matta, Ting He, Lang Tong. 50-54 [doi]
- Non-malleable codes from the wire-tap channelHervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey. 55-59 [doi]
- Capacity results for compound wiretap channelsIgor Bjelakovic, Holger Boche, Jochen Sommerfeld. 60-64 [doi]
- Secret message capacity of erasure broadcast channels with feedbackLászló Czap, Vinod M. Prabhakaran, Christina Fragouli, Suhas N. Diggavi. 65-69 [doi]
- Secrecy gain of trellis codes: The other side of the union boundYanfei Yan, Cong Ling, Jean-Claude Belfiore. 70-74 [doi]
- On multiple hypothesis testing with rejection optionNaira Grigoryan, Ashot N. Harutyunyan, Sviatoslav Voloshynovskiy, Oleksiy J. Koval. 75-79 [doi]
- Exponential pattern retrieval capacity with non-binary associative memoryK. Raj Kumar, Amir Hesam Salavati, Amin Shokrollahi. 80-84 [doi]
- Capacity of diffusion-based molecular communication with ligand receptorsArash Einolghozati, Mohsen Sardari, Faramarz Fekri. 85-89 [doi]
- Mutation and optimal search of sequences in nested Hamming spacesRoman V. Belavkin. 90-94 [doi]
- Voice pathology detection with predictable component analysis and wavelet decomposition modelPaulo Rogério Scalassara, Luciane Agnoletti dos Santos, Carlos Dias Maciel. 95-99 [doi]
- A strictly improved achievable region for multiple descriptions using combinatorial message sharingKumar Viswanatha, Emrah Akyol, Kenneth Rose. 100-104 [doi]
- An optimal transmit-receive rate tradeoff in Gray-Wyner network and its relation to common informationKumar Viswanatha, Emrah Akyol, Kenneth Rose. 105-109 [doi]
- A lattice compress-and-forward schemeYiwei Song, Natasha Devroye. 110-114 [doi]
- Decode-forward and compute-forward coding schemes for the two-way relay channelPeng Zhong, Mai H. Vu. 115-119 [doi]
- An achievable region for the double unicast problem based on a minimum cut analysisShurui Huang, Aditya Ramamoorthy. 120-124 [doi]
- Optimal rate for irregular LDPC codes in binary erasure channelH. Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami. 125-129 [doi]
- Reducing complexity with less than minimum delay space-time lattice codesRoope Vehkalahti, Camilla Hollanti. 130-134 [doi]
- Diversity-multiplexing gain tradeoff: A tool in algebra?Roope Vehkalahti, Hsiao-feng Francis Lu. 135-139 [doi]
- Graph-based codes for Quantize-Map-and-Forward relayingAyan Sengupta, Siddhartha Brahma, Ayfer Özgür, Christina Fragouli, Suhas N. Diggavi. 140-144 [doi]
- MAP decoding for LDPC codes over the binary erasure channelLuis Salamanca, Pablo M. Olmos, Juan José Murillo-Fuentes, Fernando Pérez-Cruz. 145-149 [doi]
- On bent functions associated to AB functionsLilya Budaghyan, Claude Carlet, Tor Helleseth. 150-154 [doi]
- Quasi-orthogonal supersetsBranislav M. Popovic. 155-159 [doi]
- Spectral shaping codes with even length permutation sequencesKhmaies Ouahada, Hendrik C. Ferreira. 160-164 [doi]
- Ambiguity and deficiency of permutations from finite fieldsDaniel Panario, Amin Sakzad, Brett Stevens, Qiang Wang. 165-169 [doi]
- Three-dimensional periodic optical orthogonal code for OCDMA systemsJosé R. Ortiz-Ubarri, Oscar Moreno, Andrew Z. Tirkel. 170-174 [doi]
- Ultra-small block-codes for binary discrete memoryless channelsPo-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser. 175-179 [doi]
- State-dependent channels with composite state information at the encoderAnatoly Khina, Mustafa Kesal, Uri Erez. 180-184 [doi]
- On the capacity of noisy computationsFrançois Simon. 185-189 [doi]
- Continuous-time directed information and its role in communicationHaim H. Permuter, Young Han Kim, Tsachy Weissman. 190-194 [doi]
- Capacity bounds for multiuser channels with non-causal channel state information at the transmittersReza Khosravi-Farsani, Farokh Marvasti. 195-199 [doi]
- Finite block-length achievable rates for queuing timing channelsThomas J. Riedl, Todd P. Coleman, Andrew C. Singer. 200-204 [doi]
- Information-theoretic analysis of content based identification for correlated dataFarzad Farhadzadeh, Sviatoslav Voloshynovskiy, Oleksiy J. Koval, Fokko Beekhof. 205-209 [doi]
- On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codesAnne-Maria Ernvall-Hytönen, Camilla Hollanti. 210-214 [doi]
- A lattice-based batch identification schemeRosemberg Silva, Pierre-Louis Cayrel, Richard Lindner. 215-219 [doi]
- Decoding q-ary lattices in the Lee metricAntonio C. de A. Campello, Grasiele C. Jorge, Sueli I. R. Costa. 220-224 [doi]
- Minimal codes in binary abelian group algebrasMarinês Guerreiro, Raul Antonio Ferraz, César Polcino Milies. 225-228 [doi]
- List-decoding of binary Goppa codes up to the binary Johnson boundDaniel Augot, Morgan Barbier, Alain Couvreur. 229-233 [doi]
- Asymmetric quantum generalized Reed-Solomon codesGiuliano G. La Guardia. 234-236 [doi]
- Robustness of statistical mechanical interpretation of algorithmic information theoryKohtaro Tadaki. 237-241 [doi]
- Helstrom's theory on quantum binary decision revisitedGianfranco Cariolaro, Alberto Vigato. 242-246 [doi]
- Quantum search algorithms on hierarchical networksFranklin de Lima Marquezino, Renato Portugal, Stefan Boettcher. 247-251 [doi]
- Quantum turbo codes with unbounded minimum distance and excellent error-reducing performanceMamdouh Abbara, Jean-Pierre Tillich. 252-256 [doi]
- Iterative soft decoding of binary linear codes using a generalized Tanner graphEirik Rosnes. 257-261 [doi]
- On-line fountain codes for semi-random loss channelsYuval Cassuto, Amin Shokrollahi. 262-266 [doi]
- Multi-edge framework for unequal error protecting LT codesH. V. Beltrao Neto, W. Henkel, V. C. da Rocha. 267-271 [doi]
- Annotated raptor codesKaveh Mahdaviani, Masoud Ardakani, Chintha Tellambura. 272-276 [doi]
- Universal rateless codes from coupled LT codesVahid Aref, Rüdiger L. Urbanke. 277-281 [doi]
- A distinguisher for high rate McEliece cryptosystemsJean-Charles Faugère, Valérie Gauthier-Umaña, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich. 282-286 [doi]
- Information-theoretically secure key-insulated key-agreementTakenobu Seito, Junji Shikata. 287-291 [doi]
- LWE-based identification schemesRosemberg Silva, Antonio C. de A. Campello, Ricardo Dahab. 292-296 [doi]
- Identification in desynchronization channelsOleksiy J. Koval, Svyatoslav Voloshynovskiy, Farzad Farhadzadeh. 297-301 [doi]
- A tree construction method of nested cyclic codesFelipe Cinelli Barbosa, Max H. M. Costa. 302-305 [doi]
- A half-duplex relay coding scheme optimized for energy efficiencyFanny Parzysz, Mai H. Vu, François Gagnon. 306-310 [doi]
- Amplify-and-forward in wireless relay networksSamar Agnihotri, Sidharth Jaggi, Minghua Chen. 311-315 [doi]
- An information theoretic approach for determining the minimum number of sensors in a wireless sensor networkBryan Larish, George F. Riley. 316-320 [doi]
- Binary arithmetic coding for time-varying sources based on the Maskit boundaryLucila Helena Allan Leskow, Reginaldo Palazzo. 321-324 [doi]
- Optimal HDA codes for sending a Gaussian source over a Gaussian channel with bandwidth compression in the presence of an interferenceMorteza Varasteh, Hamid Behroozi. 325-329 [doi]
- Operating LDPC codes with zero shaping gapGeorg Böcherer, Rudolf Mathar. 330-334 [doi]
- Multi-edge type unequal error protecting low-density parity-check codesH. V. Beltrao Neto, W. Henkel, V. C. da Rocha. 335-339 [doi]
- Ensemble analysis of pseudocodewords of protograph-based non-binary LDPC codesDariush Divsalar, Lara Dolecek. 340-344 [doi]
- On the selection of finite alphabet iterative decoders for LDPC codes on the BSCLudovic Danjean, David Declercq, Shiva Kumar Planjery, Bane V. Vasic. 345-349 [doi]
- Quasi-cyclic LDPC codes based on pre-lifted protographsDavid G. M. Mitchell, Roxana Smarandache, Daniel J. Costello Jr.. 350-354 [doi]
- Precoding for coded communication on block fading channels and cooperative communicationsDieter Duyck, Joseph Jean Boutros, Marc Moeneclaey. 355-359 [doi]
- High SNR bounds for the BICM capacityAlex Alvarado, Fredrik Brannstrom, Erik Agrell. 360-364 [doi]
- Communications overhead as the cost of constraintsJ. Nicholas Laneman, Brian P. Dunn. 365-369 [doi]
- Equivalent models for multi-terminal channelsFlávio du Pin Calmon, Muriel Médard, Michelle Effros. 370-374 [doi]
- A maximum entropy theorem for complex-valued random vectors, with implications on capacityGeorg Tauböck. 375-379 [doi]
- Subspace based multi-dimensional model order selection in colored noise scenariosJoão Paulo Carvalho Lustosa Da Costa, Florian Roemer, Dominik Schulz, Rafael Timóteo de Sousa Júnior. 380-384 [doi]
- Sign-magnitude decomposition of mutual information with polarization effect in digital identificationSvyatoslav Voloshynovskiy, Taras Holotyak, Oleksiy J. Koval, Fokko Beekhof, Farzad Farhadzadeh. 385-389 [doi]
- Widely linear SIMO filtering for hypercomplex numbersDominik Schulz, Jochen Seitz, João Paulo Carvalho Lustosa Da Costa. 390-395 [doi]
- Towards an optimal beamforming algorithm for physical layer multicastingMohammad Ali Khojastepour, Alireza Salehi-Golsefidi, Sampath Rangarajan. 395-399 [doi]
- Incremental coding over MIMO channelsAnatoly Khina, Yuval Kochman, Uri Erez, Gregory W. Wornell. 400-404 [doi]
- Algebraic solvers for certain lattice-related problemsJintai Ding. 405-409 [doi]
- Search to decision reduction for the learning with errors over rings problemVadim Lyubashevsky. 410-414 [doi]
- The tightness of security reductions in code-based cryptographyNicolas Sendrier. 415-419 [doi]
- Quantized compute and forward: A low-complexity architecture for distributed antenna systemsSong-Nam Hong, Giuseppe Caire. 420-424 [doi]
- A converse for the wideband relay channel with physically degraded broadcastNadia Fawaz, Muriel Médard. 425-429 [doi]
- On message lengths for noisy network codingGerhard Kramer, Jie Hou. 430-431 [doi]
- Capacity bounds for the Z channelHieu T. Do, Tobias J. Oechtering, Mikael Skoglund. 432-436 [doi]
- Communicating degraded message sets over multi-access channels with degraded encoder state informationBadri N. Vellambi, Ingmar Land. 437-441 [doi]
- Interference alignment at finite SNR for time-invariant channelsOr Ordentlich, Uri Erez. 442-446 [doi]
- Feasibility of interference alignment for the MIMO interference channel: The symmetric square caseGuy Bresler, Dustin Cartwright, David N. C. Tse. 447-451 [doi]
- On the capacity of multiplicative multiple access channels with AWGNSibi Raj B. Pillai. 452-456 [doi]
- Fixed-length lossy compression in the finite blocklength regime: Gaussian sourceVictoria Kostina, Sergio Verdú. 457-461 [doi]
- Lossy source coding with Byzantine adversariesEbad Ahmed, Aaron B. Wagner. 462-466 [doi]
- Coordination using implicit communicationPaul W. Cuff, Lei Zhao. 467-471 [doi]
- Achievability of maximum decoding rate on sequential codingMikihiko Nishiara. 472-475 [doi]
- On the network-wide gain of memory-assisted source codingMohsen Sardari, Ahmad Beirami, Faramarz Fekri. 476-480 [doi]
- Kite codes over groupsXiao Ma, Shancheng Zhao, Kai Zhang, Baoming Bai. 481-485 [doi]
- A standard form for generator matrices with respect to the Niederreiter-Rosenbloom-Tsfasman metricMarcelo Muniz Silva Alves. 486-489 [doi]
- MacWilliams-type identity in poset-block spacesJerry Anderson Pinheiro, Marcelo Firer. 490-494 [doi]
- Zero-error codes for the noisy-typewriter channelFrancisco J. R. Ruiz, Fernando Pérez-Cruz. 495-497 [doi]
- Binary error correcting network codesQiwen Wang, Sidharth Jaggi, Shuo-Yen Robert Li. 498-502 [doi]
- XOR's, lower bounds and MDS codes for storageJames S. Plank. 503-507 [doi]
- A Knuth-based RDS-minimizing multi-mode codeCarl H. Heymann, Hendrik C. Ferreira, Jos H. Weber. 508-512 [doi]
- Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQZhongwei Si, Mattias Andersson, Ragnar Thobaben, Mikael Skoglund. 513-517 [doi]
- Gigabit rate low-power LDPC decoderEran Pisek, Dinesh Rajan, Joseph Cleveland. 518-522 [doi]
- On network coding for acyclic networks with delaysKrishnan Prasad, B. Sundar Rajan. 523-527 [doi]
- On the optimal block length for joint channel and network codingChristian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.. 528-532 [doi]
- Optimality of network coding with buffersBernhard Haeupler, Minji Kim, Muriel Médard. 533-537 [doi]
- Exact modeling of the performance of random linear network coding in finite-buffer networksNima Torabkhani, Badri N. Vellambi, Ahmad Beirami, Faramarz Fekri. 538-542 [doi]
- Full-diversity network coding for two-user cooperative communicationsJoão Luiz Rebelatto, Bartolomeu F. Uchôa Filho, Danilo Silva. 543-547 [doi]
- A compressed sensing wire-tap channelGalen Reeves, Naveen Goela, Nebojsa Milosavljevic, Michael Gastpar. 548-552 [doi]
- Analysis of MMSE estimation for compressive sensing of block sparse signalsMikko Vehkaperä, Saikat Chatterjee, Mikael Skoglund. 553-557 [doi]
- Covering radius and the Restricted Isometry PropertyA. Robert Calderbank, Sina Jafarpour, Maria Nastasescu. 558-562 [doi]
- Secrecy using compressive sensingShweta Agrawal, Sriram Vishwanath. 563-567 [doi]
- Critical compression ratio of iterative reweighted l1 minimization for compressed sensingRyosuke Matsushita, Toshiyuki Tanaka. 568-572 [doi]
- A generalized network alignment for three-source three-destination multiple unicast networks with delaysAbhinav Ganesan, Teja Damodaram Bavirisetti, Krishnan Prasad, B. Sundar Rajan. 573-577 [doi]
- Relay-assisted multiple access with multi-packet reception capability and simultaneous transmission and receptionNikolaos Pappas, Anthony Ephremides, Apostolos Traganitis. 578-582 [doi]
- Error propagation and the achievable throughput-delay trade-off in wireless networksRamanan Subramanian, Ingmar Land, Badri N. Vellambi, Lars K. Rasmussen. 583-587 [doi]
- On the sum capacity of multiaccess block-fading channels with individual side informationYash Deshpande, Sibi Raj B. Pillai, Bikash Kumar Dey. 588-592 [doi]
- Unchaining from the channel: Cooperative computation over multiple-access channelsMatthew S. Nokleby, Behnaam Aazhang. 593-597 [doi]
- Optimal utilization of a cognitive shared channel with a rechargeable primary source nodeNikolaos Pappas, Jeongho Jeon, Anthony Ephremides, Apostolos Traganitis. 598-602 [doi]
- Threshold effects in parameter estimation as phase transitions in statistical physicsNeri Merhav. 603-607 [doi]
- Sufficient conditions for the convergence of the Shannon differential entropyJorge F. Silva, Patricio Parada. 608-612 [doi]
- Necessary and sufficient conditions for zero-rate density estimationJorge F. Silva, Milan S. Derpich. 613-617 [doi]
- An immune-inspired information-theoretic approach to the problem of ICA over a Galois fieldDaniel G. Silva, Romis de Faissol Attux, Everton Z. Nadalin, Leonardo Tomazeli Duarte, Ricardo Suyama. 618-622 [doi]
- On the generalization of decode-and-forward and compress-and-forward for Gaussian relay channelsKevin Luo, Ramy H. Gohary, Halim Yanikomeroglu. 623-627 [doi]
- Multiple access channel with correlated channel states and cooperating encodersMahdi Zamanighomi, Mohammad Javad Emadi, Farhad Shirani Chaharsooghi, Mohammad Reza Aref. 628-632 [doi]
- 2-Dimensional interval algorithmTerence H. Chan, Siu-Wai Ho. 633-637 [doi]
- Efficient fully simulatable oblivious transfer from the McEliece assumptionsBernardo Machado David, Anderson C. A. Nascimento. 638-642 [doi]
- Enumerative encoding of correlation immune Boolean functionsNicolás Carrasco, Jean-Marie Le Bars, Alfredo Viola. 643-647 [doi]
- A new zero-knowledge code based identification scheme with reduced communicationCarlos Aguilar Melchor, Philippe Gaborit, Julien Schrek. 648-652 [doi]
- On the separation of encryption and compression in secure distributed source codingSiu-Wai Ho, Lifeng Lai, Alex J. Grant. 653-657 [doi]
- Key agreement in state-dependent channels with non-causal side informationAli Zibaeenejad. 658-662 [doi]
- Existence and uniqueness of GEXIT curves via the Wasserstein metricShrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke. 663-667 [doi]
- Coupled LDPC codes: Complexity aspects of threshold saturationMichael Lentmaier, Gerhard P. Fettweis. 668-672 [doi]
- Percolation in the secrecy graph: Bounds on the critical probability and impact of power constraintsAmites Sarkar, Martin Haenggi. 673-677 [doi]
- Hybrid digital/analog schemes for secure transmission with side informationJoffrey Villard, Pablo Piantanida, Shlomo Shamai. 678-682 [doi]
- A note on non-binary multiple insertion/deletion correcting codesFilip Paluncic, Theo G. Swart, Jos H. Weber, Hendrik C. Ferreira, Willem A. Clarke. 683-687 [doi]
- Extended bit-flipping algorithm for solving sparse linear systems of equations modulo pAsie Abolpour, Mohammad-Reza Sadeghi, Daniel Panario. 688-692 [doi]
- New cyclically permutable codesV. C. da Rocha, J. S. Lemos-Neto. 693-697 [doi]
- Generating dependent random variables over networksAmin Aminzadeh Gohari, Venkat Anantharam. 698-702 [doi]
- Towards the capacity region of multiplicative linear operator broadcast channelsYimin Pang, Thomas Honold. 703-707 [doi]
- Completion time in multi-access channel: An information theoretic perspectiveYuanpeng Liu, Elza Erkip. 708-712 [doi]
- Bidirectional broadcast channels with common and confidential messagesRafael F. Wyrembelski, Holger Boche. 713-717 [doi]
- Secrecy gain of Gaussian wiretap codes from unimodular latticesFuchun Lin, Frédérique E. Oggier. 718-722 [doi]
- Linear perfect secret key agreementChung Chan. 723-726 [doi]