Table of Contents

• Additive codes over Z2× Z4Joaquim Borges, Cristina Fernández-Córdoba, Steven T. Dougherty. 1-3 [doi]
• Valiant transform of forney graphsAli Al-Bashabsheh, Yongyi Mao. 1-5 [doi]
• Quasi-cyclic asymptotically regular LDPC codesDavid G. M. Mitchell, Roxana Smarandache, Michael Lentmaier, Daniel J. Costello Jr.. 1-5 [doi]
• The projective Kerdock codeMaria Nastasescu, A. Robert Calderbank. 1-5 [doi]
• Boolean functions whose restrictions are highly nonlinearConstanza Riera, Matthew G. Parker. 1-5 [doi]
• The benefits from simultaneous transmission and reception in wireless networksP. C. Weeraddana, Marian Codreanu, Matti Latva-aho, Anthony Ephremides. 1-5 [doi]
• Achievable rate regions for Dirty Tape Channels and "joint writing on Dirty paper and Dirty Tape"Reza Khosravi-Farsani, Bahareh Akhbari, Mohammad Reza Aref. 1-5 [doi]
• On secure network coding with unequal link capacities and restricted wiretapping setsTao Cui, Tracey Ho, Jörg Kliewer. 1-5 [doi]
• Recent results on bent and hyper-bent functions and their link with some exponential sumsSihem Mesnager. 1-5 [doi]
• Abelian varieties in coding and cryptographyIan F. Blake. 1-5 [doi]
• Gaussian diamond network with adversarial jammerSoheil Mohajer, Suhas N. Diggavi. 1-5 [doi]
• Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?Hugues Randriam. 1-5 [doi]
• Cooperative strategies for relay-aided multi-cell wireless networks with backhaulJinfeng Du, Ming Xiao, Mikael Skoglund. 1-5 [doi]
• Dense error-correcting codes in the Lee metricTuvi Etzion, Alexander Vardy, Eitan Yaakobi. 1-5 [doi]
• Source coding with common reconstruction and action-dependent side informationKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 1-5 [doi]
• Robust parent-identifying codesAlexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier. 1-4 [doi]
• A new full-diversity criterion and low-complexity STBCs with Partial Interference Cancellation decodingLakshmi Prasad Natarajan, B. Sundar Rajan. 1-5 [doi]
• Wiretap channel with shared keyWei Kang 0002, Nan Liu. 1-5 [doi]
• Capacity regions for some classes of Causal Cognitive Interference Channels with delayMahtab Mirmohseni, Bahareh Akhbari, Mohammad Reza Aref. 1-5 [doi]
• Computation of the robust symmetrical number system dynamic rangeBrian L. Luke, Phillip E. Pace. 1-5 [doi]
• Bit-interleaved coded modulation with shapingAlbert Guillén i Fàbregas, Alfonso Martinez. 1-5 [doi]
• How to achieve the optimal DMT of selective fading MIMO channels?Lina Mroueh, Jean-Claude Belfiore. 1-5 [doi]
• On speed of channel polarizationToshiyuki Tanaka. 1-5 [doi]
• On the delay advantage of coding in packet erasure networksTheodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros. 1-5 [doi]
• Information-theoretical analysis of private content identificationSvyatoslav Voloshynovskiy, Oleksiy J. Koval, Fokko Beekhof, Farzad Farhadzadeh, Taras Holotyak. 1-5 [doi]
• Coupled graphical models and their thresholdsS. Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke. 1-5 [doi]
• On the parallel programming of flash memory cellsEitan Yaakobi, Anxiao Jiang, Paul H. Siegel, Alexander Vardy, Jack K. Wolf. 1-5 [doi]
• Fireworks: A random linear coding scheme for distributed storage in wireless sensor networksDejan Vukobratovic, Cedomir Stefanovic, Vladimir Stankovic 0001. 1-5 [doi]
• Coding against myopic adversariesAnand D. Sarwate. 1-5 [doi]
• Applications of semidefinite programming to coding theoryChristine Bachoc. 1-5 [doi]
• A multi-hop multi-source Algebraic WatchdogMinji Kim, Muriel Médard, João Barros. 1-5 [doi]
• Universal a posteriori metrics gameEmmanuel Abbe, Rethnakaran Pulikkoonattu. 1-5 [doi]
• Universal portfolio algorithms in realistic-outcome marketsAmi Tavory, Meir Feder. 1-5 [doi]
• Error exponents in multiple hypothesis testing for arbitrarily varying sourcesNaira M. Grigoryan, Ashot N. Harutyunyan. 1-5 [doi]
• A graphical model for computing the minimum cost transposition distanceFarzad Farnoud, Chien-Yu Chen 0005, Olgica Milenkovic, Navin Kashyap. 1-5 [doi]
• Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic planeNicolas Delfosse, Gilles Zémor. 1-5 [doi]
• Quantum channel capacitiesGraeme Smith. 1-5 [doi]
• A renormalization group decoding algorithm for topological quantum codesGuillaume Duclos-Cianci, David Poulin. 1-5 [doi]
• Information-theoretic performance analysis of LMS MIMO communicationsGiuseppa Alfano, Antonio De Maio, Antonia Maria Tulino. 1-5 [doi]
• Outer bounds for the interference channel with a cognitive relayStefano Rini, Daniela Tuninetti, Natasha Devroye. 1-5 [doi]
• Sum capacity of K user Gaussian degraded interference channelsJubin Jose, Sriram Vishwanath. 1-5 [doi]
• On the capacity region of the degraded Z channelSadaf Salehkalaibar, Mohammad Reza Aref. 1-5 [doi]
• The capacity region of the interference channel with a relay in the strong interference regime subject to phase fadingRon Dabora. 1-5 [doi]
• The enumeration of Costas arrays of order 28Konstantinos Drakakis, Francesco Iorio, Scott Rickard. 1-5 [doi]
• Irregular repeat-accumulate-like codes with improved error floor performanceDavid F. Hayes, Sarah J. Johnson, Steven R. Weller. 1-5 [doi]
• Polar coding for reliable communications over parallel channelsEran Hof, Igal Sason, Shlomo Shamai. 1-5 [doi]
• Orbit codes - A new concept in the area of network codingAnna-Lena Trautmann, Felice Manganiello, Joachim Rosenthal. 1-4 [doi]
• Fading channels with 1-bit output quantization: Optimal modulation, ergodic capacity and outage probabilityStefan Krone, Gerhard P. Fettweis. 1-5 [doi]
• Constrained codes for phase-change memoriesAnxiao Jiang, Jehoshua Bruck, Hao Li. 1-5 [doi]
• Every channel with time structure has a capacity sequenceRudolf Ahlswede. 1 [doi]
• On optimum communication cost for joint compression and dispersive information routingKumar Viswanatha, Emrah Akyol, Kenneth Rose. 1-5 [doi]
• Stopping sets for physical-layer securityWillie K. Harrison, João Almeida, Demijan Klinc, Steven W. McLaughlin, João Barros. 1-5 [doi]
• The confidence interval of entropy estimation through a noisy channelSiu-Wai Ho, Terence Chan, Alex J. Grant. 1-5 [doi]
• Coding for the Z channel with a digital relay linkHieu T. Do, Tobias J. Oechtering, Mikael Skoglund. 1-5 [doi]
• Generalized Frobenius extensions of finite rings and trace functionsMarcus Greferath, Alexandr Nechaev. 1-5 [doi]
• Local computation in codesTali Kaufman. 1-5 [doi]
• Lossy source compression of non-uniform binary sources using GQ-LDGM codesLorenzo Cappellari. 1-5 [doi]
• Efficient two-write WOM-codesEitan Yaakobi, Scott Kayser, Paul H. Siegel, Alexander Vardy, Jack K. Wolf. 1-5 [doi]
• On the secure outage performance for wireless multicasting through slow fading channelsMd. Zahurul I. Sarkar, Tharmalingam Ratnarajah. 1-5 [doi]
• Non-systematic codes for physical layer securityMarco Baldi, Marco Bianchi 0002, Franco Chiaraluce. 1-5 [doi]
• On conditions for linearity of optimal estimationEmrah Akyol, Kumar Viswanatha, Kenneth Rose. 1-5 [doi]
• Low-complexity wire-tap codes with security and error-correction guaranteesYuval Cassuto, Zvonimir Bandic. 1-5 [doi]
• Topological color codes over higher alphabetPradeep Sarvepalli. 1-5 [doi]
• Multi-source operator channels: Efficient capacity-achieving codesHongyi Yao, Theodoros K. Dikaliotis, Sidharth Jaggi, Tracey Ho. 1-5 [doi]
• Rotate-and-add coding: A novel algebraic network coding schemeAlireza Keshavarz-Haddad, Mohammad Amir Khojastepour. 1-5 [doi]
• An achievable rate for the MIMO individual channelYuval Lomnitz, Meir Feder. 1-5 [doi]
• On the degree of the inverse of quadratic permutation polynomial interleaversEeva Suvitie, Jyrki Lahtonen. 1-5 [doi]
• Approximate capacity of a class of multi-source Gaussian relay networksSang-Woon Jeon, Sae-Young Chung, Syed Ali Jafar. 1-5 [doi]
• Secure type-based multiple access: Transmission strategy and analysis for perfect secrecyHyoungsuk Jeon, Daesung Hwang, Hyuckjae Lee, Jeongseok Ha, Jinho Choi 0001. 1-5 [doi]
• Multiple Access Wiretap channels with strong secrecyMohammad Hossein Yassaee, Mohammad Reza Aref. 1-5 [doi]
• Coding solutions for the secure biometric storage problemDavide Schipani, Joachim Rosenthal. 1-4 [doi]
• On the deterministic multicast capacity of bidirectional relay networksM. Mokhtar, Yahya Mohasseb, Mohammed Nafie, Hesham El Gamal. 1-5 [doi]
• Cooperative ARQs with opportunistic distributed space-time coding: Effective protocols and performance analysisHsin-Li Chiu, Sau-Hsuan Wu, Jin-Hao Li. 1-5 [doi]
• Characterization of graph-cover pseudocodewords of codes over F3Vitaly Skachek. 1-5 [doi]
• Group permutable constant weight codesOscar Moreno, José R. Ortiz-Ubarri. 1-5 [doi]
• Strong secrecy for erasure wiretap channelsAnanda Theertha Suresh, Arunkumar Subramanian, Andrew Thangaraj, Matthieu Bloch, Steven W. McLaughlin. 1-5 [doi]
• An algebraic view to gradient descent decodingMijail Borges-Quintana, Miguel Angel Borges-Trenard, Irene Márquez Corbella, Edgar Martínez-Moro. 1-4 [doi]
• The collection channel in a Wireless Sensor NetworkBryan Larish, George F. Riley. 1-5 [doi]
• Information sets for abelian codesJosé Joaquín Bernal, Juan Jacobo Simón. 1-5 [doi]
• Universal source polarization and sparse recoveryEmmanuel Abbe. 1-5 [doi]
• Non-binary polar codes using Reed-Solomon codes and algebraic geometry codesRyuhei Mori, Toshiyuki Tanaka. 1-5 [doi]
• Identification codes in cryptographic protocolsJulien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji. 1-5 [doi]
• On thresholds for robust goodness-of-fit testsJayakrishnan Unnikrishnan, Sean P. Meyn, Venugopal V. Veeravalli. 1-4 [doi]
• Stabilizer subsystem codes with spatially local generatorsSergey Bravyi. 1-5 [doi]
• Properties of optimal prefix-free machines as instantaneous codesKohtaro Tadaki. 1-5 [doi]
• Tail-biting products trellises, the BCJR-construction and their dualsHeide Gluesing-Luerssen, Elizabeth A. Weaver. 1-5 [doi]
• Network-level cooperative protocols for wireless multicasting: Stable throughput analysis and use of network codingAnthony Fanous, Anthony Ephremides. 1-5 [doi]
• Capacity of a noisy functionFrançois Simon. 1-5 [doi]
• Reduced-state decoding in two-way relay networks with physical-layer network codingDuc To, Jinho Choi 0001. 1-5 [doi]
• Structured LDPC codes from permutation matrices free of small trapping setsDung Viet Nguyen, Bane Vasic, Michael W. Marcellin, Shashi Kiran Chilappagari. 1-5 [doi]
• Throughput and latency of acyclic erasure networks with feedback in a finite buffer regimeNima Torabkhani, Badri N. Vellambi, Faramarz Fekri. 1-5 [doi]
• Unimodular lattices for the Gaussian Wiretap ChannelJean-Claude Belfiore, Patrick Solé. 1-5 [doi]
• On LP decoding of polar codesNaveen Goela, Satish Babu Korada, Michael Gastpar. 1-5 [doi]
• Coding for the MIMO ARQ block-fading channel with imperfect feedback and CSIRA. Taufiq Asyhari, Albert Guillén i Fàbregas. 1-5 [doi]
• Exact PWM representation of bandlimited signalsJing Huang, Krishnan Padmanabhan, Oliver M. Collins. 1-5 [doi]
• Codes from graphs related to the categorical product of triangular graphs and KnKhumbo Kumwenda, Eric C. Mwambene. 1-5 [doi]
• Secrecy-achieving polar-codingEran Hof, Shlomo Shamai. 1-5 [doi]
• Improved linear programming decoding and bounds on the minimum distance of LDPC codesDavid Burshtein, Idan Goldenberg. 1-5 [doi]
• On achievable rates for classes of non-linear deterministic interference channelsAmin Jafarian, Sriram Vishwanath. 1-5 [doi]
• An extension of Massey scheme for secret sharingRomar dela Cruz, Annika Meyer, Patrick Solé. 1-5 [doi]
• The Euclidean algorithm for Generalized Minimum Distance decoding of Reed-Solomon codesSabine Kampf, Martin Bossert. 1-5 [doi]
• On encoders for quantum convolutional codesMarkus Grassl, Martin Rötteler. 1-5 [doi]