default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaron Shany
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Amit Berman, Yaron Shany, Itzhak Tamo:
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes. IEEE Trans. Inf. Theory 70(11): 7673-7689 (2024)- [c2]Amit Berman, Yaron Shany, Itzhak Tamo:
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. ISIT 2024: 3564-3569 - [i7]Amit Berman, Yaron Shany, Itzhak Tamo:
Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity. CoRR abs/2401.15034 (2024) - [i6]Yaron Shany, Amit Berman:
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes. CoRR abs/2408.08218 (2024) - 2023
- [j10]Yaron Shany
, Amit Berman:
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding. IEEE Trans. Inf. Theory 69(8): 4907-4926 (2023) - [i5]Amit Berman, Yaron Shany, Itzhak Tamo:
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes. CoRR abs/2305.17764 (2023) - 2022
- [j9]Yaron Shany, Amit Berman:
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes. IEEE Trans. Inf. Theory 68(4): 2300-2318 (2022) - [j8]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. IEEE Trans. Inf. Theory 68(10): 6505-6515 (2022) - [i4]Yaron Shany, Amit Berman:
Fast syndrome-based Chase decoding of binary BCH codes through Wu list decoding. CoRR abs/2204.02330 (2022) - 2021
- [c1]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. ISIT 2021: 867-871 - 2020
- [i3]Yaron Shany, Amit Berman:
A Groebner-bases approach to syndrome-based fast Chase decoding of Reed-Solomon codes. CoRR abs/2008.01796 (2020) - [i2]Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. CoRR abs/2012.11166 (2020)
2010 – 2019
- 2011
- [i1]Yaron Shany, Ram Zamir:
A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n. CoRR abs/1105.3793 (2011)
2000 – 2009
- 2004
- [j7]Yaron Shany, Ilan Reuven, Yair Be'ery:
Lower bounds on the state complexity of linear tail-biting trellises. IEEE Trans. Inf. Theory 50(3): 566-571 (2004) - [j6]Yaron Shany, Yair Be'ery:
A note on nonlinear Xing codes. IEEE Trans. Inf. Theory 50(4): 699-700 (2004) - [j5]Yaron Shany:
Toward an Explicit Construction of Nonlinear Codes Exceeding the Tsfasman-Vladut-Zink Bound. IEEE Trans. Inf. Theory 50(11): 2844-2850 (2004) - 2000
- [j4]Yaron Shany, Yair Be'ery:
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes. IEEE Trans. Inf. Theory 46(4): 1514-1523 (2000) - [j3]Yaron Shany, Yair Be'ery:
Bounds on the state complexity of codes from the Hermitian function field and its subfields. IEEE Trans. Inf. Theory 46(4): 1523-1527 (2000)
1990 – 1999
- 1999
- [j2]Yaron Shany, Yair Be'ery:
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions. IEEE Trans. Inf. Theory 45(5): 1667-1673 (1999) - 1998
- [j1]Yaron Shany, Ilan Reuven, Yair Be'ery:
On the Trellis Representation of the Delsarte-Goethals Codes. IEEE Trans. Inf. Theory 44(4): 1547-1554 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
