Yair Be'ery
Orcid: 0000-0001-9642-8391
According to our database1,
Yair Be'ery
authored at least 59 papers
between 1986 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the IEEE International Conference on Acoustics, 2024
2022
An active approach towards monitoring and enhancing drivers' capabilities - the ADAM cogtec solution.
CoRR, 2022
2021
perm2vec: Attentive Graph Permutation Selection for Decoding of Error Correction Codes.
IEEE J. Sel. Areas Commun., 2021
Entropy, 2021
2020
IEEE Trans. Veh. Technol., 2020
IEEE J. Emerg. Sel. Topics Circuits Syst., 2020
perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention.
CoRR, 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019
2018
IEEE J. Sel. Top. Signal Process., 2018
CoRR, 2018
Proceedings of the 15th International Symposium on Wireless Communication Systems, 2018
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018
2017
Digit. Signal Process., 2017
2016
Proceedings of the 54th Annual Allerton Conference on Communication, 2016
2014
J. Comput. Sci., 2014
2013
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes.
IEEE Trans. Commun., 2013
2012
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes.
IEEE Trans. Commun., 2012
2011
2009
2005
Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product Codes.
EURASIP J. Adv. Signal Process., 2005
2004
IEEE Trans. Inf. Theory, 2004
2001
IEEE Trans. Inf. Theory, 2001
IEEE Trans. Inf. Theory, 2001
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
The weighted coordinates bound and trellis complexity of block codes and periodic packings.
IEEE Trans. Inf. Theory, 1999
Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z<sub>4</sub>-Linear Representation.
IEEE Trans. Inf. Theory, 1999
IEEE Trans. Inf. Theory, 1999
1998
IEEE Trans. Inf. Theory, 1998
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes.
IEEE Trans. Inf. Theory, 1998
Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest Neighbors.
IEEE Trans. Inf. Theory, 1998
1996
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes.
IEEE Trans. Inf. Theory, 1996
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code.
IEEE Trans. Commun., 1996
1995
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes.
IEEE Trans. Inf. Theory, 1995
1994
IEEE Trans. Inf. Theory, 1994
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.
IEEE Trans. Inf. Theory, 1994
1993
Proceedings of the Algebraic Coding, 1993
1991
1990
Proceedings of the 1990 International Conference on Acoustics, 1990
1989
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes.
IEEE Trans. Inf. Theory, 1989
Microprocess. Microprogramming, 1989
1986
IEEE Trans. Inf. Theory, 1986