Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Henk D. L. Hollmann"'
Publikováno v:
Designs, Codes and Cryptography. 91:1595-1605
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9e245358f10941198dad9f2f8494365
https://doi.org/10.1007/s10623-022-01173-6
https://doi.org/10.1007/s10623-022-01173-6
Autor:
Henk D. L. Hollmann, Urmas Luhaäär
Publikováno v:
Arithmetic of Finite Fields ISBN: 9783031229435
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa0e71f58c5017ba8ed8d080deb4816f
https://doi.org/10.1007/978-3-031-22944-2_9
https://doi.org/10.1007/978-3-031-22944-2_9
Autor:
Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::536166ed3a198b5d2e350703df220f5f
https://doi.org/10.1109/isit50566.2022.9834501
https://doi.org/10.1109/isit50566.2022.9834501
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, where the relation has characteristic polynomial f. It is called non-sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecb229d0cbbdca24f673d79a8b239997
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d31d22d60ab79780046913c81d46eba
http://arxiv.org/abs/1804.00367
http://arxiv.org/abs/1804.00367
Publikováno v:
IEEE Transactions on Information Theory. 61:5271-5279
The newly presented $(k+m,k)$ Hadamard minimum storage regenerating (MSR) codes are a class of high rate storage codes with optimal repair property for single node failure. In this paper, we propose a new simple optimal repair strategy for $(k+m,k)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44d7dba743e4a40e20899ec4275b476d
https://doi.org/10.1109/tit.2015.2461623
https://doi.org/10.1109/tit.2015.2461623
Autor:
Henk D. L. Hollmann, Ludo Tolhuizen
Publikováno v:
IEEE Transactions on Information Theory. 54:4361-4364
In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs $[n,k]$ codes that can correct any burst of erasures (including wrap-around bursts) of length $n-k$ . They raise
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccf28abdd304351121d3134e1fbad9bb
https://doi.org/10.1109/tit.2008.928287
https://doi.org/10.1109/tit.2008.928287
Publikováno v:
Finite Fields and Their Applications. 14:823-833
We present some general equalities between Kloosterman sums over finite fields of arbitrary characteristics. In particular, we obtain an explicit Kloosterman sum identity over finite fields of characteristic 3.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efb299268e8855fea2927a0280b5f198
https://doi.org/10.1016/j.ffa.2008.02.002
https://doi.org/10.1016/j.ffa.2008.02.002
Autor:
Ludo Tolhuizen, Henk D. L. Hollmann
Publikováno v:
Journal of Combinatorial Theory, Series A. 113:1746-1759
A generic (r, m)-erasure correcting set generates for each binary linear code of codimension r a collection of parity check equations that enables iterative decoding of all potentially correctable erasure patterns of size at most m. As we have shown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6cdecd5ba4f37c30e02895c0771f165
https://doi.org/10.1016/j.jcta.2006.03.024
https://doi.org/10.1016/j.jcta.2006.03.024
Autor:
Qing Xiang, Henk D. L. Hollmann
Publikováno v:
Journal of Combinatorial Theory, Series A. 113:1008-1018
The action of PGL(2, 2m) on the set of exterior lines to a nonsingular conic in PG(2, 2m) affords an association scheme, which was shown to be pseudocyclic in [H.D.L. Hollmann, Association schemes, Master thesis, Eindhoven University of Technology, 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b02f68b02b22306212e18416ea4ade5a
https://doi.org/10.1016/j.jcta.2005.09.004
https://doi.org/10.1016/j.jcta.2005.09.004