This work investigates the design of sparse secret sharing schemes that
...
This paper considers the problem of outsourcing the multiplication of tw...
Federated learning collaboratively trains a neural network on privately ...
In this paper we address the problem of decoding linearized Reed-Solomon...
Nanopore sequencers, being superior to other sequencing technologies for...
We propose FedGT, a novel framework for identifying malicious clients in...
The sum-rank metric arises as an algebraic approach for coding in MIMO
b...
Several recently proposed code-based cryptosystems base their security o...
Motivated by modern network communication applications which require low...
We consider error-correcting coding for DNA-based storage. We model the ...
Mixed codes, which are error-correcting codes in the Cartesian product o...
We consider distributed learning in the presence of slow and unresponsiv...
Linearized Reed-Solomon (LRS) codes are a class of evaluation codes base...
Over-the-air computation has the potential to increase the
communication...
The sum-rank metric can be seen as a generalization of both, the rank an...
We consider the problem of correcting insertion and deletion errors in t...
Due to the recent challenges in post-quantum cryptography, several new
a...
In this paper, we study the hardness of decoding a random code endowed w...
The rank metric measures the distance between two matrices by the rank o...
We consider the problem of designing a coding scheme that allows both
sp...
We propose a privacy-preserving federated learning (FL) scheme that is
r...
We consider the distributed stochastic gradient descent problem, where a...
This paper considers coding for so-called partially stuck (defect) memor...
In this work, a sequential decoder for convolutional codes over channels...
This paper is concerned with list decoding of 2-interleaved binary
alter...
Synthetic polymer-based storage seems to be a particularly promising
can...
Cryptographic algorithms rely on the secrecy of their corresponding keys...
Decoding sequences that stem from multiple transmissions of a codeword o...
Lifted codes are a class of evaluation codes attracting more attention d...
Consider the problem of designing secure and private codes for distribut...
The tensor product of one code endowed with the Hamming metric and one
e...
Motivated by applications in machine learning and archival data storage,...
Generalized Goppa codes are defined by a code locator set ℒ of
polynomia...
This paper investigates the problem of correcting multiple criss-cross
d...
This paper investigates the decoding of certain Gabidulin codes that wer...
This paper presents the first decoding algorithm for Gabidulin codes ove...
Locality enables storage systems to recover failed nodes from small subs...
We consider the problem of designing codes with flexible rate (referred ...
Decoding sequences that stem from multiple transmissions of a codeword o...
Interleaved Reed-Solomon codes admit efficient decoding algorithms which...
This work compares the performance of software implementations of differ...
The Learning with Errors (LWE) problem is an 𝒩𝒫-hard problem that
lies t...
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure
cor...
This paper considers coding for so-called partially stuck memory cells. ...
In this work, we introduce a natural notion concerning vector finite spa...
Correcting insertions/deletions as well as substitution errors simultane...
This paper studies the problem of constructing codes correcting deletion...
We consider the problem of designing rateless coded private distributed
...
A new computational private information retrieval (PIR) scheme based on
...
A distributed storage system (DSS) needs to be efficiently accessible an...