Abstract is missing.
- Universal source coding for multiple decoders with side informationShigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu. 1-5 [doi]
- Robust multiresolution coding with Hamming distortion measureJun Chen, Sorina Dumitrescu, Ying Zhang, Jia Wang. 6-10 [doi]
- On zero-error source coding with feedbackMayank Bakshi, Michelle Effros. 11-15 [doi]
- Rate distortion with Side-Information at many receiversRoy Timo, Terence Chan, Alex J. Grant. 16-20 [doi]
- The generalized quadratic Gaussian CEO problem: New cases with tight rate region and applicationsYang Yang, Yifu Zhang, Zixiang Xiong. 21-25 [doi]
- Sum rate of the vacationing CEO problemRajiv Soundararajan, Aaron B. Wagner, Sriram Vishwanath. 26-30 [doi]
- Cascade and triangular source coding with side information at the first two nodesHaim H. Permuter, Tsachy Weissman. 31-35 [doi]
- On the excess distortion exponent of the quadratic-Gaussian Wyner-Ziv problemYuval Kochman, Gregory W. Wornell. 36-40 [doi]
- On the sum-rate loss of quadratic Gaussian multiterminal source codingYang Yang, Yifu Zhang, Zixiang Xiong. 41-45 [doi]
- On the sum rate of vector Gaussian multiterminal source codingJia Wang, Jun Chen. 46-50 [doi]
- Distributed source coding of correlated memoryless Gaussian observationsYasutada Oohama. 51-55 [doi]
- Rate region of the Gaussian scalar-help-vector source-coding problemMd Saifur Rahman, Aaron B. Wagner. 56-60 [doi]
- Interaction strictly improves the Wyner-Ziv rate-distortion functionNan Ma, Prakash Ishwar. 61-65 [doi]
- On the rate distortion function of Bernoulli Gaussian sequencesCheng Chang. 66-70 [doi]
- On the physics of rate-distortion theoryNeri Merhav. 71-75 [doi]
- Improved upper bounds to the causal quadratic rate-distortion function for Gaussian stationary sourcesMilan S. Derpich, Jan Østergaard. 76-80 [doi]
- On optimal causal coding of partially observed Markov sources under classical and non-classical information structuresSerdar Yüksel. 81-85 [doi]
- Structure theorem for real-time variable-rate lossy source encoders and memory-limited decoders with side informationYonatan Kaspi, Neri Merhav. 86-90 [doi]
- Source coding with side information using list decodingMortuza Ali, Margreta Kuijper. 91-95 [doi]
- Source coding with feedforward using the posterior matching schemeHani-James Ebeid, Todd P. Coleman. 96-100 [doi]
- Asymptotic optimality of antidictionary codesTakahiro Ota, Hiroyoshi Morita. 101-105 [doi]
- Fractal compression rate curves in lossless compression of balanced treesSang-youn Oh, John C. Kieffer. 106-110 [doi]
- Local coordinates of a trellis source codeJohn C. Kieffer, John Marcos. 111-115 [doi]
- Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problemSoheil Feizi, Muriel Médard. 116-120 [doi]
- On the error exponent to redundancy ratio of interactive encoding and decodingJin Meng, En-Hui Yang. 121-125 [doi]
- On the achievable redundancy rate of fixed length source code for general sourcesMitsuharu Arimura, Ken-ichi Iwata. 126-130 [doi]
- On the overflow probability of lossless codes with side informationRyo Nomura, Toshiyasu Matsushima. 131-135 [doi]
- A tight bound on the performance of a minimal-delay joint source-channel coding schemeMarius Kleiner, Bixio Rimoldi. 136-140 [doi]
- On optimality of a hybrid digital/analog scheme for Wyner-Ziv coding over broadcast channelsYang Gao 0003, Ertem Tuncel. 141-145 [doi]
- The achievable distortion region of bivariate Gaussian source on Gaussian broadcast channelChao Tian, Suhas N. Diggavi, Shlomo Shamai. 146-150 [doi]
- Distributed signal cancelation inspired by Witsenhausen's counterexamplePulkit Grover, Anant Sahai. 151-155 [doi]
- Distortion exponents of two-way relaying cooperative networksJing Wang, Jie Liang. 156-160 [doi]
- Exact-repair MDS codes for distributed storage using interference alignmentChangho Suh, Kannan Ramchandran. 161-165 [doi]
- Interference neutralization in distributed lossy source codingMohammad Ali Maddah-Ali, David Tse. 166-170 [doi]
- Hamming coding for Multiple SourcesRick Ma, Samuel Cheng. 171-175 [doi]
- Two-way source coding through a relayHan-I Su, Abbas El Gamal. 176-180 [doi]
- Optimal multiresolution quantization for broadcast channels with random index assignmentFei Teng, En-Hui Yang, Xiang Yu. 181-185 [doi]
- Universal Slepian-Wolf source codes using low-density parity-check matricesTetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto. 186-190 [doi]
- Identification and lossy reconstruction in noisy databasesErtem Tuncel, Deniz Gündüz. 191-195 [doi]
- On the memory required to compute functions of streaming dataKrishnamurthy Viswanathan. 196-200 [doi]
- The capacity of the uniform noise rewritable channel with average costLuis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer. 201-205 [doi]
- A Fokker-Planck differential equation approach for the zero-dispersion optical fiber channelMansoor I. Yousefi, Frank R. Kschischang. 206-210 [doi]
- One-shot capacity of discrete channelsRui A. Costa, Michael Langberg, João Barros. 211-215 [doi]
- On reversible Markov chains and maximization of directed informationSiva K. Gorantla, Todd P. Coleman. 216-220 [doi]
- Minimum energy to send k bits with and without feedbackYury Polyanskiy, H. Vincent Poor, Sergio Verdú. 221-225 [doi]
- On the achievable rate of the additive Gaussian noise channel with noisy feedbackJaesang Ham, David J. Love. 226-230 [doi]
- Variable-length coding with feedback in the non-asymptotic regimeYury Polyanskiy, H. Vincent Poor, Sergio Verdú. 231-235 [doi]
- Opportunistic capacity and error exponent regions for compound channel with feedbackAditya Mahajan, Sekhar Tatikonda. 236-240 [doi]
- Bit-wise unequal error protection for variable length blockcodes with feedbackSiva K. Gorantla, Baris Nakiboglu, Todd P. Coleman, Lizhong Zheng. 241-245 [doi]
- An upper bound for the block coding error exponent with delayed feedbackHari Palaiyanur, Anant Sahai. 246-250 [doi]
- Sphere-packing bound for block-codes with feedback and finite memoryGiacomo Como, Baris Nakiboglu. 251-255 [doi]
- On the AWGN channel with noisy feedback and peak energy constraintYu Xiang, Young Han Kim. 256-259 [doi]
- Exact random coding exponents for erasure decodingAnelia Somekh-Baruch, Neri Merhav. 260-264 [doi]
- Moderate deviation analysis of channel coding: Discrete memoryless caseYücel Altug, Aaron B. Wagner. 265-269 [doi]
- Achievable error exponent of channel coding in random access communicationZheng Wang, Jie Luo 0001. 270-274 [doi]
- Least squares superposition codes of moderate dictionary size, reliable at rates up to capacityAndrew R. Barron, Antony Joseph. 275-279 [doi]
- Asynchronous capacity per unit costVenkat Chandar, Aslan Tchamkerten, David Tse. 280-284 [doi]
- Coding against delayed adversariesBikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 285-289 [doi]
- On the deterministic code capacity region of an arbitrarily varying multiple-access channel under list decodingSirin Nitinawarat. 290-294 [doi]
- The arbitrarily varying channel when the jammer knows the channel inputNing Cai, Terence Chan, Alex J. Grant. 295-299 [doi]
- Mutual information of IID complex Gaussian signals on block Rayleigh-faded channelsFredrik Rusek, Angel E. Lozano, Nihar Jindal. 300-304 [doi]
- AEP of Output when Rate is above capacity: The Gaussian caseXiugang Wu, Liang-Liang Xie. 305-309 [doi]
- Gaussian causal dirty paper capacity is at most log (1 + SNR over e)Mustafa Kesal, Uri Erez. 310-314 [doi]
- Toward fast reliable communication at rates near capacity with Gaussian noiseAndrew R. Barron, Antony Joseph. 315-319 [doi]
- The SIMO pre-log can be larger than the SISO pre-logVeniamin I. Morgenshtern, Giuseppe Durisi, Helmut Bölcskei. 320-324 [doi]
- Error rates of capacity-achieving codes are convexSergey Loyka, François Gagnon, Victoria Kostina. 325-329 [doi]
- On the capacity region of the Poisson interference channelsLifeng Lai, Yingbin Liang, Shlomo Shamai. 330-334 [doi]
- Sum capacity of general deterministic interference channel with channel output feedbackAchaleshwar Sahai, Vaneet Aggarwal, Melda Yuksel, Ashutosh Sabharwal. 335-339 [doi]
- Interference decoding for deterministic channelsBernd Bandemer, Abbas El Gamal. 340-344 [doi]
- Communicating correlated sources over interference channels: The lossy caseWei Liu, Biao Chen. 345-349 [doi]
- On the capacity region of fading Z-interference channels without CSITYan Zhu, Dongning Guo. 350-354 [doi]
- Layered interference alignment: Achieving the total DOF of MIMO X-channelsSeyyed Hasan Mahboubi, Abolfazl S. Motahari, Amir K. Khandani. 355-359 [doi]
- Interference alignment for the K user MIMO interference channelAkbar Ghasemi, Abolfazl S. Motahari, Amir K. Khandani. 360-364 [doi]
- Coordination and bargaining over the Gaussian interference channelXi Liu, Elza Erkip. 365-369 [doi]
- Zero-forcing for the symmetric Interference Channel with conferencing encodersHossein Bagheri, Abolfazl S. Motahari, Amir K. Khandani. 370-374 [doi]
- Interference channels with half duplex source cooperationRui Wu, Vinod M. Prabhakaran, Pramod Viswanath. 375-379 [doi]
- Interference mitigation through limited transmitter cooperationI-Hsiang Wang, David N. C. Tse. 380-384 [doi]
- Degrees of freedom of the K-user interference channel with transmitter cooperationV. Sreekanth Annapureddy, Aly El Gamal, Venugopal V. Veeravalli. 385-389 [doi]
- Relay-aided interference alignment: Feasibility conditions and algorithmHaishi Ning, Cong Ling, Kin K. Leung. 390-394 [doi]
- Interference channel with a half-duplex Out-of-Band RelayOnur Sahin, Osvaldo Simeone, Elza Erkip. 395-399 [doi]
- The ergodic fading interference channel with an on-and-off relayYe Tian, Aylin Yener. 400-404 [doi]
- Relay-aided Interference Alignment for the quasi-static interference channelBehzad Nourani, Abolfazl S. Motahari, Amir K. Khandani. 405-409 [doi]
- Asymptotic sum-capacity of random Gaussian interference networks using interference alignmentMatthew Aldridge, Oliver Johnson, Robert J. Piechocki. 410-414 [doi]
- Normalized sum-capacity of interference networks with partial informationVaneet Aggarwal, Amir Salman Avestimehr, Ashutosh Sabharwal. 415-419 [doi]
- On the achievable rates in decentralized networks with Randomized MaskingKamyar Moshksar, Amir K. Khandani. 420-424 [doi]
- Capacity bounds on multi-pair two-way communication with a base-station aided by a relaySang Joon Kim, Besma Smida, Natasha Devroye. 425-429 [doi]
- Linear sum capacity for Gaussian multiple access channel with feedbackEhsan Ardestanizadeh, Michele A. Wigger, Young Han Kim, Tara Javidi. 430-434 [doi]
- On achievable rate regions for half-duplex causal cognitive radio channelsDebdeep Chatterjee, Tan F. Wong, Ozgur Oyman. 435-439 [doi]
- The degrees of freedom region of the MIMO cognitive interference channel with no CSITChinmay S. Vaze, Mahesh K. Varanasi. 440-444 [doi]
- On the achievable rate regions for a class of cognitive radio channels: Interference channel with degraded message sets with unidirectional destination cooperationHsuan-Yi Chu. 445-449 [doi]
- An achievable region for the discrete memoryless broadcast channel with feedbackOfer Shayevitz, Michele A. Wigger. 450-454 [doi]
- Achievable rates for the broadcast channel with feedbackRamji Venkataramanan, S. Sandeep Pradhan. 455-459 [doi]
- The two-user deterministic interference channel with rate-limited feedbackAlireza Vahid, Amir Salman Avestimehr. 460-464 [doi]
- The discrete memoryless interference channel with one-sided generalized feedbackShraga I. Bross, Yossef Steinberg, Stephan Tinguely. 465-469 [doi]
- On the capacity region of a multiple access channel with common messagesDeniz Gündüz, Osvaldo Simeone. 470-474 [doi]
- Coset codes for multiple access channels with common information based on LDPC codesHideki Yagi, H. Vincent Poor. 475-479 [doi]
- The multiple access channel with two independent states each known causally to one encoderAmos Lapidoth, Yossef Steinberg. 480-484 [doi]
- The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSITAli Haghi, Reza Khosravi-Farsani, Mohammad Reza Aref, Farokh Marvasti. 485-489 [doi]
- Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast ChannelsDinkar Vasudevan, Vijay G. Subramanian, Douglas J. Leith. 490-494 [doi]
- Optimality and approximate optimality of source-channel separation in networksChao Tian, Jun Chen, Suhas N. Diggavi, Shlomo Shamai. 495-499 [doi]
- On the separation of lossy source-network coding and channel coding in wireline networksShirin Jalali, Michelle Effros. 500-504 [doi]
- On the optimality of multi-hop communication in large wireless networksUrs Niesen, Piyush Gupta, David Tse. 505-509 [doi]
- Multi-hop routing is order-optimal in underwater extended networksWon-Yong Shin, Daniel Enrique Lucani, Muriel Médard, Milica Stojanovic, Vahid Tarokh. 510-514 [doi]
- Capacity of a class of tree networksSi-Hyeon Lee, Sae-Young Chung. 515-519 [doi]
- Typicality graphs and their propertiesAli Nazari, Dinesh Krithivasan, S. Sandeep Pradhan, Achilleas Anastasopoulos, Ramji Venkataramanan. 520-524 [doi]
- On duality relations for the discrete memoryless multiple access and broadcast channelJörg Bühler, Gerhard Wunder. 525-529 [doi]
- Operational duality between Gelfand-Pinsker and Wyner-Ziv codingAnkit Gupta 0003, Sergio Verdú. 530-534 [doi]
- On MMSE properties and I-MMSE implications in parallel MIMO Gaussian channelsRonit Bustin, Miquel Payaró, Daniel Pérez Palomar, Shlomo Shamai. 535-539 [doi]
- On an outer bound and an inner bound for the general broadcast channelAmin Aminzadeh Gohari, Abbas El Gamal, Venkat Anantharam. 540-544 [doi]
- On broadcast channels with binary inputs and symmetric outputsYanlin Geng, Chandra Nair, Shlomo Shamai, Zizhou Vincent Wang. 545-549 [doi]
- An information inequality and evaluation of Marton's inner bound for binary input broadcast channelsChandra Nair, Zizhou Vincent Wang, Yanlin Geng. 550-554 [doi]
- Secure-broadcast codes over linear-deterministic channelsAshish Khisti, Danilo Silva, Frank R. Kschischang. 555-559 [doi]
- The capacity region of a product of two unmatched Gaussian broadcast channels with three particular messages and a common messageRamy H. Gohary, Timothy N. Davidson. 560-564 [doi]
- On Gaussian MIMO broadcast channels with common and private messagesErsen Ekrem, Sennur Ulukus. 565-569 [doi]
- Toward computing the capacity region of degraded broadcast channelKensuke Yasui, Toshiyasu Matsushima. 570-574 [doi]
- Construction of broadcast channel code based on hash propertyJun Muramatsu, Shigeki Miyake. 575-579 [doi]
- Capacity bounds for networks of broadcast channelsMichelle Effros. 580-584 [doi]
- Parallel relay broadcast channelsLiang Chen. 585-589 [doi]
- Capacity of a class of broadcast relay channelsArash Behboodi, Pablo Piantanida. 590-594 [doi]
- The capacity region of a class of broadcast channels with a sequence of less noisy receiversZizhou Vincent Wang, Chandra Nair. 595-598 [doi]
- An outer bound on the capacity region of Broadcast-Relay-ChannelSadaf Salehkalaibar, Leila Ghabeli, Mohammad Reza Aref. 599-603 [doi]
- Multi-source noisy network codingSung-Hoon Lim, Young Han Kim, Abbas El Gamal, Sae-Young Chung. 604-608 [doi]
- Outage capacity of the broadcast channel in the low power regimeMomin Uppal, Anders Høst-Madsen, Zixiang Xiong. 609-613 [doi]
- On the weighted sum-rate capacity of broadcast channels that generate interferenceXiaohu Shang, H. Vincent Poor. 614-618 [doi]
- Interference alignment under limited feedback for MIMO interference channelsRajesh T. Krishnamachari, Mahesh K. Varanasi. 619-623 [doi]
- On the capacity of compound state-dependent channels with states known at the transmitterPablo Piantanida, Shlomo Shamai. 624-628 [doi]
- Source and channel coding with action-dependent partially known two-sided state informationKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund, Ragnar Thobaben. 629-633 [doi]
- State-Dependent Relay Channel with Private Messages with partial causal and non-causal Channel State InformationBahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref. 634-638 [doi]
- Bounds on the capacity of the relay channel with noncausal state information at sourceAbdellatif Zaidi, Shlomo Shamai, Pablo Piantanida, Luc Vandendorpe. 639-643 [doi]
- Diamond channel with partially separated relaysRavi Tandon, Sennur Ulukus. 644-648 [doi]
- On the capacity of the half-duplex diamond channelHossein Bagheri, Abolfazl S. Motahari, Amir K. Khandani. 649-653 [doi]
- The binary-symmetric parallel-relay networkLawrence Ong, Sarah J. Johnson, Christopher M. Kellett. 654-658 [doi]
- On achievable rates for relay networks based on partial decode-and-forwardLeila Ghabeli, Mohammad Reza Aref. 659-663 [doi]
- Capacity Theorems for the AWGN multi-way relay channelLawrence Ong, Christopher M. Kellett, Sarah J. Johnson. 664-668 [doi]
- Approximately achieving Gaussian relay network capacity with lattice codesAyfer Özgür, Suhas N. Diggavi. 669-673 [doi]
- Multiplexing gain of amplify-forward relaying in wireless multi-antenna relay networksShahab Oveis Gharan, Amir K. Khandani. 674-678 [doi]
- On the non-coherent wideband multipath fading relay channelNadia Fawaz, Muriel Médard. 679-683 [doi]
- Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BECShrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke. 684-688 [doi]
- On universal LDPC code ensemblesIgal Sason, Boaz Shuval. 689-693 [doi]
- EXIT chart approximations using the role model approachJossy Sayir. 694-698 [doi]
- Channels with both random errors and burst erasures: Capacities, LDPC code thresholds, and code performancesKan Li, Aleksandar Kavcic, Raman Venkataramani, M. Fatih Erden. 699-703 [doi]
- Connecting the Bethe entropy and the edge zeta function of a cycle codePascal O. Vontobel. 704-708 [doi]
- On the thresholds of generalized LDPC convolutional codes based on protographsMichael Lentmaier, Gerhard Fettweis. 709-713 [doi]
- Finite-length scaling of non-binary (c, d) LDPC codes for the BECIryna Andriyanova, Kenta Kasai. 714-718 [doi]
- On the typical minimum distance of protograph-based generalized LDPC codesShadi Abu-Surra, Dariush Divsalar, William E. Ryan. 719-723 [doi]
- Lowering the error floor of LDPC codes using cyclic liftingsReza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari. 724-728 [doi]
- Error floors of non-binary LDPC codesTakayuki Nozaki, Kenta Kasai, Koichi Sakaniwa. 729-733 [doi]
- Error floor analysis in LDGM codesKejing Liu, Javier Garcia-Frias. 734-738 [doi]
- Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoderGyu Bum Kyung, Chih-Chun Wang. 739-743 [doi]
- LP decoding of regular LDPC codes in memoryless channelsNissim Halabi, Guy Even. 744-748 [doi]
- The limits of error correction with lp decodingMeng Wang, Weiyu Xu, Ao Tang. 749-753 [doi]
- On the joint decoding of LDPC codes and finite-state channels via linear programmingByung-Hak Kim, Henry D. Pfister. 754-758 [doi]
- On the pseudocodeword redundancyJens Zumbrägel, Mark F. Flanagan, Vitaly Skachek. 759-763 [doi]
- On minimal pseudo-codewordsRoxana Smarandache. 764-768 [doi]
- Multilevel decoders surpassing belief propagation on the binary symmetric channelShiva Kumar Planjery, David Declercq, Shashi Kiran Chilappagari, Bane V. Vasic. 769-773 [doi]
- Improved adaptive belief propagation decoding using edge-local complementationJoakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes. 774-778 [doi]
- Multitree decoding and multitree-aided LDPC decodingMaja Ostojic, Hans-Andrea Loeliger. 779-783 [doi]
- LDPC codes with fixed initialization decoding over binary symmetric channelManabu Hagiwara, Marc P. C. Fossorier, Hideki Imai. 784-788 [doi]
- Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspectiveJian-Jia Weng, Chih-Chieh Lai, Chung-Hsuan Wang. 789-793 [doi]
- A low-complexity joint detection-decoding algorithm for nonbinary LDPC-coded modulation systemsXuepeng Wang, Baoming Bai, Xiao Ma. 794-798 [doi]
- Tree-structure expectation propagation for decoding LDPC codes over binary erasure channelsPablo M. Olmos, Juan José Murillo-Fuentes, Fernando Pérez-Cruz. 799-803 [doi]
- Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detectionJun Won Choi, Byonghyo Shim, A. C. Singer. 804-808 [doi]
- On distance properties of quasi-cyclic protograph-based LDPC codesBrian K. Butler, Paul H. Siegel. 809-813 [doi]
- Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codesLi Zhang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Bo Zhou. 814-818 [doi]
- New low-density parity-check codes with large girth based on hypergraphsIrina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov. 819-823 [doi]
- New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codesDavid G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.. 824-828 [doi]
- Algebraic constructions of graph-based nested codes from protographsChristine A. Kelley, Jörg Kliewer. 829-833 [doi]
- Recursive convolutional codes for time-invariant LDPC convolutional codesE. Roy, Christian Cardinal, David Haccoun. 834-838 [doi]
- Two-dimensional generalized Reed-Solomon codes: A unified framework for quasi-cyclic LDPC codes constructed based on finite fieldsChao Chen, Baoming Bai, Xinmei Wang. 839-843 [doi]
- Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codesKenta Kasai, David Declercq, Charly Poulliat, Koichi Sakaniwa. 844-848 [doi]
- A new construction of UEP QC-LDPC codesChi-Jen Wu, Chung-Hsuan Wang, Chi-Chao Chao. 849-853 [doi]
- Codes in permutations and error correction for rank modulationAlexander Barg, Arya Mazumdar. 854-858 [doi]
- LDPC codes for rank modulation in flash memoriesFan Zhang, Henry D. Pfister, Anxiao Jiang. 859-863 [doi]
- Partial rank modulation for flash memoriesZhiying Wang, Jehoshua Bruck. 864-868 [doi]
- Constant-weight Gray codes for local rank modulationMoshe Schwartz. 869-873 [doi]
- On the scaling of polar codes: I. The behavior of polarized channelsSeyed Hamed Hassani, Rüdiger L. Urbanke. 874-878 [doi]
- On the scaling of polar codes: II. The behavior of un-polarized channelsSeyed Hamed Hassani, Kasra Alishahi, Rüdiger L. Urbanke. 879-883 [doi]
- An empirical scaling law for polar codesSatish Babu Korada, Andrea Montanari, Emre Telatar, Rüdiger L. Urbanke. 884-888 [doi]
- Refined rate of channel polarizationToshiyuki Tanaka, Ryuhei Mori. 889-893 [doi]
- Channel polarization on q-ary discrete memoryless channels by arbitrary kernelsRyuhei Mori, Toshiyuki Tanaka. 894-898 [doi]
- Source polarizationErdal Arikan. 899-903 [doi]
- Lossless source coding with polar codesHarm S. Cronie, Satish Babu Korada. 904-908 [doi]
- Polar codes for q-ary source codingMohammad Karzand, Emre Telatar. 909-912 [doi]
- Achieving the secrecy capacity of wiretap channels using Polar codesHessam Mahdavifar, Alexander Vardy. 913-917 [doi]
- Concatenated Polar codesMayank Bakshi, Sidharth Jaggi, Michelle Effros. 918-922 [doi]
- Dirty paper coding using sign-bit shaping and LDPC codesG. Shilpa, Andrew Thangaraj, Srikrishna Bhashyam. 923-927 [doi]
- A practical message-wise unequal error protection coding schemeChen Gong, Guosen Yue, Xiaodong Wang. 928-932 [doi]
- Cooperative communications based on trellis pruningShashank V. Maiya, Thomas E. Fuja. 933-937 [doi]
- Bounding of MAP decode and forward relayingIngmar Land, Alexandre Graell i Amat, Lars K. Rasmussen. 938-942 [doi]
- Generalized distributed network coding based on nonbinary linear block codes for multi-user cooperative communicationsJoão Luiz Rebelatto, Bartolomeu F. Uchôa Filho, Yonghui Li, Branka Vucetic. 943-947 [doi]
- Bilayer protograph codes for half-duplex relay channelsThuy Van Nguyen, Aria Nosratinia, Dariush Divsalar. 948-952 [doi]
- A rateless coded protocol for half-duplex wireless relay channelsMomin Uppal, Guosen Yue, Xiaodong Wang, Zixiang Xiong. 953-957 [doi]
- Data-dependent write channel model for Magnetic RecordingAravind R. Iyengar, Paul H. Siegel, Jack K. Wolf. 958-962 [doi]
- On sufficient conditions for testing optimality of codewords in ISI channelsFabian Lim, Aleksandar Kavcic, Marc P. C. Fossorier. 963-967 [doi]
- Algorithms for memories with stuck cellsLuis Alfonso Lastras-Montaño, Ashish Jagmohan, Michele Franceschini. 968-972 [doi]
- Rewritable storage channels with limited number of rewrite iterationsThomas Mittelholzer, Luis Alfonso Lastras-Montaño, Mayank Sharma, Michele Franceschini. 973-977 [doi]
- Coding for high-density magnetic recordingArya Mazumdar, Alexander Barg, Navin Kashyap. 978-982 [doi]
- A new encoding method for integrated-interleaved codesYingquan Wu. 983-987 [doi]
- Codes for symbol-pair read channelsYuval Cassuto, Mario Blaum. 988-992 [doi]
- On the equivalence between the B-Code constructions and perfect one-factorizationsMingqiang Li, Jiwu Shu. 993-996 [doi]
- Tight asymptotic bounds for the deletion channel with small deletion probabilitiesAdam Kalai, Michael Mitzenmacher, Madhu Sudan. 997-1001 [doi]
- On the deletion channel with small deletion probabilityYashodhan Kanoria, Andrea Montanari. 1002-1006 [doi]
- Marker code optimization and symbol-level synchronization for insertion/deletion channelsFeng Wang, Dario Fertonani, Tolga M. Duman. 1007-1011 [doi]
- On efficient repetition error correcting codesLuca G. Tallini, Noha Elarief, Bella Bose. 1012-1016 [doi]
- An algebraic approach to physical-layer network codingChen Feng, Danilo Silva, Frank R. Kschischang. 1017-1021 [doi]
- Integer-forcing linear receiversJiening Zhan, Bobak Nazer, Uri Erez, Michael Gastpar. 1022-1026 [doi]
- Complex low density lattice codesYair Yona, Meir Feder. 1027-1031 [doi]
- Near-optimum low-complexity lattice quantizationBoris D. Kudryashov, Kirill Yurkov. 1032-1036 [doi]
- The lifting construction: A general solution for the fat strut problemNeil J. A. Sloane, Vinay A. Vaishampayan, Sueli I. Rodrigues Costa. 1037-1041 [doi]
- Closest point algorithms with lp norm for root latticesKenichirou Takizawa, Hideki Yagi, Tsutomu Kawabata. 1042-1046 [doi]
- Perfect graph codes over two dimensional latticesCarmen Martínez, Cristobal Camarero, Ramón Beivide. 1047-1051 [doi]
- An improved 8 × 8 approximately universal code with the large normalized diversity productMing-Yang Chen, Hua-Chieh Li, John M. Cioffi. 1052-1055 [doi]
- Fast-group-decodable STBCs via codes over GF(4)Lakshmi Prasad Natarajan, B. Sundar Rajan. 1056-1060 [doi]
- Rotated modulations for outage probability minimization: a fading space approachDieter Duyck, Joseph Jean Boutros, Marc Moeneclaey. 1061-1065 [doi]
- A systematic design of space-time block codes with reduced-complexity partial interference cancellation group decodingWei Zhang 0001, Long Shi, Xiang-Gen Xia. 1066-1070 [doi]
- On space-time code design with a conditional PIC group decodingTianyi Xu, Xiang-Gen Xia. 1071-1075 [doi]
- Set-partition methods and orthogonal designsSmarajit Das. 1076-1079 [doi]
- Fast-decodable MIDO codes from crossed product algebrasFrédérique E. Oggier, Roope Vehkalahti, Camilla Hollanti. 1080-1084 [doi]
- Permutation decoding the binary images of certain double-parity reed-solomon codesFabian Lim, Marc P. C. Fossorier, Aleksandar Kavcic. 1085-1089 [doi]
- A fast Generalized Minimum Distance decoder for Reed-Solomon codes based on the extended Euclidean algorithmSabine Kampf, Martin Bossert. 1090-1094 [doi]
- A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codesPhong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan. 1095-1099 [doi]
- Optimal thresholds for GMD decoding with ℓ+1 over ℓ-extended Bounded Distance decodersChristian Senger, Vladimir Sidorenko, Martin Bossert, Victor V. Zyablov. 1100-1104 [doi]
- MacWilliams identities for terminated convolutional codesG. David Forney Jr.. 1105-1109 [doi]
- Hayman-like techniques for computing input-output weight distribution of convolutional encodersChiara Ravazzi, Fabio Fagnani. 1110-1114 [doi]
- Bounds on codes with few distancesAlexander Barg, Oleg R. Musin. 1115-1119 [doi]
- Heavy weight codesGérard D. Cohen, Patrick Solé, Aslan Tchamkerten. 1120-1124 [doi]
- Subfield-subcodes of Generalized Toric codesFernando Hernando, Michael E. O'Sullivan, Emanuel M. Popovici, Shraddha Srivastava. 1125-1129 [doi]
- Good codes from generalised algebraic geometry codesMubarak Jibril, Martin Tomlinson, Mohammed Zaki Ahmed, Cen Tjhai. 1130-1132 [doi]
- The predictable leading monomial property for polynomial vectors over a ringMargreta Kuijper, Kristina Schindelar. 1133-1137 [doi]
- Polynomials with linear structure and Maiorana-McFarland constructionPascale Charpin, Sumanta Sarkar. 1138-1142 [doi]
- A basis for all solutions of the key equation for Gabidulin codesAntonia Wachter, Vladimir Sidorenko, Martin Bossert. 1143-1147 [doi]
- Decoding interleaved Gabidulin codes and multisequence linearized shift-register synthesisVladimir Sidorenko, Martin Bossert. 1148-1152 [doi]
- Properties of quasi-uniform codesTerence H. Chan, Alex J. Grant, Thomas Britz. 1153-1157 [doi]
- Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer ringsCátia Regina de Oliveira Quilles Queiroz, Reginaldo Palazzo Jr.. 1158-1162 [doi]
- On the threshold of Maximum-Distance Separable codesBruno Kindarji, Gérard D. Cohen, Hervé Chabanne. 1163-1167 [doi]
- Performance analysis of linear codes under maximum likelihood decoding at low ratesHideki Yagi, H. Vincent Poor. 1168-1172 [doi]
- An upper bound on the separating redundancy of linear block codesKhaled A. S. Abdel-Ghaffar, Jacobus H. Weber. 1173-1177 [doi]
- High dimensional error-correcting codesEitan Yaakobi, Tuvi Etzion. 1178-1182 [doi]
- On the minimum weight problem of permutation codes under Chebyshev distanceMin-Zheng Shieh, Shi-Chun Tsai. 1183-1187 [doi]
- On the classification of self-dual additive codes over GF(9)Lars Eirik Danielsen. 1188-1192 [doi]
- Algebraic list-decoding on the operator channelHessam Mahdavifar, Alexander Vardy. 1193-1197 [doi]
- A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codesAlexander Zeh, Christian Senger. 1198-1202 [doi]
- Local-testability and self-correctability of q-ary sparse linear codesWidad Machmouchi. 1203-1207 [doi]
- Fixed-rate tiling encoders for 2-D constraintsArtyom Sharov, Ron M. Roth. 1208-1212 [doi]
- Generalized belief propagation algorithm for the capacity of multi-dimensional run-length limited constraintsGiovanni Sabato, Mehdi Molkaraie. 1213-1217 [doi]
- Moment balancing templates for (d, k) constrained codesLing Cheng, Hendrik C. Ferreira, Izak Broere. 1218-1222 [doi]
- The tradeoff function for a class of RLL(d, k) constraintsErez Louidor. 1223-1227 [doi]
- The linear complexity of binary sequences with optimal autocorrelationQi Wang, Xiaoni Du. 1228-1232 [doi]
- 2m - 1Nam Yul Yu, Guang Gong. 1233-1237 [doi]
- On reconstructing a string from its substring compositionsJayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan. 1238-1242 [doi]
- Quasi-Hadamard matrixKi-Hyeon Park, Hong-Yeop Song. 1243-1247 [doi]
- Generalizing the Blum-Elias method for generating random bits from Markov chainsHongchao Zhou, Jehoshua Bruck. 1248-1252 [doi]
- On the construction of binary sequence families with low correlation and large sizesUdaya Parampalli, Xiaohu Tang, Serdar Boztas. 1253-1257 [doi]
- Generalized constructions of polyphase sequence families using shift and addition of multiplicative character sequencesNam Yul Yu, Guang Gong. 1258-1262 [doi]
- A new family of p-ary decimated sequences with low correlationJi-Youp Kim, Sung-Tai Choi, Jong-Seon No, Habong Chung. 1263-1267 [doi]
- 2 over 8Sung-Tai Choi, Jong-Seon No, Habong Chung. 1268-1271 [doi]
- On colorings of bivariate random sequencesFrantisek Matús, Michal Kupsa. 1272-1276 [doi]
- New binomial bent functions over the finite fields of odd characteristicTor Helleseth, Alexander Kholosha. 1277-1281 [doi]
- k-fold cyclotomic numbers and their applications to frequency-hopping sequencesJin-Ho Chung, Kyeongcheol Yang. 1282-1286 [doi]
- The Hausdorff dimension of the halting self-similar sets of T-universal prefix-free machinesKohtaro Tadaki. 1287-1291 [doi]
- A new class of ternary and quaternary sequences with two-level autocorrelationHonggang Hu, Guang Gong. 1292-1296 [doi]
- Cross correlation of nonbinary niho-type sequencesJinquan Luo. 1297-1299 [doi]
- Nonbinary sequences with perfect and nearly perfect autocorrelationsSerdar Boztas, Udaya Parampalli. 1300-1304 [doi]
- On m-ary balanced codes with parallel decodingDanilo Pelusi, Luca G. Tallini, Bella Bose. 1305-1309 [doi]
- Near MDS poset codes and distributionsAlexander Barg, Punarbasu Purkayastha. 1310-1314 [doi]
- On cyclic lowest density MDS array codes constructed using startersMingqiang Li, Jiwu Shu. 1315-1319 [doi]
- DNA sequences generated by ℤ4-linear codesAndréa Santos Leite da Rocha, Luzinete Cristina Bonani de Faria, João H. Kleinschmidt, Reginaldo Palazzo Jr., M. C. Silva-Filho. 1320-1324 [doi]
- On critical relative distance of DNA codes for additive stem similarityArkadii G. D'yachkov, A. Voronina, Anthony J. Macula, Thomas E. Renz, Vyacheslav V. Rykov. 1325-1329 [doi]
- On the synthesis of stochastic flow networksHongchao Zhou, Ho-Lin Chen, Jehoshua Bruck. 1330-1334 [doi]
- Rényi divergence and majorizationTim van Erven, Peter Harremoës. 1335-1339 [doi]
- Minimax lower bounds via f-divergencesAditya Guntuboyina. 1340-1344 [doi]
- Joint range of f-divergencesPeter Harremoës, Igor Vajda. 1345-1349 [doi]
- Relating source coding and resolvability: A direct approachTomohiko Uyematsu. 1350-1354 [doi]
- Mutual information saddle points in channels of exponential family typeTodd P. Coleman, Maxim Raginsky. 1355-1359 [doi]
- An entropy inequality for q-ary random variables and its application to channel polarizationEren Sasoglu. 1360-1363 [doi]
- Existence of new inequalities for representable polymatroidsTerence Chan, Alex J. Grant, Doris Kern. 1364-1368 [doi]
- The entropies of the sum and the difference of two IID random variables are not too differentMokshay M. Madiman, Ioannis Kontoyiannis. 1369-1372 [doi]
- Information-theoretic bounds on model selection for Gaussian Markov random fieldsWei Wang 0039, Martin J. Wainwright, Kannan Ramchandran. 1373-1377 [doi]
- Divergence of information-criterion based Markov order estimators for infinite memory processesZsolt Talata. 1378-1382 [doi]
- Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrongPeter Grunwald, Wojciech Kotlowski. 1383-1387 [doi]
- Necessary and sufficient conditions for high-dimensional salient feature subset recoveryVincent Y. F. Tan, Matthew Johnson, Alan S. Willsky. 1388-1392 [doi]
- Decentralized multihypothesis sequential detectionYan Wang, Yajun Mei. 1393-1397 [doi]
- Information theoretic model validation for clusteringJoachim M. Buhmann. 1398-1402 [doi]
- MDL hierarchical clustering for stemmatologyPo-Hsiang Lai, Teemu Roos, Joseph A. O'Sullivan. 1403-1407 [doi]
- On regret of parametric mismatch in minimum mean square error estimationMajid Fozunbal. 1408-1412 [doi]
- Entropy measures vs. algorithmic informationAndreia Teixeira, Andre Souto, Armando Matos, Luis Filipe Coelho Antunes. 1413-1417 [doi]
- A near-optimal (minimax) tree-structured partition for mutual information estimationJorge F. Silva, Shrikanth S. Narayanan. 1418-1422 [doi]
- On data-driven histogram-based estimation for mutual informationJorge F. Silva, Shrikanth S. Narayanan. 1423-1427 [doi]
- Non-parametric estimation of integral probability metricsBharath K. Sriperumbudur, Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, Gert R. G. Lanckriet. 1428-1432 [doi]
- Universal estimation of directed informationLei Zhao, Haim H. Permuter, Young Han Kim, Tsachy Weissman. 1433-1437 [doi]
- Entropy and the hyperplane conjecture in convex geometrySergey Bobkov, Mokshay M. Madiman. 1438-1442 [doi]
- Compressing a long range dependent renewal processBarlas Oguz, Venkat Anantharam. 1443-1447 [doi]
- Markov lemma for countable alphabetsSiu-Wai Ho. 1448-1452 [doi]
- Functional properties of MMSEYihong Wu, Sergio Verdú. 1453-1457 [doi]
- Empirical processes and typical sequencesMaxim Raginsky. 1458-1462 [doi]
- MMSE dimensionYihong Wu, Sergio Verdú. 1463-1467 [doi]
- Entropy rate of continuous-state hidden Markov chainsGuangyue Han, Brian H. Marcus. 1468-1472 [doi]
- Optimum estimation via partition functions and information measuresNeri Merhav. 1473-1477 [doi]
- Universal hypothesis testing in the learning-limited regimeBenjamin G. Kelly, Thitidej Tularak, Aaron B. Wagner, Pramod Viswanath. 1478-1482 [doi]
- Patterns and exchangeabilityNarayana P. Santhanam, Mokshay M. Madiman. 1483-1487 [doi]
- Minimax redundancy for large alphabetsWojciech Szpankowski, Marcelo J. Weinberger. 1488-1492 [doi]
- Classification using pattern probability estimatorsJayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam. 1493-1497 [doi]
- Exact calculation of pattern probabilitiesJayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan. 1498-1502 [doi]
- Regularization for matrix completionRaghunandan H. Keshavan, Andrea Montanari. 1503-1507 [doi]
- Information theoretic bounds for low-rank matrix completionSriram Vishwanath. 1508-1512 [doi]
- Dense error correction for low-rank matrices via Principal Component PursuitArvind Ganesh, John Wright, Xiaodong Li, Emmanuel J. Candès, Yi Ma. 1513-1517 [doi]
- Stable Principal Component PursuitZihan Zhou, Xiaodong Li, John Wright, Emmanuel J. Candès, Yi Ma. 1518-1522 [doi]
- On the uniqueness of positive semidefinite matrix solution under compressed observationsWeiyu Xu, Ao Tang. 1523-1527 [doi]
- The dynamics of message passing on dense graphs, with applications to compressed sensingMohsen Bayati, Andrea Montanari. 1528-1532 [doi]
- Statistical mechanical analysis of a typical reconstruction limit of compressed sensingYoshiyuki Kabashima, Tadashi Wadayama, Toshiyuki Tanaka. 1533-1537 [doi]
- Statistical mechanical analysis of compressed sensing utilizing correlated compression matrixKoujin Takeda, Yoshiyuki Kabashima. 1538-1542 [doi]
- Extension of replica analysis to MAP estimation with applications to compressed sensingSundeep Rangan, Alyson K. Fletcher, Vivek K. Goyal. 1543-1547 [doi]
- "Compressed" compressed sensingGalen Reeves, Michael Gastpar. 1548-1552 [doi]
- Sample complexity for 1-bit compressed sensing and sparse classificationAnkit Gupta, Robert Nowak, Benjamin Recht. 1553-1557 [doi]
- Performance tradeoffs for exact support recovery of sparse signalsYuzhe Jin, Young Han Kim, Bhaskar D. Rao. 1558-1562 [doi]
- Improved bounds for sparse recovery from adaptive measurementsJarvis Haupt, Rui Castro, Robert Nowak. 1563-1567 [doi]
- Model selection: Two fundamental measures of coherence and their algorithmic significanceWaheed U. Bajwa, A. Robert Calderbank, Sina Jafarpour. 1568-1572 [doi]
- New Restricted Isometry results for noisy low-rank recoveryKarthik Mohan, Maryam Fazel. 1573-1577 [doi]
- Where is randomness needed to break the square-root bottleneck?Patrick Kuppinger, Giuseppe Durisi, Helmut Bölcskei. 1578-1582 [doi]
- Robust lossy detection using sparse measurements: The regular caseNarayanaswamy Balakrishnan, Rohit Negi, Pradeep K. Khosla. 1583-1587 [doi]
- On the dynamics of ℓ1 decoding: A microscopic approachWeiyu Xu, Ao Tang. 1588-1592 [doi]
- Recovery thresholds for ℓ1 optimization in binary compressed sensingMihailo Stojnic. 1593-1597 [doi]
- Optimal incorporation of sparsity information by weighted ℓ1 optimizationToshiyuki Tanaka, Jack Raymond. 1598-1602 [doi]
- Improved sparse recovery thresholds with two-step reweighted ℓ1 minimizationM. Amin Khajehnejad, Weiyu Xu, Amir Salman Avestimehr, Babak Hassibi. 1603-1607 [doi]
- High-rate vector quantization for the Neyman-Pearson detection of some stationary mixing processesJoffrey Villard, Pascal Bianchi. 1608-1612 [doi]
- Error exponents for composite hypothesis testing of Markov forest distributionsVincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky. 1613-1617 [doi]
- Feature extraction for universal hypothesis testing via rank-constrained optimizationDayu Huang, Sean P. Meyn. 1618-1622 [doi]
- Active M-ary sequential hypothesis testingMohammad Naghshvar, Tara Javidi. 1623-1627 [doi]
- On minimax robust detection of stationary Gaussian signals in white Gaussian noiseWenyi Zhang, H. Vincent Poor. 1628-1632 [doi]
- Robust waveform design for MIMO radarsEmanuele Grossi, Marco Lops, Luca Venturino, Antonia Maria Tulino. 1633-1637 [doi]
- High-dimensional Matched Subspace Detection when data are missingLaura Balzano, Benjamin Recht, Robert Nowak. 1638-1642 [doi]
- Towards robust phoneme classification with hybrid featuresJibran Yousafzai, Zoran Cvetkovic, Peter Sollich. 1643-1647 [doi]
- Universal lossless compression-based denoisingHan-I Su, Tsachy Weissman. 1648-1652 [doi]
- Toward properties of twice-universality in denoisingErik Ordentlich, Krishnamurthy Viswanathan, Marcelo J. Weinberger. 1653-1657 [doi]
- On spectral estimators of Boolean functionsSteffen Schober, Martin Bossert. 1658-1662 [doi]
- On order relations between lower bounds on the MSE of unbiased estimatorsKoby Todros, Joseph Tabrikian. 1663-1667 [doi]
- Local popularity based collaborative filtersKishor Barman, Onkar Dabeer. 1668-1672 [doi]
- Eigen-inference for multi-source power estimationRomain Couillet, Jack W. Silverstein, Mérouane Debbah. 1673-1677 [doi]
- Estimating the information rate of noisy two-dimensional constrained channelsMehdi Molkaraie, Hans-Andrea Loeliger. 1678-1682 [doi]
- Feedback message passing for inference in gaussian graphical modelsYing Liu, Venkat Chandrasekaran, Animashree Anandkumar, Alan S. Willsky. 1683-1687 [doi]
- Two-way transmission capacity of wireless ad-hoc networksRahul Vaze, Kien T. Truong, Robert W. Heath Jr., Steven Weber. 1688-1692 [doi]
- A new method for computing the transmission capacity of non-Poisson wireless networksRadha Krishna Ganti, Jeffrey G. Andrews. 1693-1697 [doi]
- Information-theoretic capacity of clustered random networksMichele Garetto, Alessandro Nordio, Carla-Fabiana Chiasserini, Emilio Leonardi. 1698-1702 [doi]
- Performance of interference alignment in clustered wireless ad hoc networksRoland Tresch, Maxime Guillaud. 1703-1707 [doi]
- Analysis of the benefits of Superposition Coding in random wireless networksSundaram Vanka, Martin Haenggi. 1708-1712 [doi]
- Capacity scaling of wireless ad hoc networks: Effect of finite wavelengthSi-Hyeon Lee, Sae-Young Chung. 1713-1717 [doi]
- An upper bound on multi-hop transmission capacity with dynamic routing selectionYuxin Chen, Jeffrey G. Andrews. 1718-1722 [doi]
- Degrees of freedom of large planar wireless networks embedded in a 3D domainMassimo Franceschetti, Marco Donald Migliore, Paolo Minero, Fulvio Schettino. 1723-1727 [doi]
- Limit laws for random spatial graphical modelsAnimashree Anandkumar, Joseph E. Yukich, Alan S. Willsky. 1728-1732 [doi]
- The delay-optimal number of hops in Poisson multi-hop networksKostas Stamatiou, Martin Haenggi. 1733-1737 [doi]
- Fractional Brownian models for vector field dataPouya Dehghani Tafti, Michael Unser. 1738-1742 [doi]
- Transport capacity and connectivity of Cognitive Radio networks with outage constraintChengzhi Li, Huaiyu Dai. 1743-1747 [doi]
- The missing piece syndrome in peer-to-peer communicationBruce E. Hajek, Ji Zhu. 1748-1752 [doi]
- Weighted Gossip: Distributed Averaging using non-doubly stochastic matricesFlorence Bénézit, Vincent D. Blondel, Patrick Thiran, John N. Tsitsiklis, Martin Vetterli. 1753-1757 [doi]
- Tight bounds for algebraic gossip on graphsMichael Borokhovich, Chen Avin, Zvi Lotker. 1758-1762 [doi]
- Distributed consensus with finite messagingDebashis Dash, Ashutosh Sabharwal. 1763-1767 [doi]
- A near-optimal algorithm for network-constrained averaging with noisy linksNima Noorshams, Martin J. Wainwright. 1768-1772 [doi]
- Minimum delay packet-sizing for linear multi-hop networks with cooperative transmissionsNing Wen, Randall A. Berry. 1773-1777 [doi]
- Avoiding interruptions - QoE trade-offs in block-coded streaming media applicationsAli ParandehGheibi, Muriel Médard, Srinivas Shakkottai, Asuman E. Ozdaglar. 1778-1782 [doi]
- Minimizing streaming delay in homogeneous peer-to-peer networksJoe Wenjie Jiang, Shaoquan Zhang, Minghua Chen, Mung Chiang. 1783-1787 [doi]
- Dynamic coding and rate-control for serving deadline-constrained traffic over fading channelsHarsha Gangammanavar, Atilla Eryilmaz. 1788-1792 [doi]
- On ARQ for packet erasure channels with Bernoulli arrivalsDinkar Vasudevan, Vijay G. Subramanian, Douglas J. Leith. 1793-1797 [doi]
- On the queueing behavior of random codes over a gilbert-elliot erasure channelParimal Parag, Jean-François Chamberland, Henry D. Pfister, Krishna R. Narayanan. 1798-1802 [doi]
- Network capacity region of multi-queue multi-server queueing system with time varying connectivitiesHassan Halabian, Ioannis Lambadaris, Chung-Horng Lung. 1803-1807 [doi]
- Delay minimization with a general pentagon rate regionJing Yang 0002, Sennur Ulukus. 1808-1812 [doi]
- Medium access control via nearest-neighbor interactions for regular wireless networksKa-Hung Hui, Dongning Guo, Randall A. Berry. 1813-1817 [doi]
- Jamming games for power controlled medium access with dynamic trafficYalin Evren Sagduyu, Randall A. Berry, Anthony Ephremides. 1818-1822 [doi]
- A channel coding approach for random access communication with bursty sourcesJie Luo 0001, Anthony Ephremides. 1823-1827 [doi]
- Construction of short protocol sequences with worst-case throughput guaranteeKenneth W. Shum, Wing Shing Wong. 1828-1832 [doi]
- Towards optimum cost in multi-hop networks with arbitrary network demandsKumar Viswanatha, Emrah Akyol, Kenneth Rose. 1833-1837 [doi]
- Cooperative reliability for streaming multiple accessYanina Shkel, Stark C. Draper. 1838-1842 [doi]
- Delay optimal power control and relay selection for two-hop cooperative OFDM systems via distributive stochastic learningRui Wang 0007, Vincent K. N. Lau, Huang Huang. 1843-1847 [doi]
- Geometric approximations of some Aloha-like stability regionsNan Xie, Steven Weber. 1848-1852 [doi]
- Communicating the sum of sources in a 3-sources/3-terminals network; revisitedMichael Langberg, Aditya Ramamoorthy. 1853-1857 [doi]
- A necessary and sufficient condition for solvability of a 3s/3t sum-networkSagar Shenvi, Bikash Kumar Dey. 1858-1862 [doi]
- Optimal ordering of transmissions for computing Boolean threshold functionsHemant Kowshik, P. R. Kumar. 1863-1867 [doi]
- Infinite-message interactive function computation in collocated networksNan Ma, Prakash Ishwar. 1868-1872 [doi]
- Optimal computation of symmetric Boolean functions in tree networksHemant Kowshik, P. R. Kumar. 1873-1877 [doi]
- Network coding for multiple unicasts: An interference alignment approachAbhik Kumar Das, Sriram Vishwanath, Syed Ali Jafar, Athina Markopoulou. 1878-1882 [doi]
- DEDI: A framework for analyzing rank evolution of random network coding in a wireless networkDan Zhang, Narayan B. Mandayam, Shyam Parekh. 1883-1887 [doi]
- A randomized algorithm and performance bounds for coded cooperative data exchangeAlexander Sprintson, Parastoo Sadeghi, Graham Booker, Salim Y. El Rouayheb. 1888-1892 [doi]
- On the capacity of wireless 1-hop intersession network coding - a broadcast packet erasure channel approachChih-Chun Wang. 1893-1897 [doi]
- Rate-of-decay of probability of isolation in dense sensor networks with bounding constraintsArun Kumar Singh, Petros Elia, Dirk T. M. Slock. 1898-1902 [doi]
- On algebraic traceback in dynamic networksAbhik Kumar Das, Shweta Agrawal, Sriram Vishwanath. 1903-1907 [doi]
- On the code length of TCAM coding schemesOri Rottenstreich, Isaac Keslassy. 1908-1912 [doi]
- Graph-constrained group testingMahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Venkatesh Saligrama. 1913-1917 [doi]
- Data movement and aggregation in flash memoriesAnxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck. 1918-1922 [doi]
- Coding for sensing in Content Addressable MemoriesLuis Alfonso Lastras-Montaño, Michele Franceschini, B. Rajendran, C. Lam. 1923-1927 [doi]
- Low complexity codes for writing a write-once memory twiceYunnan Wu. 1928-1932 [doi]
- Multiple error-correcting WOM-codesEitan Yaakobi, Paul H. Siegel, Alexander Vardy, Jack K. Wolf. 1933-1937 [doi]
- Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storageK. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran. 1938-1942 [doi]
- A flexible class of regenerating codes for distributed storageNihar B. Shah, K. V. Rashmi, P. Vijay Kumar. 1943-1947 [doi]
- Security in distributed storage systems by communicating a logarithmic number of bitsTheodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho. 1948-1952 [doi]
- Secure distributive storage of decentralized source data: Can interaction help?Salim Y. El Rouayheb, Vinod M. Prabhakaran, Kannan Ramchandran. 1953-1957 [doi]
- Memory allocation in distributed storage networksMohsen Sardari, Ricardo Restrepo, Faramarz Fekri, Emina Soljanin. 1958-1962 [doi]
- Small ensembles of sampling matrices constructed from coding theoryAlexander Barg, Arya Mazumdar. 1963-1967 [doi]
- A simple message-passing algorithm for compressed sensingVenkat Chandar, Devavrat Shah, Gregory W. Wornell. 1968-1972 [doi]
- Sparse reconstruction via the Reed-Muller SieveA. Robert Calderbank, Stephen D. Howard, Sina Jafarpour. 1973-1977 [doi]
- Worst configurations (instantons) for Compressed Sensing over reals: A channel coding approachShashi Kiran Chilappagari, Michael Chertkov, Bane V. Vasic. 1978-1982 [doi]
- A novel rate allocation method for multilevel coded modulationLotfollah Beygi, Erik Agrell, Magnus Karlsson, Behrooz Makki. 1983-1987 [doi]
- Coding versus feedback: Hybrid ARQ protocols for the packet erasure channelSrinath Puducheri, Thomas E. Fuja. 1988-1992 [doi]
- Optimal error control coding for iterative cancellation systemsChristian Schlegel, Marat V. Burnashev. 1993-1997 [doi]
- Channel decoding with a Bayesian equalizerLuis Salamanca, Juan José Murillo-Fuentes, Fernando Pérez-Cruz. 1998-2002 [doi]
- Reconstruction of a turbo-code interleaver from noisy observationMaxime Cote, Nicolas Sendrier. 2003-2007 [doi]
- Methods for the reconstruction of parallel turbo codesMathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Tillich. 2008-2012 [doi]
- Stopping set analysis of 3-dimensional turbo code ensemblesAlexandre Graell i Amat, Eirik Rosnes. 2013-2017 [doi]
- Irregular turbo codes in block-fading channelsGhassan M. Kraidy, Joseph Jean Boutros, Albert Guillen i Fabregas. 2018-2022 [doi]
- Termination and tailbiting of rate-k/n direct product convolutional codesFrancesca Vatta, Vladimir Sidorenko, Martin Bossert. 2023-2027 [doi]
- UEP-optimal convolutional encoders with smallest McMillan degreeChung-Hsuan Wang, Wei-Fan Wu, Jian-Jia Weng. 2028-2032 [doi]
- Interference focusing for mitigating cross-phase modulation in a simplified optical fiber modelHassan Ghozlan, Gerhard Kramer. 2033-2037 [doi]
- PPM demodulation: On approaching fundamental limits of optical communicationsSaikat Guha, Jonathan L. Habif, Masahiro Takeoka. 2038-2042 [doi]
- Performance analysis of an asynchronous multi-user communication system for optical networksLuca Venturino, Vinay A. Vaishampayan, Mark D. Feuer, Xiaodong Wang. 2043-2047 [doi]
- Hybrid free-space optical and radio-frequency communications: Outage analysisNick Letzepis, Khoa D. Nguyen, Albert Guillen i Fabregas, William G. Cowley. 2048-2052 [doi]
- Joint scheduling and hybrid ARQ for multi-cell MU-MIMO downlinkHooman Shirani-Mehr, Giuseppe Caire, Haralabos C. Papadopoulos, Sean A. Ramprashad. 2053-2057 [doi]
- Multi-cell MIMO downlink with fairness criteria: The large system limitHoon Huh, Giuseppe Caire, Sung Hyun Moon, Inkyu Lee. 2058-2062 [doi]
- Robust beamforming for multi-cell downlink transmissionAli Tajer, Narayan Prasad, Xiaodong Wang. 2063-2067 [doi]
- Interference mitigation with joint beamforming and common message decoding in multicell systemsHayssam Dahrouj, Wei Yu. 2068-2072 [doi]
- Robust cognitive radio via game theoryJiaheng Wang, Gesualdo Scutari, Daniel Pérez Palomar. 2073-2077 [doi]
- Coexistence through ARQ retransmissions in fading cognitive radio channelsRamy Tannious, Aria Nosratinia. 2078-2082 [doi]
- Fair rate adaptation in multiuser interference channelsAli Tajer, Narayan Prasad, Xiaodong Wang. 2083-2087 [doi]
- Capacity scaling law by multiuser diversity in cognitive radio systemsJun-Pyo Hong, Wan Choi. 2088-2092 [doi]
- New bounds for the sum capacity of binary and nonbinary synchronous CDMA systemsSh. Dashmiz, M. R. Takapoui, Pedram Pad, Farokh Marvasti. 2093-2097 [doi]
- Analysis of large MIMO DS-CDMA systems with imperfect CSI and spatial correlationMikko Vehkaperä, Keigo Takeuchi, Ralf R. Müller, Toshiyuki Tanaka. 2098-2102 [doi]
- Large system analysis of iterative multiuser joint decoding with an uncertain number of usersAdrià Tauste Campo, Albert Guillen i Fabregas. 2103-2107 [doi]
- Regularized blind detection for MIMO communicationsYuejie Chi, Yiyue Wu, A. Robert Calderbank. 2108-2112 [doi]
- Belief propagation based MIMO detection operating on quantized channel outputAmine Mezghani, Josef A. Nossek. 2113-2117 [doi]
- Max-min weighted SIR for MIMO downlink system: Optimality and algorithmsDesmond W. H. Cai, Tony Q. S. Quek, Chee-Wei Tan. 2118-2122 [doi]
- A new robust transmission technique for the multiuser MIMO downlinkGerhard Wunder, Jan Schreck, Peter Jung, Howard Huang, Reinaldo A. Valenzuela. 2123-2127 [doi]
- Large system analysis of projection based algorithms for the MIMO broadcast channelChristian Guthy, Wolfgang Utschick, Michael L. Honig. 2128-2132 [doi]
- Capacity scaling of MIMO broadcast channels with random user distributionIllsoo Sohn, Jeffrey G. Andrews, Kwang Bok Lee. 2133-2137 [doi]
- Joint FEC coding and linear precoding for MIMO ISI channelsChongbin Xu, Xiaojun Yuan, Li Ping, Xiaokang Lin. 2138-2142 [doi]
- X- and Y-Codes for MIMO precodingSaif K. Mohammed, Emanuele Viterbo, Yi Hong, Ananthanarayanan Chockalingam. 2143-2147 [doi]
- Precoding with X-codes to increase capacity with discrete input alphabetsSaif K. Mohammed, Emanuele Viterbo, Yi Hong, Ananthanarayanan Chockalingam. 2148-2152 [doi]
- On the capacity achieving covariance matrix for frequency selective MIMO channels using the asymptotic approachFlorian Dupuy, Philippe Loubaton. 2153-2157 [doi]
- Distributed rotation recovers spatial diversitySheng Yang, Jean-Claude Belfiore. 2158-2162 [doi]
- Diversity of MMSE MIMO receiversAhmed Hesham Mehana, Aria Nosratinia. 2163-2167 [doi]
- Outage diversity of MIMO block-fading channels with causal channel state informationKhoa D. Nguyen, Nick Letzepis, Albert Guillen i Fabregas, Lars K. Rasmussen. 2168-2172 [doi]
- Multiuser switched scheduling systems with per-user threshold and post-user selectionHaewoon Nam, Mohamed-Slim Alouini. 2173-2177 [doi]
- The diversity-multiplexing tradeoff of the symmetric MIMO half-duplex relay channelSanjay Karmakar, Mahesh K. Varanasi. 2178-2182 [doi]
- On the diversity, multiplexing, and array gain tradeoff in MIMO channelsLuis Garcia Ordóñez, Daniel Pérez Palomar, Javier Rodríguez Fonollosa. 2183-2187 [doi]
- The diversity-multiplexing tradeoff of the MIMO Z interference channelSanjay Karmakar, Mahesh K. Varanasi. 2188-2192 [doi]
- Diversity-multiplexing tradeoff in MIMO Gaussian interference channelsHsiao-feng Lu. 2193-2197 [doi]
- Diversity-multiplexing-tradeoff-optimal 2-user scheduling in an M-user Gaussian multiple-access channelManav Garg, Mahesh K. Varanasi. 2198-2202 [doi]
- Fundamental rate-reliability-complexity limits in outage limited MIMO communicationsPetros Elia, Joakim Jalden. 2203-2207 [doi]
- Diversity-multiplexing-delay tradeoffs in MIMO multihop networks with ARQYao Xie, Andrea Goldsmith. 2208-2212 [doi]
- The diversity-multiplexing tradeoff of the symmetric MIMO 2-user interference channelSanjay Karmakar, Mahesh K. Varanasi. 2213-2217 [doi]
- Diversity-multiplexing tradeoff and outage probability in MIMO relay channelsGiyora Levin, S. Loyka. 2218-2222 [doi]
- Distortion outage probability in MIMO block-fading channelsLi Peng, Albert Guillen i Fabregas. 2223-2227 [doi]
- Reduced ML-decoding complexity, full-rate STBCs for 4 transmit antenna systemsK. Pavan Srinath, B. Sundar Rajan. 2228-2232 [doi]
- Training-symbol embedded, high-rate complex orthogonal designs for relay networksJagadeesh Harshan, B. Sundar Rajan, Are Hjørungnes. 2233-2237 [doi]
- Iterative data detection and decoding using list channel estimation and Markov Chain Monte CarloXuehong Mao, Rong-Rong Chen, Behrouz Farhang-Boroujeny. 2238-2242 [doi]
- Modelling the decoder and demapper EXIT chart curves in BICM-ID systems: BEC approximationsWilliam R. Carson, Miguel R. D. Rodrigues, Ian J. Wassell. 2243-2247 [doi]
- Lattice sequential decoder for coded MIMO channel: Performance and complexity analysisWalid Abediseid, Mohamed Oussama Damen. 2248-2252 [doi]
- Near-ML detection based on semi-definite programming for UWB communicationsQi Zhou, Xiaoli Ma, Robert Rice. 2253-2257 [doi]
- Soft-output sphere decoder for multiple-symbol differential detection of impulse-radio ultra-widebandAndreas Schenk, Robert F. H. Fischer. 2258-2262 [doi]
- Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decodingShuiyin Liu, Cong Ling, Damien Stehlé. 2263-2267 [doi]
- Linear beamforming for the spatially correlated MISO broadcast channelVasanthan Raghavan, Venugopal V. Veeravalli, Stephen V. Hanly. 2268-2272 [doi]
- On the degrees of freedom of the compound MISO broadcast channels with finite statesMohammad Ali Maddah-Ali. 2273-2277 [doi]
- Statistical beamformer design for the two-antenna interference channelVasanthan Raghavan, Stephen V. Hanly. 2278-2282 [doi]
- Partial zero-forcing precoding for the interference channel with partially cooperating transmittersSiddarth Hari, Wei Yu. 2283-2287 [doi]
- A simple SINR characterization for linear interference alignment over uncertain MIMO channelsBehrang Nosrat-Makouei, Jeffrey G. Andrews, Robert W. Heath Jr.. 2288-2292 [doi]
- An iterative algorithm for joint signal and interference alignmentK. Raj Kumar, Feng Xue. 2293-2297 [doi]
- Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSIHuang Huang, Vincent K. N. Lau, Yinggang Du, Sheng Liu. 2298-2302 [doi]
- Self-organized spectrum sharing in large MIMO multiple-access channelsRomain Couillet, H. Vincent Poor, Mérouane Debbah. 2303-2307 [doi]
- Up-link multi-user MIMO capacity in low-power regimePasquale Memmolo, Marco Lops, Antonia Maria Tulino, Reinaldo A. Valenzuela. 2308-2312 [doi]
- Multiple-access channel capacity region with incomplete channel state informationAugusto Aubry, Antonia Maria Tulino, Sivarama Venkatesan. 2313-2317 [doi]
- Sum-capacity and the unique separability of the parallel Gaussian MAC-Z-BC networkViveck R. Cadambe, Syed Ali Jafar. 2318-2322 [doi]
- Multicast capacity scaling of wireless networks with multicast outageChun-Hung Liu, Jeffrey G. Andrews. 2323-2327 [doi]
- Achieving the capacity bounds of multicast in large-scale wireless networksKejie Lu, Wang Liu, Jianping Wang, Tao Zhang, Shengli Fu. 2328-2332 [doi]
- Wireless multicasting via iterative optimizationLihua Wan, Jie Luo 0001. 2333-2337 [doi]
- A posterior matching scheme for finite-state channels with feedbackJung Hyun Bae, Achilleas Anastasopoulos. 2338-2342 [doi]
- Finite-rate feedback of input covariance matrices in MIMO systemsRajesh T. Krishnamachari, Mahesh K. Varanasi. 2343-2347 [doi]
- Limited feedback design for MIMO-relay assisted cellular networks with beamformingWei Xu, Xiaodai Dong. 2348-2352 [doi]
- CSI feedback scaling rate vs multiplexing gain tradeoff for DPC-based transmission in the Gaussian MIMO broadcast channelChinmay S. Vaze, Mahesh K. Varanasi. 2353-2357 [doi]
- Minimum energy per bit in wireless networks with correlated informationAnders Høst-Madsen. 2358-2362 [doi]
- Shannon meets Tesla: Wireless information and power transferPulkit Grover, Anant Sahai. 2363-2367 [doi]
- Optimal energy allocation for wireless communications powered by energy harvestersChin Keong Ho, Rui Zhang 0006. 2368-2372 [doi]
- Information-theoretic tradeoffs of throughput and chip power consumption for decoding error-correcting codesPulkit Grover, Hari Palaiyanur, Anant Sahai. 2373-2377 [doi]
- On capacity regions of non-multicast networksTerence Chan, Alex J. Grant. 2378-2382 [doi]
- MCMC methods for entropy optimization and nonlinear network codingSormeh Shadbakht, Babak Hassibi. 2383-2387 [doi]
- On group network codes: Ingleton-bound violations and independent sourcesWei Mao, Matthew Thill, Babak Hassibi. 2388-2392 [doi]
- Capacity for half-duplex line networks with two sourcesTobias Lutz, Gerhard Kramer, Christoph Hausl. 2393-2397 [doi]
- Function computation via subspace codingNikhil Karamchandani, Lorenzo Keller, Christina Fragouli, Massimo Franceschetti. 2398-2402 [doi]
- Systematic network coding for time-division duplexingDaniel Enrique Lucani, Muriel Médard, Milica Stojanovic. 2403-2407 [doi]
- Vector network coding algorithmsB. Javad Ebrahimi, Christina Fragouli. 2408-2412 [doi]
- Coding for linear operator channels over finite fieldsShenghao Yang, Jin Meng, En-Hui Yang. 2413-2417 [doi]
- On network-error correcting convolutional codes under the BSC edge error modelKrishnan Prasad, B. Sundar Rajan. 2418-2422 [doi]
- Polytope codes against adversaries in networksOliver Kosut, Lang Tong, David N. C. Tse. 2423-2427 [doi]
- Universal secure error-correcting schemes for network codingDanilo Silva, Frank R. Kschischang. 2428-2432 [doi]
- Vulnerability of MRD-code-based universal secure network coding against stronger eavesdroppersEitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu. 2433-2437 [doi]
- Unequal error protection rateless coding design for multimedia multicastingYu Cao, Steven D. Blostein, Wai-Yip Chan. 2438-2442 [doi]
- Efficient symbol sorting for high intermediate recovery rate of LT codesAli Talari, Behzad Shahrasbi, Nazanin Rahnavard. 2443-2447 [doi]
- Collecting coded coupons over generationsYao Li, Emina Soljanin, Predrag Spasojevic. 2448-2452 [doi]
- Distributed rateless codes with UEP propertyAli Talari, Nazanin Rahnavard. 2453-2457 [doi]
- Coding packets over reordering channelsDouglas J. Leith, Dinkar Vasudevan. 2458-2462 [doi]
- A Smart approach for GPT cryptosystem based on rank codesHaitham Rashwan, Ernst M. Gabidulin, Bahram Honary. 2463-2467 [doi]
- Cryptanalysis of a fast encryption scheme for databasesStéphane Jacob. 2468-2472 [doi]
- Primitive polynomials for robust scramblers and stream ciphers against reverse engineeringXin-Wen Wu, Soo Ngee Koh, Chee Cheon Chui. 2473-2477 [doi]
- Differential properties of power functionsCéline Blondeau, Anne Canteaut, Pascale Charpin. 2478-2482 [doi]
- A simple secret sharing scheme using a key and its security against substitution of sharesHiroki Koga. 2483-2487 [doi]
- A zero-sum property for the KECCAK-f permutation with 18 roundsChristina Boura, Anne Canteaut. 2488-2492 [doi]
- Algebraic attack on the Alternating Step(r, s) GeneratorMehdi M. Hassanzadeh, Tor Helleseth. 2493-2497 [doi]
- NLHB: A non-linear Hopper-Blum protocolMukundan Madhavan, Andrew Thangaraj, Y. Sankarasubramanian, Kapali Viswanathan. 2498-2502 [doi]
- Secure communication over fading channels with statistical QoS constraintsDeli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar. 2503-2507 [doi]
- Active eavesdropping in fast fading channels: A Block-Markov Wyner secrecy encoding schemeGeorge T. Amariucai, Shuangqing Wei. 2508-2512 [doi]
- A new jamming technique for secrecy in multi-antenna wireless networksOmar Bakr, Raghuraman Mudumbai. 2513-2517 [doi]
- Impact of channel sparsity and correlated eavesdropping on secret key generation from multipath channel randomnessTzu-Han Chou, Stark C. Draper, Akbar M. Sayeed. 2518-2522 [doi]
- Using coding techniques to analyze weak feedback polynomialsMartin Hell. 2523-2527 [doi]
- Two-level fingerprinting: Stronger definitions and code constructionsN. Prasanth Anthapadmanabhan, Alexander Barg. 2528-2532 [doi]
- Security embedding codesHung D. Ly, Tie Liu, Yufei W. Blankenship. 2533-2537 [doi]
- Construction of wiretap codes from ordinary channel codesMasahito Hayashi, Ryutaroh Matsumoto. 2538-2542 [doi]
- On secure distributed data storage under repair dynamicsSameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran. 2543-2547 [doi]
- Wiretap channel with causal state informationYeow-Khiang Chia, Abbas El Gamal. 2548-2552 [doi]
- Secrecy capacity of the degraded Poisson wiretap channelAmine Laourine, Aaron B. Wagner. 2553-2557 [doi]
- Security of concatenated encoders for wiretap channelsMitsuru Hamada. 2558-2562 [doi]
- On the secrecy degress of freedom of the multi-antenna block fading wiretap channelsMari Kobayashi, Pablo Piantanida, Sheng Yang, Shlomo Shamai. 2563-2567 [doi]
- The capacity-equivocation region of the MIMO Gaussian wiretap channelRuoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai. 2568-2572 [doi]
- On cooperative secrecy for discrete memoryless relay networksEtienne Perron, Suhas N. Diggavi, Emre Telatar. 2573-2577 [doi]
- MIMO Gaussian broadcast channels with confidential and common messagesRuoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai. 2578-2582 [doi]
- Gaussian MIMO broadcast channels with common and confidential messagesErsen Ekrem, Sennur Ulukus. 2583-2587 [doi]
- On the secure DoF of the single-antenna MACGhadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani. 2588-2592 [doi]
- Capacity of a shared secret keyImre Csiszár, Prakash Narayan. 2593-2596 [doi]
- Secret key agreement from vector Gaussian sources by rate limited public communicationShun Watanabe, Yasutada Oohama. 2597-2601 [doi]
- Assisted common informationVinod M. Prabhakaran, Manoj Prabhakaran. 2602-2606 [doi]
- Channel intrinsic randomnessMatthieu Bloch. 2607-2611 [doi]
- Secure computingHimanshu Tyagi, Prakash Narayan, Piyush Gupta. 2612-2616 [doi]
- On unconditionally secure oblivious transfer from continuous channelsMotohiko Isaka. 2617-2621 [doi]
- Perfect secrecy and combinatorial tree packingSirin Nitinawarat, Prakash Narayan. 2622-2626 [doi]
- Modeling location uncertainty for eavesdroppers: A secrecy graph approachSatashu Goel, Vaneet Aggarwal, Aylin Yener, A. Robert Calderbank. 2627-2631 [doi]
- The role of game theory in key agreement over a public channelNebojsa Milosavljevic, Michael Gastpar, Kannan Ramchandran. 2632-2636 [doi]
- Secrecy games over the cognitive channelElizabeth Toher, Onur Ozan Koyluoglu, Hesham El Gamal. 2637-2641 [doi]
- A theory of utility and privacy of data sourcesLalitha Sankar, S. Raj Rajagopalan, H. Vincent Poor. 2642-2646 [doi]
- Coding theorems for biometric systemsManabu Koide, Hirosuke Yamamoto. 2647-2651 [doi]
- Performance analysis of identification system based on order statistics list decoderFarzad Farhadzadeh, Sviatoslav Voloshynovskiy, Oleksiy J. Koval. 2652-2656 [doi]
- Convolutional entanglement distillationMark M. Wilde, Hari Krovi, Todd A. Brun. 2657-2661 [doi]
- Clustered bounded-distance decoding of codeword-stabilized quantum codesYunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko. 2662-2666 [doi]
- Clifford subsystem codesAndreas Klappenecker. 2667-2671 [doi]
- Multi-error-correcting amplitude damping codesRunyao Duan, Markus Grassl, Z. Ji, Bei Zeng. 2672-2676 [doi]
- Secure key rate of the BB84 protocol using finite sample bitsY. Sano, Ryutaroh Matsumoto, Tomohiko Uyematsu. 2677-2681 [doi]
- Quantum distinguisher between the 3-round Feistel cipher and the random permutationHidenori Kuwakado, Masakatu Morii. 2682-2685 [doi]
- Perfect quantum network communication protocol based on classical network codingHirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler. 2686-2690 [doi]
- New classes of topological quantum codes derived from embeddings of graphs on compact surfacesClarice Dias de Albuquerque, Reginaldo Palazzo Jr., Eduardo Brandani da Silva. 2691-2694 [doi]
- Super-duper-activation of the zero-error quantum capacityJianxin Chen, Toby S. Cubitt, Aram Wettroth Harrow, Graeme Smith. 2695-2697 [doi]
- Equality conditions for the quantum f-relative entropy and generalized data processing inequalitiesNaresh Sharma. 2698-2702 [doi]
- Leftover Hashing against quantum side informationMarco Tomamichel, Renato Renner, Christian Schaffner, Adam Smith. 2703-2707 [doi]
- An algebraic approach to information theoryManas K. Patra, Samuel L. Braunstein. 2708-2712 [doi]
- Entanglement generation with a quantum channel and a shared stateMark M. Wilde, Min-Hsiu Hsieh. 2713-2717 [doi]
- Entanglement transmission over arbitrarily varying quantum channelsRudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel. 2718-2722 [doi]