default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYair Be'ery
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Tomer Raviv, Alon Goldmann, Ofek Vayner, Yair Be'ery, Nir Shlezinger:
CRC-Aided Learned Ensembles of Belief-Propagation Polar Decoders. ICASSP 2024: 8856-8860- 2023
- [i18]Tomer Raviv, Alon Goldmann, Ofek Vayner, Yair Be'ery
, Nir Shlezinger:
CRC-Aided Learned Ensembles of Belief-Propagation Polar Decoders. CoRR abs/2301.06060 (2023) - 2022
- [j45]Eliya Nachmani, Yair Be'ery:
Neural Decoding With Optimization of Node Activations. IEEE Commun. Lett. 26(11): 2527-2531 (2022) - [i17]Moti Salti, Yair Be'ery, Erez Aluf:
An active approach towards monitoring and enhancing drivers' capabilities - the ADAM cogtec solution. CoRR abs/2204.10853 (2022) - [i16]Eliya Nachmani, Yair Be'ery:
Neural Decoding with Optimization of Node Activations. CoRR abs/2206.00786 (2022) - 2021
- [j44]Tomer Raviv, Asaf Schwartz, Yair Be'ery:
Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes. Entropy 23(1): 93 (2021) - [j43]Avi Caciularu, Nir Raviv, Tomer Raviv, Jacob Goldberger, Yair Be'ery:
perm2vec: Attentive Graph Permutation Selection for Decoding of Error Correction Codes. IEEE J. Sel. Areas Commun. 39(1): 79-88 (2021) - 2020
- [j42]Weihong Xu, Xiaosi Tan, Yair Be'ery, Yeong-Luh Ueng, Yongming Huang, Xiaohu You, Chuan Zhang:
Deep Learning-Aided Belief Propagation Decoder for Polar Codes. IEEE J. Emerg. Sel. Topics Circuits Syst. 10(2): 189-203 (2020) - [j41]Ishay Be'ery, Nir Raviv, Tomer Raviv, Yair Be'ery:
Active Deep Decoding of Linear Codes. IEEE Trans. Commun. 68(2): 728-736 (2020) - [j40]Xiaosi Tan, Weihong Xu, Kai Sun, Yunhao Xu, Yair Be'ery, Xiaohu You, Chuan Zhang:
Improving Massive MIMO Message Passing Detectors With Deep Neural Network. IEEE Trans. Veh. Technol. 69(2): 1267-1280 (2020) - [c8]Tomer Raviv, Nir Raviv, Yair Be'ery:
Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding. ISIT 2020: 321-326 - [c7]Tomer Raviv, Asaf Schwartz, Yair Be'ery:
Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes. ITW 2020: 1-5 - [i15]Tomer Raviv, Nir Raviv, Yair Be'ery:
Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding. CoRR abs/2001.06247 (2020) - [i14]Nir Raviv, Avi Caciularu, Tomer Raviv, Jacob Goldberger, Yair Be'ery:
perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention. CoRR abs/2002.02315 (2020) - [i13]Tomer Raviv, Asaf Schwartz, Yair Be'ery:
Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes. CoRR abs/2009.02591 (2020)
2010 – 2019
- 2019
- [c6]Weihong Xu, Xiaosi Tan, Yuxin Lin, Xiaohu You, Chuan Zhang, Yair Be'ery:
On the Efficient Design of Neural Networks in Communication Systems. ACSSC 2019: 522-526 - [i12]Ishay Be'ery, Nir Raviv, Tomer Raviv, Yair Be'ery:
Active Deep Decoding of Linear Codes. CoRR abs/1906.02778 (2019) - 2018
- [j39]Eliya Nachmani, Elad Marciano, Loren Lugosch, Warren J. Gross, David Burshtein, Yair Be'ery:
Deep Learning Methods for Improved Decoding of Linear Codes. IEEE J. Sel. Top. Signal Process. 12(1): 119-131 (2018) - [c5]Weihong Xu, Xiaohu You, Chuan Zhang, Yair Be'ery:
Polar Decoding on Sparse Graphs with Deep Learning. ACSSC 2018: 599-603 - [c4]Weihong Xu, Zhiwei Zhong, Yair Be'ery, Xiaohu You, Chuan Zhang:
Joint Neural Network Equalizer and Decoder. ISWCS 2018: 1-5 - [i11]Eliya Nachmani, Yaron Bachar, Elad Marciano, David Burshtein, Yair Be'ery:
Near Maximum Likelihood Decoding with Deep Learning. CoRR abs/1801.02726 (2018) - [i10]Xiaosi Tan, Weihong Xu, Yair Be'ery, Zaichen Zhang, Xiaohu You, Chuan Zhang:
Improving Massive MIMO Belief Propagation Detector with Deep Neural Network. CoRR abs/1804.01002 (2018) - [i9]Weihong Xu, Zhiwei Zhong, Yair Be'ery, Xiaohu You, Chuan Zhang:
Joint Neural Network Equalizer and Decoder. CoRR abs/1807.02040 (2018) - [i8]Weihong Xu, Xiaohu You, Chuan Zhang, Yair Be'ery:
Polar Decoding on Sparse Graphs with Deep Learning. CoRR abs/1811.09801 (2018) - 2017
- [j38]Liran Gispan, Amir Leshem, Yair Be'ery:
Decentralized estimation of regression coefficients in sensor networks. Digit. Signal Process. 68: 16-23 (2017) - [i7]Eliya Nachmani, Elad Marciano, David Burshtein, Yair Be'ery:
RNN Decoding of Linear Block Codes. CoRR abs/1702.07560 (2017) - [i6]Eliya Nachmani, Elad Marciano, Loren Lugosch, Warren J. Gross, David Burshtein, Yair Be'ery:
Deep Learning Methods for Improved Decoding of Linear Codes. CoRR abs/1706.07043 (2017) - 2016
- [c3]Eliya Nachmani, Yair Be'ery, David Burshtein:
Learning to decode linear codes using deep learning. Allerton 2016: 341-346 - [i5]Eliya Nachmani, Yair Be'ery, David Burshtein:
Learning to Decode Linear Codes Using Deep Learning. CoRR abs/1607.04793 (2016) - 2014
- [j37]Gadi Oxman, Shlomo Weiss, Yair Be'ery:
Computational methods for Conway's Game of Life cellular automaton. J. Comput. Sci. 5(1): 24-31 (2014) - 2013
- [j36]Ohad Gidon, Yair Be'ery:
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes. IEEE Trans. Commun. 61(5): 1684-1694 (2013) - 2012
- [j35]Asi Lifshitz, Yair Be'ery:
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes. IEEE Trans. Commun. 60(4): 963-971 (2012) - [i4]Ohad Gidon, Yair Be'ery:
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes. CoRR abs/1203.1850 (2012) - 2011
- [j34]Alex Yufit, Asi Lifshitz, Yair Be'ery:
Efficient Linear Programming Decoding of HDPC Codes. IEEE Trans. Commun. 59(3): 758-766 (2011) - [i3]Asi Lifshitz, Yair Be'ery:
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes. CoRR abs/1105.2631 (2011)
2000 – 2009
- 2009
- [j33]Ilan Dimnik, Yair Be'ery:
Improved random redundant iterative HDPC decoding. IEEE Trans. Commun. 57(7): 1982-1985 (2009) - [i2]Samuel Ouzan, Yair Be'ery:
Moderate-Density Parity-Check Codes. CoRR abs/0911.3262 (2009) - [i1]Alex Yufit, Asi Lifshitz, Yair Be'ery:
Efficient Linear Programming Decoding of HDPC Codes. CoRR abs/0912.3907 (2009) - 2005
- [j32]Amir Krause, Assaf Sella, Yair Be'ery:
Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product Codes. EURASIP J. Adv. Signal Process. 2005(6): 795-807 (2005) - 2004
- [j31]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) - [j30]Yaron Shany, Yair Be'ery:
A note on nonlinear Xing codes. IEEE Trans. Inf. Theory 50(4): 699-700 (2004) - 2001
- [j29]Assaf Sella, Yair Be'ery:
Convergence analysis of turbo decoding of product codes. IEEE Trans. Inf. Theory 47(2): 723-735 (2001) - [j28]Ofer Amrani, Yair Be'ery:
Reed-Muller codes: Projections onto GF (4) and multilevel construction. IEEE Trans. Inf. Theory 47(6): 2560-2565 (2001) - 2000
- [j27]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) - [j26]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
- [j25]Ilan Reuven, Yair Be'ery:
Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation. IEEE Trans. Inf. Theory 45(2): 713-720 (1999) - [j24]Eran Fishler, Ofer Amrani, Yair Be'ery:
Geometrical and performance analysis of GMD and Chase decoding algorithms. IEEE Trans. Inf. Theory 45(5): 1406-1422 (1999) - [j23]Ilan Reuven, Yair Be'ery:
The weighted coordinates bound and trellis complexity of block codes and periodic packings. IEEE Trans. Inf. Theory 45(5): 1658-1667 (1999) - [j22]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
- [j21]Ilan Reuven, Yair Be'ery:
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes. IEEE Trans. Inf. Theory 44(2): 580-598 (1998) - [j20]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) - [j19]Ofer Amrani, Yair Be'ery:
Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest Neighbors. IEEE Trans. Inf. Theory 44(7): 3072-3082 (1998) - 1996
- [j18]Ofer Amrani, Yair Be'ery:
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code. IEEE Trans. Commun. 44(5): 534-537 (1996) - [j17]Yuval Berger, Yair Be'ery:
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes. IEEE Trans. Inf. Theory 42(6): 1817-1827 (1996) - 1995
- [j16]Yuval Berger, Yair Be'ery:
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes. IEEE Trans. Inf. Theory 41(4): 1185-1191 (1995) - 1994
- [j15]Alexander Vardy, Yair Be'ery:
Maximum-likelihood soft decision decoding of BCH codes. IEEE Trans. Inf. Theory 40(2): 546-554 (1994) - [j14]Yuval Berger, Yair Be'ery:
Soft trellis-based decoder for linear block codes. IEEE Trans. Inf. Theory 40(3): 764-773 (1994) - [j13]Ofer Amrani, Yair Be'ery, Alexander Vardy, Feng-Wen Sun, Henk C. A. van Tilborg:
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions. IEEE Trans. Inf. Theory 40(4): 1030-1043 (1994) - 1993
- [j12]Yair Be'ery:
Variable bit-rate methods for low-delay speech coders. Speech Commun. 12(2): 183-192 (1993) - [j11]Hanan Herzberg, Yair Be'ery, Jakov Snyders:
Concatenated multilevel block coded modulation. IEEE Trans. Commun. 41(1): 41-49 (1993) - [j10]Yuval Berger, Yair Be'ery:
Bounds on the trellis size of linear block codes. IEEE Trans. Inf. Theory 39(1): 203-209 (1993) - [j9]Alexander Vardy, Yair Be'ery:
Maximum likelihood decoding of the Leech lattice. IEEE Trans. Inf. Theory 39(4): 1435-1444 (1993) - [c2]Ofer Amrani, Yair Be'ery, Alexander Vardy:
Bounded-Distance Decoding of the Leech Lattice and the Golay Code. Algebraic Coding 1993: 236-248 - 1991
- [j8]Alexander Vardy, Yair Be'ery:
Bit-level soft-decision decoding of Reed-Solomon codes. IEEE Trans. Commun. 39(3): 440-444 (1991) - [j7]Alexander Vardy, Yair Be'ery:
On the problem of finding zero-concurring codewords. IEEE Trans. Inf. Theory 37(1): 180-187 (1991) - [j6]Alexander Vardy, Yair Be'ery:
More efficient soft decoding of the Golay codes. IEEE Trans. Inf. Theory 37(3): 667-672 (1991) - 1990
- [j5]Baruch Nissenbaum, Yair Be'ery:
Systool-systolic array programming tool. Microprocessing and Microprogramming 28(1-5): 69-73 (1990) - [c1]Raziel Haimi-Cohen, Hanan Herzberg, Yair Be'ery:
Delayed adaptive LMS filtering: current results. ICASSP 1990: 1273-1276
1980 – 1989
- 1989
- [j4]P. Pardo, Yair Be'ery:
SPL - A different high level language for systolic processors. Microprocess. Microprogramming 25(1-5): 79-83 (1989) - [j3]Yair Be'ery, Boaz Shahar, Jakov Snyders:
Fast decoding of the Leech lattice. IEEE J. Sel. Areas Commun. 7(6): 959-967 (1989) - [j2]Jakov Snyders, Yair Be'ery:
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes. IEEE Trans. Inf. Theory 35(5): 963-975 (1989) - 1986
- [j1]Yair Be'ery, Jakov Snyders:
Optimal soft decision block decoders based on fast Hadamard transform. IEEE Trans. Inf. Theory 32(3): 355-364 (1986)
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 2025-01-09 13:04 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:
