Zobrazeno 1 - 10
of 1 028
pro vyhledávání: '"Son, Hoang"'
Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order $v$ is partitioned into two pairs. Each pair in such a partition is called a nested design pair and its mu
Externí odkaz:
http://arxiv.org/abs/2410.14417
Autor:
Cao, Quang, Vgena, Katerina, Mavroeidi, Aikaterini-Georgia, Kalloniatis, Christos, Yi, Xun, Dau, Son Hoang
Centralized social networks have experienced a transformative impact on our digital era communication, connection, and information-sharing information. However, it has also raised significant concerns regarding users' privacy and individual rights. I
Externí odkaz:
http://arxiv.org/abs/2409.18360
The structure of linear dependence relations between coded symbols of a linear code, irrespective of specific coefficients involved, is referred to as the {\em topology} of the code. The specification of coefficients is referred to as an {\em instant
Externí odkaz:
http://arxiv.org/abs/2406.12160
Autor:
Dinh, Thi Xinh, Le, Ba Thong, Dau, Son Hoang, Boztas, Serdar, Kruglik, Stanislav, Kiah, Han Mao, Viterbo, Emanuele, Etzion, Tuvi, Chee, Yeow Meng
We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side information is represented as a set $S$ of linearly independent combinations o
Externí odkaz:
http://arxiv.org/abs/2405.07180
We investigate the problem of privately recovering a single erasure for Reed-Solomon codes with low communication bandwidths. For an $[n,k]_{q^\ell}$ code with $n-k\geq q^{m}+t-1$, we construct a repair scheme that allows a client to recover an arbit
Externí odkaz:
http://arxiv.org/abs/2405.06583
To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur z
Externí odkaz:
http://arxiv.org/abs/2405.03614
In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}}, d=2)$ constant
Externí odkaz:
http://arxiv.org/abs/2401.16647
Large Language Models (LLMs) have been garnering significant attention of AI researchers, especially following the widespread popularity of ChatGPT. However, due to LLMs' intricate architecture and vast parameters, several concerns and challenges reg
Externí odkaz:
http://arxiv.org/abs/2310.05312
We investigate in this work the problem of Erasure Combinatorial Batch Codes, in which $n$ files are stored on $m$ servers so that every set of $n-r$ servers allows a client to retrieve at most $k$ distinct files by downloading at most $t$ files from
Externí odkaz:
http://arxiv.org/abs/2310.00467
Autor:
Huynh, Phuong Duy, De Silva, Thisal, Dau, Son Hoang, Li, Xiaodong, Gondal, Iqbal, Viterbo, Emanuele
We investigate in this work a recently emerging type of scam token called Trapdoor, which has caused the investors hundreds of millions of dollars in the period of 2020-2023. In a nutshell, by embedding logical bugs and/or owner-only features to the
Externí odkaz:
http://arxiv.org/abs/2309.04700