Zobrazeno 1 - 10
of 174
pro vyhledávání: '"Tuvi Etzion"'
Publikováno v:
Forum of Mathematics, Pi, Vol 4 (2016)
Let $\mathbb{F}_{q}^{n}$ be a vector space of dimension $n$ over the finite field $\mathbb{F}_{q}$ . A $q$ -analog of a Steiner system (also known as a $q$ -Steiner system), denoted ${\mathcal{S}}_{q}(t,\!k,\!n)$ , is a set ${\mathcal{S}}$ of
Externí odkaz:
https://doaj.org/article/21c15632662a4bd5a3b460bb1d247339
Publikováno v:
IEEE Transactions on Information Theory. 69:2923-2939
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e565fb653ce1228e044d2341977778c2
https://doi.org/10.1109/tit.2022.3227467
https://doi.org/10.1109/tit.2022.3227467
Autor:
Tuvi Etzion
Publikováno v:
IEEE Transactions on Information Theory. 68:891-904
Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it holds for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6ba310a7d477f661122d15844c5c929
https://doi.org/10.1109/tit.2021.3125277
https://doi.org/10.1109/tit.2021.3125277
Autor:
Simon R. Blackburn, Tuvi Etzion
Publikováno v:
Journal of Combinatorial Designs. 29:339-366
Let $n$ and $\ell$ be positive integers. Recent papers by Kreher, Stinson and Veitch have explored variants of the problem of ordering the points in a triple system (such as a Steiner triple system, directed triple system or Mendelsohn triple system)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf882669d6d0a7cfda99f9246d932c0d
https://doi.org/10.1002/jcd.21770
https://doi.org/10.1002/jcd.21770
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d798dbc73caf42aa37aa349eeaf7028
https://doi.org/10.1109/isit50566.2022.9834560
https://doi.org/10.1109/isit50566.2022.9834560
The rapid development of DNA storage has brought the deletion and insertion channel to the front line of research. When the number of deletions is equal to the number of insertions, the Fixed Length Levenshtein (FLL) metric is the right measure for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2677889d0549a16adf32480c0321c6ff
http://arxiv.org/abs/2206.07995
http://arxiv.org/abs/2206.07995
Autor:
Junling Zhou, Tuvi Etzion
Publikováno v:
Journal of Combinatorial Designs. 28:551-567
Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n) \leq n-3$ and a set of $n-3$ such systems is called a large set. No nontrivial large set was constructed yet, although it is known th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1eed98f27e03959c1f335e36a2f78fde
https://doi.org/10.1002/jcd.21713
https://doi.org/10.1002/jcd.21713
Publikováno v:
ISIT
A multiset combinatorial batch code (MCBC) over vector space consists of a set of subspaces of $\mathbb{F}_{q}^{n}$ , each corresponding to a server, such that requests consisting of $t$ dimensional subspaces, can be retrieved from the servers. The c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fa1502ac910b18379b580a5e03caf8d
https://doi.org/10.1109/isit45174.2021.9518238
https://doi.org/10.1109/isit45174.2021.9518238
Publikováno v:
ISIT
The de Bruijn graph and its sequences have found many diverse applications in information theory as well as other areas of computer science and engineering such as interconnection networks, VLSI decomposition, and most recently in DNA storage. Binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a2c61fea467c0c8c62c1e76535c8e2d
https://doi.org/10.1109/isit45174.2021.9517873
https://doi.org/10.1109/isit45174.2021.9517873