Yair Be'ery

According to our database1, Yair Be'ery authored at least 52 papers between 1986 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Improving Massive MIMO Message Passing Detectors With Deep Neural Network.
IEEE Trans. Veh. Technol., 2020

Active Deep Decoding of Linear Codes.
IEEE Trans. Commun., 2020

Deep Learning-Aided Belief Propagation Decoder for Polar Codes.
IEEE J. Emerg. Sel. Topics Circuits Syst., 2020

Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes.
CoRR, 2020

perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention.
CoRR, 2020

Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2018
Deep Learning Methods for Improved Decoding of Linear Codes.
IEEE J. Sel. Top. Signal Process., 2018

Improving Massive MIMO Belief Propagation Detector with Deep Neural Network.
CoRR, 2018

Near Maximum Likelihood Decoding with Deep Learning.
CoRR, 2018

Joint Neural Network Equalizer and Decoder.
Proceedings of the 15th International Symposium on Wireless Communication Systems, 2018

Polar Decoding on Sparse Graphs with Deep Learning.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017
Decentralized estimation of regression coefficients in sensor networks.
Digit. Signal Process., 2017

RNN Decoding of Linear Block Codes.
CoRR, 2017

2016
Learning to decode linear codes using deep learning.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2014
Computational methods for Conway's Game of Life cellular automaton.
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
Efficient Linear Programming Decoding of HDPC Codes.
IEEE Trans. Commun., 2011

2009
Improved random redundant iterative HDPC decoding.
IEEE Trans. Commun., 2009

Moderate-Density Parity-Check Codes
CoRR, 2009

2005
Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product Codes.
EURASIP J. Adv. Signal Process., 2005

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

2001
Convergence analysis of turbo decoding of product codes.
IEEE Trans. Inf. Theory, 2001

Reed-Muller codes: Projections onto GF (4) and multilevel construction.
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

Geometrical and performance analysis of GMD and Chase decoding algorithms.
IEEE Trans. Inf. Theory, 1999

1998
On the Trellis Representation of the Delsarte-Goethals Codes.
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
Maximum-likelihood soft decision decoding of BCH codes.
IEEE Trans. Inf. Theory, 1994

Soft trellis-based decoder for linear block codes.
IEEE Trans. Inf. Theory, 1994

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.
IEEE Trans. Inf. Theory, 1994

1993
Maximum likelihood decoding of the Leech lattice.
IEEE Trans. Inf. Theory, 1993

Bounds on the trellis size of linear block codes.
IEEE Trans. Inf. Theory, 1993

Concatenated multilevel block coded modulation.
IEEE Trans. Commun., 1993

Variable bit-rate methods for low-delay speech coders.
Speech Commun., 1993

Bounded-Distance Decoding of the Leech Lattice and the Golay Code.
Proceedings of the Algebraic Coding, 1993

1991
More efficient soft decoding of the Golay codes.
IEEE Trans. Inf. Theory, 1991

On the problem of finding zero-concurring codewords.
IEEE Trans. Inf. Theory, 1991

Bit-level soft-decision decoding of Reed-Solomon codes.
IEEE Trans. Commun., 1991

1990
Delayed adaptive LMS filtering: current results.
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

Fast decoding of the Leech lattice.
IEEE J. Sel. Areas Commun., 1989

1986
Optimal soft decision block decoders based on fast Hadamard transform.
IEEE Trans. Inf. Theory, 1986


  Loading...