20 citations · 71 across the 20 of their papers we have counts for
21 papers
Insdel Reed-Solomon Decoding Algorithms up to the Half-Singleton Bound
Bencheng Fan, Margreta Kuijper, Jingge Zhu
In this paper, we focus on decoding optimal Reed-Solomon codes of dimension two for insdel errors up to the half-Singleton bound. We present a decoding algorithm for the general in…
On Unified and Sharpened CMI Bounds for Generalization Errors
Yang Lu, Matthias Frey, Margreta Kuijper +1
We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on th…
Easy repair via codes with simplex locality
Margreta Kuijper, Julia Lieb, Diego Napp
In the context of distributed storage systems, locally repairable codes have become important. In this paper we focus on codes that allow for multi-erasure pattern decoding with lo…
Lightweight Conceptual Dictionary Learning for Text Classification Using Information Compression
Li Wan, Tansu Alpcan, Margreta Kuijper +1
We propose a novel, lightweight supervised dictionary learning framework for text classification based on data compression and representation. This two-phase algorithm initially em…
An Unknown Input Multi-Observer Approach for Estimation and Control under Adversarial Attacks
Tianci Yang, Carlos Murguia, Margreta Kuijper +1
We address the problem of state estimation, attack isolation, and control of discrete-time linear time-invariant systems under (potentially unbounded) actuator and sensor false dat…
A Multi-Observer Based Estimation Framework for Nonlinear Systems under Sensor Attacks
Tianci Yang, Carlos Murguia, Margreta Kuijper +1
We address the problem of state estimation and attack isolation for general discrete-time nonlinear systems when sensors are corrupted by (potentially unbounded) attack signals. Fo…
An Unknown Input Multi-Observer Approach for Estimation, Attack Isolation, and Control of LTI Systems under Actuator Attacks
Tianci Yang, Carlos Murguia, Margreta Kuijper +1
We address the problem of state estimation, attack isolation, and control for discrete-time Linear Time Invariant (LTI) systems under (potentially unbounded) actuator false data in…
A Multi-Observer Approach for Attack Detection and Isolation of Discrete-Time Nonlinear Systems
Tianci Yang, Carlos Murguia, Margreta Kuijper +1
We address the problem of attack detection and isolation for a class of discrete-time nonlinear systems under (potentially unbounded) sensor attacks and measurement noise. We consi…
A Robust Circle-criterion Observer-based Estimator for Discrete-time Nonlinear Systems in the Presence of Sensor Attacks and Measurement Noise
Tianci Yang, Carlos Murguia, Margreta Kuijper +1
We address the problem of robust state estimation of a class of discrete-time nonlinear systems with positive-slope nonlinearities when the sensors are corrupted by (potentially un…
Linear system security -- detection and correction of adversarial attacks in the noise-free case
Zhanghan Tang, Margreta Kuijper, Michelle Chong +2
We address the problem of attack detection and attack correction for multi-output discrete-time linear time-invariant systems under sensor attack. More specifically, we focus on th…
Vulnerability of linear systems against sensor attacks--a system's security index
Michelle S. Chong, Margreta Kuijper
The `security index' of a discrete-time LTI system under sensor attacks is introduced as a quantitative measure on the security of an observable system. We derive ideas from error…
Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules
Anna-Lena Trautmann, Margreta Kuijper
We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm compu…
Gröbner Bases for Linearized Polynomials
Margreta Kuijper, Anna-Lena Trautmann
In this work we develop the theory of Gröbner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
Iterative List-Decoding of Gabidulin Codes via Gröbner Based Interpolation
Margreta Kuijper, Anna-Lena Trautmann
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one,…
List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
Margreta Kuijper, Anna-Lena Trautmann
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal…
Erasure codes with simplex locality
Margreta Kuijper, Diego Napp
We focus on erasure codes for distributed storage. The distributed storage setting imposes locality requirements because of easy repair demands on the decoder. We first establish t…
An iterative algorithm for parametrization of shortest length shift registers over finite rings
M. Kuijper, R. Pinto
The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a par…
A parametric approach to list decoding of Reed-Solomon codes using interpolation
Mortuza Ali, Margreta Kuijper
In this paper we present a minimal list decoding algorithm for Reed-Solomon (RS) codes. Minimal list decoding for a code refers to list decoding with radius , where is t…
Source Coding With Side Information Using List Decoding
Mortuza Ali, Margreta Kuijper
The problem of source coding with side information (SCSI) is closely related to channel coding. Therefore, existing literature focuses on using the most successful channel codes na…
Minimal Gröbner bases and the predictable leading monomial property
M. Kuijper, K. Schindelar
We focus on Gröbner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared…
On minimality of convolutional ring encoders
Margreta Kuijper, Raquel Pinto
Convolutional codes are considered with code sequences modelled as semi-infinite Laurent series. It is wellknown that a convolutional code C over a finite group G has a minimal tre…