Eirik Rosnes

Antonia Wachter-Zeh

CoRR, 2024

An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads.

[BibT_eX]

[DOI]

CoRR, 2024

Weakly-Private Information Retrieval From MDS-Coded Distributed Storage.

[BibT_eX]

[DOI]

Asbjørn O. Orvedal

CoRR, 2024

Improved Capacity Outer Bound for Private Quadratic Monomial Computation.

[BibT_eX]

[DOI]

CoRR, 2024

Generalizing Quantum Tanner Codes.

[BibT_eX]

[DOI]

Olai Å. Mostad

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learning.

[BibT_eX]

[DOI]

IEEE Trans. Commun., April, 2023

Concatenated Codes for Multiple Reads of a DNA Sequence.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

DSAG: A Mixed Synchronous-Asynchronous Iterative Method for Straggler-Resilient Learning.

[BibT_eX]

[DOI]

Salim El Rouayheb

IEEE Trans. Commun., February, 2023

Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel.

[BibT_eX]

[DOI]

Issam Maarouf

Proceedings of the IEEE Information Theory Workshop, 2023

Finite Blocklength Performance Bound for the DNA Storage Channel.

[BibT_eX]

[DOI]

Issam Maarouf

Gianluigi Liva

Proceedings of the 12th International Symposium on Topics in Coding, 2023

Differentially-Private Collaborative Online Personalized Mean Estimation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Single-Server Pliable Private Information Retrieval With Side Information.

[BibT_eX]

[DOI]

Sarah A. Obead

Proceedings of the IEEE International Symposium on Information Theory, 2023

Efficient Interpolation-Based Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Wrya K. Kadir

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Multi-Server Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Eitan Yaakobi

IEEE Trans. Inf. Theory, 2022

Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2022

Private Polynomial Function Computation for Noncolluding Coded Databases.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2022

Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

Privacy-Preserving Coded Mobile Edge Computing for Low-Latency Distributed Inference.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

Private Linear Computation for Noncolluding Coded Databases.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

Computational Code-Based Privacy in Coded Federated Learning.

[BibT_eX]

[DOI]

Marvin Xhemrishi

Antonia Wachter-Zeh

Proceedings of the IEEE International Symposium on Information Theory, 2022

Coding for Straggler Mitigation in Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

Straggler-Resilient Secure Aggregation for Federated Learning.

[BibT_eX]

[DOI]

Proceedings of the 30th European Signal Processing Conference, 2022

2021

Dynamic Coded Caching in Wireless Networks.

[BibT_eX]

[DOI]

Jesper Pedersen

IEEE Trans. Commun., 2021

The Capacity of Single-Server Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Eitan Yaakobi

IEEE J. Sel. Areas Inf. Theory, 2021

Rateless Codes for Low-Latency Distributed Inference in Mobile Edge Computing.

[BibT_eX]

[DOI]

Anton Frigård

CoRR, 2021

Dynamic Coded Caching in Wireless Networks Using Multi-Agent Reinforcement Learning.

[BibT_eX]

[DOI]

Jesper Pedersen

Fredrik Brännström

CoRR, 2021

Low-Latency Distributed Inference at the Network Edge Using Rateless Codes (Invited Paper).

[BibT_eX]

[DOI]

Anton Frigård

Proceedings of the 17th International Symposium on Wireless Communication Systems, 2021

2020

Failure Analysis of the Interval-Passing Algorithm for Compressed Sensing.

[BibT_eX]

[DOI]

Yauhen Yakimenka

IEEE Trans. Inf. Theory, 2020

Adaptive Linear Programming Decoding of Nonbinary Linear Codes Over Prime Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Private Function Computation for Noncolluding Coded Databases.

[BibT_eX]

[DOI]

CoRR, 2020

On the Capacity of Private Monomial Computation.

[BibT_eX]

[DOI]

Yauhen Yakimenka

CoRR, 2020

Concatenated Codes for Recovery From Multiple Reads of DNA Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Private Edge Computing for Linear Inference Based on Secret Sharing.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

2019

Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Private Information Retrieval From a Cellular Network With Caching at the Edge.

[BibT_eX]

[DOI]

Linda Senigagliesi

IEEE Trans. Commun., 2019

LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Private Information Retrieval in Wireless Coded Caching.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

On the Capacity of Private Nonlinear Computation for Replicated Databases.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Private Polynomial Computation for Noncolluding Coded Databases.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Weakly-Private Information Retrieval.

[BibT_eX]

[DOI]

Eitan Yaakobi

Proceedings of the IEEE International Symposium on Information Theory, 2019

Coded Distributed Tracking.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018

Asymptotic Analysis and Spatial Coupling of Counter Braids.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity.

[BibT_eX]

[DOI]

Iryna Andriyanova

Fredrik Brannstrom

IEEE Trans. Commun., 2018

On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage.

[BibT_eX]

[DOI]

CoRR, 2018

A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code.

[BibT_eX]

[DOI]

CoRR, 2018

Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers.

[BibT_eX]

[DOI]

Francisco Lázaro

Gianluigi Liva

Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

Construction D′ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Siyu Chen

Brian M. Kurkoski

Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Capacity of Private Linear Computation for Coded Databases.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code.

[BibT_eX]

[DOI]

CoRR, 2017

ML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

Lengthening and Extending Binary Private Information Retrieval Codes.

[BibT_eX]

[DOI]

CoRR, 2017

Block-diagonal coding for distributed computing with straggling servers.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Edge spreading design of high rate array-based SC-LDPC codes.

[BibT_eX]

[DOI]

David G. M. Mitchell

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Private information retrieval in distributed storage systems using an arbitrary linear code.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Secure Repairable Fountain Codes.

[BibT_eX]

[DOI]

Dushantha Nalin K. Jayakody

IEEE Commun. Lett., 2016

Spatially-Coupled LDPC Coding in Threshold-Based Lossy Forwarding Scheme.

[BibT_eX]

[DOI]

Proceedings of the IEEE 84th Vehicular Technology Conference, 2016

On adaptive linear programming decoding of linear codes over GF(8).

[BibT_eX]

[DOI]

Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Wrap-around sliding-window near-ML decoding of binary LDPC codes over the BEC.

[BibT_eX]

[DOI]

Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

Constructing valid convex hull inequalities for single parity-check codes over prime fields.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On failing sets of the interval-passing algorithm for compressed sensing.

[BibT_eX]

[DOI]

Yauhen Yakimenka

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

On adaptive linear programming decoding of ternary linear codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Analysis of spatially-coupled counter braids.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

On the minimum distance of array-based spatially-coupled low-density parity-check codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Marcel Adrian Ambroze

Martin Tomlinson

IEEE Trans. Inf. Theory, 2014

Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Using Short Synchronous WOM Codes to Make WOM Codes Decodable.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Near-Field Passive RFID Communication: Channel Model and Code Design.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Spatially-coupled counter braids.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

An upper bound on the minimum distance of array low-density parity-check codes.

[BibT_eX]

[DOI]

Marcel Adrian Ambroze

Martin Tomlinson

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2012

Addendum to "An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices".

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Coding for Inductively Coupled Channels.

[BibT_eX]

[DOI]

Angela I. Barbero

IEEE Trans. Inf. Theory, 2012

On the Minimum Distance of Turbo Codes With Quadratic Permutation Polynomial Interleavers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes.

[BibT_eX]

[DOI]

Lars Eirik Danielsen

IEEE Trans. Commun., 2012

Error correction on an insertion/deletion channel applying codes from RFID standards.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

On the power transfer of error-control codes for RFID communications.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Making WOM codes decodable using short synchronous WOM codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Performance Analysis of 3-D Turbo Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Editorial.

[BibT_eX]

[DOI]

Sasha Kholosha

Pascale Charpin

Des. Codes Cryptogr., 2011

Further Results on Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes

[BibT_eX]

[DOI]

CoRR, 2011

Performance Analysis of 3-Dimensional Turbo Codes

[BibT_eX]

[DOI]

CoRR, 2011

On the Analysis of Weighted Nonbinary Repeat Multiple-Accumulate Codes

[BibT_eX]

[DOI]

CoRR, 2011

Iterative soft decoding of binary linear codes using a generalized Tanner graph.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Constrained codes for passive RFID communication.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

On the minimum distance properties of weighted nonbinary repeat multiple-accumulate codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Pseudocodewords of linear programming decoding of 3-dimensional turbo codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Error Correcting Coding for a Nonsymmetric Ternary Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Improved adaptive belief propagation decoding using edge-local complementation.

[BibT_eX]

[DOI]

Lars Eirik Danielsen

Proceedings of the IEEE International Symposium on Information Theory, 2010

Stopping set analysis of 3-dimensional turbo code ensembles.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Design of a Concatenated Coding Scheme for a Bit-Shift Channel.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2010

2009

An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

On the pairwise error probability of linear programming decoding on independent Rayleigh flat-fading channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Good concatenated code ensembles for the binary erasure channel.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2009

Error Correcting Coding for a Non-symmetric Ternary Channel

[BibT_eX]

[DOI]

CoRR, 2009

Stopping set analysis of repeat multiple-accumulate codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Iterative decoding on multiple tanner graphs using random edge local complementation.

[BibT_eX]

[DOI]

Lars Eirik Danielsen

Proceedings of the IEEE International Symposium on Information Theory, 2009

On Linear Programming Decoding on a Quantized Additive White Gaussian Noise Channel.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2009

Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels.

[BibT_eX]

[DOI]

Angela I. Barbero

Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008

Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On the Effects of Pseudo-Codewords on Independent Rayleigh Flat-Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On the Design of Bit-Interleaved Turbo-Coded Modulation With Low Error Floors.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2006

Frequency estimation of a single complex sinusoid using a generalized Kay estimator.

[BibT_eX]

[DOI]

Anders Vahlin

IEEE Trans. Commun., 2006

Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo Codes.

[BibT_eX]

[DOI]

Oscar Y. Takeshita

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Improved algorithms for the determination of turbo-code weight distributions.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2005

Turbo stopping sets: the uniform interleaver and efficient enumeration.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Finite-length analysis of turbo decoding on the binary erasure channel.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On the construction of good families of rate-compatible punctured turbo codes.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Sphere-Packing Bounds for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On maximum length convolutional codes under a trellis complexity constraint.

[BibT_eX]

[DOI]

J. Complex., 2004

On convolutional codes and sphere packing bounds.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On bit-interleaved turbo-coded modulation with low error floors.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On lowering the error floor of bit-interleaved turbo-coded modulation.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

2003

High Rate Convolutional Codes with Optimal Cycle Weights.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

2001

Generalized Kay estimator for the frequency of a single complex sinusoid.

[BibT_eX]

[DOI]