Yaron Shany

Itzhak Tamo

CoRR, 2024

2023

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, August, 2023

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

[BibT_eX]

[DOI]

Itzhak Tamo

CoRR, 2023

2022

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Repairing Reed-Solomon Codes Evaluated on Subspaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2011

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

[BibT_eX]

[DOI]

Ram Zamir

CoRR, 2011

2004

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

[BibT_eX]

[DOI]

Ilan Reuven

IEEE Trans. Inf. Theory, 2004

A note on nonlinear Xing codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

2000

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1999

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1998

On the Trellis Representation of the Delsarte-Goethals Codes.

[BibT_eX]

[DOI]

Ilan Reuven