Yaron Shany

23 papers B 3Journal 20
YearRankTypeTitle / Venue / Authors
2025 B conf
Efficient Polar Systematic Encoding Without the Domination Contiguity Property.
ISIT
Idan Dekel, Yaron Shany, Ariel Doubchak, Amit Berman
2025 J jnl
Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity.
IEEE Trans. Inf. Theory
Amit Berman, Yaron Shany, Itzhak Tamo
2025 J jnl
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes.
IEEE Trans. Inf. Theory
Yaron Shany, Amit Berman
2024 J jnl
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes.
IEEE Trans. Inf. Theory
Amit Berman, Yaron Shany, Itzhak Tamo
2024 B conf
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.
ISIT
Amit Berman, Yaron Shany, Itzhak Tamo
2024 J jnl
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.
CoRR
Amit Berman, Yaron Shany, Itzhak Tamo
2024 J jnl
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes.
CoRR
Yaron Shany, Amit Berman
2023 J jnl
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes.
CoRR
Amit Berman, Yaron Shany, Itzhak Tamo
2023 J jnl
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding.
IEEE Trans. Inf. Theory
Yaron Shany, Amit Berman
2022 J jnl
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes.
IEEE Trans. Inf. Theory
Yaron Shany, Amit Berman
2022 J jnl
Fast syndrome-based Chase decoding of binary BCH codes through Wu list decoding.
CoRR
Yaron Shany, Amit Berman
2022 J jnl
Repairing Reed-Solomon Codes Evaluated on Subspaces.
IEEE Trans. Inf. Theory
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
2021 B conf
Repairing Reed-Solomon Codes Evaluated on Subspaces.
ISIT
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
2020 J jnl
A Groebner-bases approach to syndrome-based fast Chase decoding of Reed-Solomon codes.
CoRR
Yaron Shany, Amit Berman
2020 J jnl
Repairing Reed-Solomon Codes Evaluated on Subspaces.
CoRR
Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
2011 J jnl
A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n
CoRR
Yaron Shany, Ram Zamir
2004 J jnl
A note on nonlinear Xing codes.
IEEE Trans. Inf. Theory
Yaron Shany, Yair Be'ery
2004 J jnl
Lower bounds on the state complexity of linear tail-biting trellises.
IEEE Trans. Inf. Theory
Yaron Shany, Ilan Reuven, Yair Be'ery
2004 J jnl
Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound.
IEEE Trans. Inf. Theory
Yaron Shany
2000 J jnl
Bounds on the state complexity of codes from the Hermitian function field and its subfields.
IEEE Trans. Inf. Theory
Yaron Shany, Yair Be'ery
2000 J jnl
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.
IEEE Trans. Inf. Theory
Yaron Shany, Yair Be'ery
1999 J jnl
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions.
IEEE Trans. Inf. Theory
Yaron Shany, Yair Be'ery
1998 J jnl
On the Trellis Representation of the Delsarte-Goethals Codes.
IEEE Trans. Inf. Theory
Yaron Shany, Ilan Reuven, Yair Be'ery