Yaron Shany

According to our database, Yaron Shany authored at least 16 papers between 1998 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes.

Yaron Shany, Amit Berman

IEEE Trans. Inf. Theory, March, 2025

Efficient Polar Systematic Encoding Without the Domination Contiguity Property.

Idan Dekel, Yaron Shany, Ariel Doubchak, Amit Berman

Proceedings of the IEEE International Symposium on Information Theory, 2025

2024

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes.

Amit Berman, Yaron Shany, Itzhak Tamo

IEEE Trans. Inf. Theory, November, 2024

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.

Amit Berman, Yaron Shany, Itzhak Tamo

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding.

Yaron Shany, Amit Berman

IEEE Trans. Inf. Theory, August, 2023

2022

A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes.

Yaron Shany, Amit Berman

IEEE Trans. Inf. Theory, 2022

2021

Repairing Reed-Solomon Codes Evaluated on Subspaces.

Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

A Groebner-bases approach to syndrome-based fast Chase decoding of Reed-Solomon codes.

Yaron Shany, Amit Berman

CoRR, 2020

2011

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

CoRR, 2011

2004

Lower bounds on the state complexity of linear tail-biting trellises.

Yaron Shany, Ilan Reuven, Yair Be'ery

IEEE Trans. Inf. Theory, 2004

A note on nonlinear Xing codes.

Yaron Shany, Yair Be'ery

IEEE Trans. Inf. Theory, 2004

Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound.

Yaron Shany

IEEE Trans. Inf. Theory, 2004

2000

Bounds on the state complexity of codes from the Hermitian function field and its subfields.

Yaron Shany, Yair Be'ery

IEEE Trans. Inf. Theory, 2000

Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.

Yaron Shany, Yair Be'ery

IEEE Trans. Inf. Theory, 2000

1999

The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions.

Yaron Shany, Yair Be'ery

IEEE Trans. Inf. Theory, 1999

1998

On the Trellis Representation of the Delsarte-Goethals Codes.

Yaron Shany, Ilan Reuven, Yair Be'ery

IEEE Trans. Inf. Theory, 1998