collaborators

10 papers

cs.IT2026

The Star Product of Uniformly Random Codes

Johan Vester Dinesen, Ragnar Freij-Hollanti, Camilla Hollanti +2

We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We use a corr…

cs.IT2026

Graphical Analysis of Lifted Product Code Constructions

Ragnar Freij-Hollanti, Kirsten D. Morris, Patricija Šapokaitė

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understand…

cs.IT2026

Existence and Constructions of Strict Function-Correcting Codes with Data Protection

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1

Function-correcting codes with data protection simultaneously protect both the data and a function of the data at distinct error-correction levels. When the function receives stric…

cs.CC2026

Attacking the Polynomials in the Maze of Finite Fields problem

Àngela Barbero, Ragnar Freij-Hollanti, Camilla Hollanti +3

In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the…

cs.IT2026

Function-Correcting Partition Codes

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1

We introduce function-correcting partition codes (FCPCs), which are a natural generalization of function-correcting codes (FCCs). An FCPC is defined directly on a partition of the…

cs.IT2026

Non-Existence of Some Function-Correcting Codes With Data Protection

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1

In this paper, we consider the recently introduced concept of \emph{function-correcting codes (FCCs) with data protection}, which provide a certain level of error protection for th…