Yaron Shany

Orcid: 0000-0001-6149-9755

According to our database1, Yaron Shany authored at least 15 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes.
IEEE Trans. Inf. Theory, November, 2024

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

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding.
IEEE Trans. Inf. Theory, August, 2023

2022
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2022

Repairing Reed-Solomon Codes Evaluated on Subspaces.
IEEE Trans. Inf. Theory, 2022

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

2011
A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n
CoRR, 2011

2004
Lower bounds on the state complexity of linear tail-biting trellises.
IEEE Trans. Inf. Theory, 2004

A note on nonlinear Xing codes.
IEEE Trans. Inf. Theory, 2004

Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound.
IEEE Trans. Inf. Theory, 2004

2000
Bounds on the state complexity of codes from the Hermitian function field and its subfields.
IEEE Trans. Inf. Theory, 2000

Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.
IEEE Trans. Inf. Theory, 2000

1999
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions.
IEEE Trans. Inf. Theory, 1999

1998
On the Trellis Representation of the Delsarte-Goethals Codes.
IEEE Trans. Inf. Theory, 1998


  Loading...