135 citations · 191 across the 19 of their papers we have counts for
21 papers
The permutation automorphism groups of irreducible cyclic codes
Tao Feng, Henk D. L. Hollmann, Weicong Li +1
The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over is called irreducible if its check pol…
Optimal possibly nonlinear 3-PIR codes of small size
Henk D. L. Hollmann, Urmas Luhaäär
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 som…
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes
Henk D. L. Hollmann
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\…
On some batch code properties of the simplex code
Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet +1
The binary -dimensional simplex code is known to be a -batch code and is conjectured to be a -functional batch code. Here, we offer a simple, constructive proo…
Some basic results on finite linear recurring sequence subgroups
Henk D. L. Hollmann, Medet Zhanbulatuly
An -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,…
The shift bound for abelian codes and generalizations of the Donoho-Stark uncertainty principle
Tao Feng, Henk D. L. Hollmann, Qing Xiang
Let 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…