default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW 2010: Dublin, Ireland
- Marcus Greferath, Joachim Rosenthal, Alexander Barg, Gilles Zémor:
2010 IEEE Information Theory Workshop, ITW 2010, Dublin, Ireland, August 30 - September 3, 2010. IEEE 2010, ISBN 978-1-4244-8264-1 - Christine Bachoc:
Applications of semidefinite programming to coding theory. 1-5 - Ian F. Blake:
Abelian varieties in coding and cryptography. 1-5 - Tali Kaufman:
Local computation in codes. 1-5 - Jean-Claude Belfiore, Patrick Solé:
Unimodular lattices for the Gaussian Wiretap Channel. 1-5 - Konstantinos Drakakis, Francesco Iorio, Scott Rickard:
The enumeration of Costas arrays of order 28. 1-5 - Marcus Greferath, Alexandr Nechaev:
Generalized Frobenius extensions of finite rings and trace functions. 1-5 - Alexander Barg, G. Robert Blakley, Grigory Kabatiansky, Cédric Tavernier:
Robust parent-identifying codes. 1-4 - Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
Identification codes in cryptographic protocols. 1-5 - Sihem Mesnager:
Recent results on bent and hyper-bent functions and their link with some exponential sums. 1-5 - Hugues Randriam:
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound? 1-5 - Constanza Riera, Matthew Geoffrey Parker:
Boolean functions whose restrictions are highly nonlinear. 1-5 - Davide Schipani, Joachim Rosenthal
:
Coding solutions for the secure biometric storage problem. 1-4 - Rudolf Ahlswede:
Every channel with time structure has a capacity sequence. 1 - Minji Kim, Muriel Médard, João Barros:
A multi-hop multi-source Algebraic Watchdog. 1-5 - Anand D. Sarwate:
Coding against myopic adversaries. 1-5 - David Burshtein, Idan Goldenberg:
Improved linear programming decoding and bounds on the minimum distance of LDPC codes. 1-5 - Farzad Farnoud, Chien-Yu Chen, Olgica Milenkovic, Navin Kashyap:
A graphical model for computing the minimum cost transposition distance. 1-5 - S. Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke:
Coupled graphical models and their thresholds. 1-5 - Vitaly Skachek:
Characterization of graph-cover pseudocodewords of codes over F3. 1-5 - Emmanuel Abbe:
Universal source polarization and sparse recovery. 1-5 - Eran Hof, Shlomo Shamai:
Secrecy-achieving polar-coding. 1-5 - Toshiyuki Tanaka:
On speed of channel polarization. 1-5 - Sergey Bravyi:
Stabilizer subsystem codes with spatially local generators. 1-5 - Nicolas Delfosse, Gilles Zémor:
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane. 1-5 - Guillaume Duclos-Cianci, David Poulin:
A renormalization group decoding algorithm for topological quantum codes. 1-5 - Markus Grassl, Martin Rötteler:
On encoders for quantum convolutional codes. 1-5 - Pradeep Kiran Sarvepalli:
Topological color codes over higher alphabet. 1-5 - Graeme Smith:
Quantum channel capacities. 1-5 - Emmanuel Abbe, Rethnakaran Pulikkoonattu:
Universal a posteriori metrics game. 1-5 - Emrah Akyol, Kumar Viswanatha, Kenneth Rose:
On conditions for linearity of optimal estimation. 1-5 - Ali Al-Bashabsheh, Yongyi Mao:
Valiant transform of forney graphs. 1-5 - Giuseppa Alfano, Antonio De Maio, Antonia M. Tulino:
Information-theoretic performance analysis of LMS MIMO communications. 1-5 - A. Taufiq Asyhari, Albert Guillén i Fàbregas:
Coding for the MIMO ARQ block-fading channel with imperfect feedback and CSIR. 1-5 - Marco Baldi, Marco Bianchi, Franco Chiaraluce:
Non-systematic codes for physical layer security. 1-5 - José Joaquín Bernal, Juan Jacobo Simón:
Information sets for abelian codes. 1-5 - Joaquim Borges, Cristina Fernández-Córdoba, Steven T. Dougherty:
Additive codes over Z2× Z4. 1-3 - Mijail Borges-Quintana, Miguel Angel Borges-Trenard, Irene Márquez-Corbella, Edgar Martínez-Moro:
An algebraic view to gradient descent decoding. 1-4 - Lorenzo Cappellari:
Lossy source compression of non-uniform binary sources using GQ-LDGM codes. 1-5 - Yuval Cassuto, Zvonimir Bandic:
Low-complexity wire-tap codes with security and error-correction guarantees. 1-5 - Hsin-Li Chiu, Sau-Hsuan Wu, Jin-Hao Li:
Cooperative ARQs with opportunistic distributed space-time coding: Effective protocols and performance analysis. 1-5 - Tao Cui, Tracey Ho, Jörg Kliewer:
On secure network coding with unequal link capacities and restricted wiretapping sets. 1-5 - Ron Dabora:
The capacity region of the interference channel with a relay in the strong interference regime subject to phase fading. 1-5 - Romar dela Cruz, Annika Meyer, Patrick Solé:
An extension of Massey scheme for secret sharing. 1-5 - Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the delay advantage of coding in packet erasure networks. 1-5 - Hieu T. Do, Tobias J. Oechtering, Mikael Skoglund:
Coding for the Z channel with a digital relay link. 1-5 - Jinfeng Du, Ming Xiao, Mikael Skoglund:
Cooperative strategies for relay-aided multi-cell wireless networks with backhaul. 1-5 - Tuvi Etzion, Alexander Vardy, Eitan Yaakobi:
Dense error-correcting codes in the Lee metric. 1-5 - Anthony Fanous, Anthony Ephremides:
Network-level cooperative protocols for wireless multicasting: Stable throughput analysis and use of network coding. 1-5 - Heide Gluesing-Luerssen, Elizabeth A. Weaver:
Tail-biting products trellises, the BCJR-construction and their duals. 1-5 - Naveen Goela, Satish Babu Korada, Michael Gastpar:
On LP decoding of polar codes. 1-5 - Naira M. Grigoryan, Ashot N. Harutyunyan:
Error exponents in multiple hypothesis testing for arbitrarily varying sources. 1-5 - Albert Guillén i Fàbregas, Alfonso Martinez:
Bit-interleaved coded modulation with shaping. 1-5 - Willie K. Harrison, João Almeida, Demijan Klinc, Steven W. McLaughlin, João Barros:
Stopping sets for physical-layer security. 1-5 - David F. Hayes, Sarah J. Johnson, Steven R. Weller:
Irregular repeat-accumulate-like codes with improved error floor performance. 1-5 - Siu-Wai Ho, Terence Chan, Alex J. Grant:
The confidence interval of entropy estimation through a noisy channel. 1-5 - Eran Hof, Igal Sason, Shlomo Shamai:
Polar coding for reliable communications over parallel channels. 1-5 - Jing Huang, Krishnan Padmanabhan, Oliver M. Collins:
Exact PWM representation of bandlimited signals. 1-5 - Amin Jafarian, Sriram Vishwanath:
On achievable rates for classes of non-linear deterministic interference channels. 1-5 - Hyoungsuk Jeon, Daesung Hwang, Hyuckjae Lee, Jeongseok Ha, Jinho Choi:
Secure type-based multiple access: Transmission strategy and analysis for perfect secrecy. 1-5 - Sang-Woon Jeon, Sae-Young Chung, Syed Ali Jafar:
Approximate capacity of a class of multi-source Gaussian relay networks. 1-5 - Anxiao Jiang, Jehoshua Bruck, Hao Li:
Constrained codes for phase-change memories. 1-5 - Jubin Jose, Sriram Vishwanath:
Sum capacity of K user Gaussian degraded interference channels. 1-5 - Sabine Kampf, Martin Bossert:
The Euclidean algorithm for Generalized Minimum Distance decoding of Reed-Solomon codes. 1-5 - Wei Kang, Nan Liu:
Wiretap channel with shared key. 1-5 - Alireza Keshavarz-Haddad, Mohammad Amir Khojastepour:
Rotate-and-add coding: A novel algebraic network coding scheme. 1-5 - Reza Khosravi-Farsani, Bahareh Akhbari, Mohammad Reza Aref:
Achievable rate regions for Dirty Tape Channels and "joint writing on Dirty paper and Dirty Tape". 1-5 - Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund:
Source coding with common reconstruction and action-dependent side information. 1-5 - Stefan Krone, Gerhard P. Fettweis:
Fading channels with 1-bit output quantization: Optimal modulation, ergodic capacity and outage probability. 1-5 - Khumbo Kumwenda, Eric C. Mwambene:
Codes from graphs related to the categorical product of triangular graphs and Kn. 1-5 - Bryan Larish, George F. Riley:
The collection channel in a Wireless Sensor Network. 1-5 - Yuval Lomnitz, Meir Feder:
An achievable rate for the MIMO individual channel. 1-5 - Brian L. Luke, Phillip E. Pace:
Computation of the robust symmetrical number system dynamic range. 1-5 - Mahtab Mirmohseni, Bahareh Akhbari, Mohammad Reza Aref:
Capacity regions for some classes of Causal Cognitive Interference Channels with delay. 1-5 - David G. M. Mitchell, Roxana Smarandache, Michael Lentmaier, Daniel J. Costello Jr.:
Quasi-cyclic asymptotically regular LDPC codes. 1-5 - Soheil Mohajer, Suhas N. Diggavi:
Gaussian diamond network with adversarial jammer. 1-5 - M. Mokhtar, Yahya Mohasseb, Mohammed Nafie, Hesham El Gamal:
On the deterministic multicast capacity of bidirectional relay networks. 1-5 - Oscar Moreno, José R. Ortiz-Ubarri:
Group permutable constant weight codes. 1-5 - Ryuhei Mori, Toshiyuki Tanaka:
Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes. 1-5 - Lina Mroueh, Jean-Claude Belfiore:
How to achieve the optimal DMT of selective fading MIMO channels? 1-5 - Maria Nastasescu, A. Robert Calderbank:
The projective Kerdock code. 1-5 - Lakshmi Prasad Natarajan, B. Sundar Rajan:
A new full-diversity criterion and low-complexity STBCs with Partial Interference Cancellation decoding. 1-5 - Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin, Shashi Kiran Chilappagari:
Structured LDPC codes from permutation matrices free of small trapping sets. 1-5 - Stefano Rini, Daniela Tuninetti, Natasha Devroye:
Outer bounds for the interference channel with a cognitive relay. 1-5 - Sadaf Salehkalaibar, Mohammad Reza Aref:
On the capacity region of the degraded Z channel. 1-5 - Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah:
On the secure outage performance for wireless multicasting through slow fading channels. 1-5 - François Simon:
Capacity of a noisy function. 1-5 - Ananda Theertha Suresh, Arunkumar Subramanian, Andrew Thangaraj, Matthieu R. Bloch, Steven W. McLaughlin:
Strong secrecy for erasure wiretap channels. 1-5 - Eeva Suvitie, Jyrki T. Lahtonen:
On the degree of the inverse of quadratic permutation polynomial interleavers. 1-5 - Kohtaro Tadaki:
Properties of optimal prefix-free machines as instantaneous codes. 1-5 - Ami Tavory, Meir Feder:
Universal portfolio algorithms in realistic-outcome markets. 1-5 - Duc To, Jinho Choi:
Reduced-state decoding in two-way relay networks with physical-layer network coding. 1-5 - Nima Torabkhani, Badri N. Vellambi, Faramarz Fekri:
Throughput and latency of acyclic erasure networks with feedback in a finite buffer regime. 1-5 - Anna-Lena Trautmann, Felice Manganiello, Joachim Rosenthal:
Orbit codes - A new concept in the area of network coding. 1-4 - Jayakrishnan Unnikrishnan, Sean P. Meyn, Venugopal V. Veeravalli:
On thresholds for robust goodness-of-fit tests. 1-4 - Kumar Viswanatha, Emrah Akyol, Kenneth Rose:
On optimum communication cost for joint compression and dispersive information routing. 1-5 - Svyatoslav Voloshynovskiy, Oleksiy J. Koval, Fokko Beekhof, Farzad Farhadzadeh, Taras Holotyak:
Information-theoretical analysis of private content identification. 1-5 - Dejan Vukobratovic, Cedomir Stefanovic, Vladimir Stankovic:
Fireworks: A random linear coding scheme for distributed storage in wireless sensor networks. 1-5 - P. C. Weeraddana, Marian Codreanu, Matti Latva-aho, Anthony Ephremides:
The benefits from simultaneous transmission and reception in wireless networks. 1-5 - Eitan Yaakobi, Anxiao Jiang, Paul H. Siegel, Alexander Vardy, Jack K. Wolf:
On the parallel programming of flash memory cells. 1-5 - Eitan Yaakobi, Scott Kayser, Paul H. Siegel, Alexander Vardy, Jack K. Wolf:
Efficient two-write WOM-codes. 1-5 - Hongyi Yao, Theodoros K. Dikaliotis, Sidharth Jaggi, Tracey Ho:
Multi-source operator channels: Efficient capacity-achieving codes. 1-5 - Mohammad Hossein Yassaee, Mohammad Reza Aref:
Multiple Access Wiretap channels with strong secrecy. 1-5
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-31 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
