2 citations · 3 across the 8 of their papers we have counts for
8 papers
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
Amit Berman, Yaron Shany, Itzhak Tamo
Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part…
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes
Yaron Shany, Amit Berman
In a paper from 2015, Ding et al. (IEEE Trans. IT, May 2015) conjectured that for odd , the minimum distance of the binary BCH code of length and designed distance $2^{m…
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
Amit Berman, Yaron Shany, Itzhak Tamo
In this paper, we introduce a novel explicit family of subcodes of Reed-Solomon (RS) codes that efficiently achieve list decoding capacity with a constant output list size. Our app…
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
Amit Berman, Yaron Shany, Itzhak Tamo
We present algorithms for specifying the support of minimum-weight words of extended binary BCH codes of length and designed distance $d(m,s,i):=2^{m-1-s}-2^{m-1-i…
Fast syndrome-based Chase decoding of binary BCH codes through Wu list decoding
Yaron Shany, Amit Berman
We present a new fast Chase decoding algorithm for binary BCH codes. The new algorithm reduces the complexity in comparison to a recent fast Chase decoding algorithm for Reed--Solo…
Repairing Reed-Solomon Codes Evaluated on Subspaces
Amit Berman, Sarit Buzaglo, Avner Dor +2
We consider the repair problem for Reed--Solomon (RS) codes, evaluated on an -linear subspace of dimension , where is a prime powe…
A Groebner-bases approach to syndrome-based fast Chase decoding of Reed--Solomon codes
Yaron Shany, Amit Berman
We present a simple syndrome-based fast Chase decoding algorithm for Reed--Solomon (RS) codes. Such an algorithm was initially presented by Wu (IEEE Trans. IT, Jan. 2012), building…
A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n
Yaron Shany, Ram Zamir
In this note, it is shown that if $f\colon\efq^n\to\efq^n$ is any function and $\bA=(A_1,..., A_n)$ is uniformly distributed over $\efq^n$, then the average over $(k_1,...,k_n)\in…