Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Hollmann, Henk D. L."'
Publikováno v:
Proceedings WCC 2024
Unequal Error-Protecting (UEP) codes are error-correcting (EC) codes designed to protect some parts of the encoded data better than other parts. Here, we introduce a similar generalization of PIR codes that we call Unequal-Data-Demand (UDD) PIR codes
Externí odkaz:
http://arxiv.org/abs/2407.18124
Autor:
Hollmann, Henk D. L., Luhaäär, Urmas
First, we state a generalization of the minimum-distance bound for PIR codes. Then we describe a construction for linear PIR codes using packing designs and use it to construct some new 5-PIR codes. Finally, we show that no encoder (linear or nonline
Externí odkaz:
http://arxiv.org/abs/2208.14552
Autor:
Hollmann, Henk D. L.
Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i
Externí odkaz:
http://arxiv.org/abs/2202.07917
The binary $k$-dimensional simplex code is known to be a $2^{k-1}$-batch code and is conjectured to be a $2^{k-1}$-functional batch code. Here, we offer a simple, constructive proof of a result that is "in between" these two properties. Our approach
Externí odkaz:
http://arxiv.org/abs/2110.07421
An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called non-standard if it ca
Externí odkaz:
http://arxiv.org/abs/2103.13880
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Let $G$ be a finite abelian group. If $f: G\rightarrow \bC$ is a nonzero function with Fourier transform $\hf$, the Donoho-Stark uncertainty principle states that $|\supp(f)||\supp(\hf)|\geq |G|$. The purpose of this paper is twofold. First, we prese
Externí odkaz:
http://arxiv.org/abs/1804.00367
Autor:
Hollmann, Henk D. L., Rietman, Ronald, de Hoogh, Sebastiaan, Tolhuizen, Ludo M. G. M., Gorissen, Paul
We present a method to increase the dynamical range of a Residue Number System (RNS) by adding virtual RNS layers on top of the original RNS, where the required modular arithmetic for a modulus on any non-bottom layer is implemented by means of an RN
Externí odkaz:
http://arxiv.org/abs/1801.07561
Publikováno v:
Designs, Codes & Cryptography; Oct2024, Vol. 92 Issue 10, p2949-2970, 22p
Publikováno v:
Journal of Algebra (2015), pp. 268-295
A maximal minor $M$ of the Laplacian of an $n$-vertex Eulerian digraph $\Gamma$ gives rise to a finite group $\mathbb{Z}^{n-1}/\mathbb{Z}^{n-1}M$ known as the sandpile (or critical) group $S(\Gamma)$ of $\Gamma$. We determine $S(\Gamma)$ of the gener
Externí odkaz:
http://arxiv.org/abs/1405.0113