Zobrazeno 1 - 10
of 122 992
pro vyhledávání: '"P. A. Solomon"'
Autor:
Chen, Yeyuan, Zhang, Zihan
In this paper, we prove that any `appropriate' folded Reed-Solomon and univariate multiplicity codes achieve relaxed generalized Singleton bound for list size $L\ge1.$ More concretely, we show the following: (1) Any $(s,\gamma)$-folded RS code over t
Externí odkaz:
http://arxiv.org/abs/2408.15925
Maximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon (TGRS) codes
Externí odkaz:
http://arxiv.org/abs/2408.12049
Autor:
Bajaj, Bhavuk Sikka
This study addresses the use of Reed-Solomon error correction codes in QR codes to enhance resilience against failures. To fully grasp this approach, a basic cryptographic context is provided, necessary for understanding Reed-Solomon codes. The study
Externí odkaz:
http://arxiv.org/abs/2407.17364
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that, for any $\e
Externí odkaz:
http://arxiv.org/abs/2407.07299
Autor:
Chen, Hao
In their fundamental paper published in 1965, G. Solomon and J. J. Stiffler invented infinite families of codes meeting the Griesmer bound. These codes are then called Solomon-Stiffler codes and have motivated various constructions of codes meeting o
Externí odkaz:
http://arxiv.org/abs/2406.10825
We study the list-decodability and list-recoverability of two code ensembles: random linear codes and random Reed-Solomon codes. Inspired by the existing research about local properties of random code ensembles over small alphabets, we develop a new
Externí odkaz:
http://arxiv.org/abs/2406.02238
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
Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast Fourier transform (FFT) and modular approach are designed for RS code
Externí odkaz:
http://arxiv.org/abs/2405.01043
Autor:
Sinclair Dinnen
Publikováno v:
International Journal for Crime, Justice and Social Democracy, Vol 13, Iss 3, Pp 97-108 (2024)
This article examines narratives and practices of post-conflict recovery in Bougainville and Solomon Islands respectively, with particular emphasis on the governance of justice and security. The original visions and pathways to recovery differed mark
Externí odkaz:
https://doaj.org/article/5b87b0db94044668b3600ebc67ef45c6