Journal Publications

  • I. Be’ery, N. Raviv, T. Raviv and Y. Be’ery, “Active Deep Decoding of Linear Codes”, submitted for publication, arXiv:1906.02778, June 2019. Link
  • E. Nachmani, E. Marciano, L. Lugosch, W.J. Gross, D. Burshtein, and Y. Be'ery, "Deep Learning Methods for Improved Decoding of Linear Codes", IEEE Journal of Selected Topics in Signal Processing: Special Issue on Machine Learning for Cognition in Radio Communications and Radar (ML-CR2), Vol. 12, pp. 119-131,  arXiv:1706.07043, February 2018. Link
  • L. Gispan, A., Y. Be’eryDecentralized estimation of regression coefficients in sensor networks”, Digital Signal Processing, Vol. 68, pp. 16-23, September Link
  • G. Oxman, S. Weiss and Y. Be'ery, Computational methods for Conway's Game of Life cellular automaton, Journal of Computational Science, August 2013 Link
  • O. Gidon and Y. Be'ery, On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes, IEEE Trans. on Communications, Vol. 61, pp. 1684-1694, May 2013. Link
  • A. Lifshitz and Y. Be'ery, On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes, IEEE Trans. on Communications, Vol. 60, pp. 963-971, April 2012. Link
  • Alex Yufit, Asi Lifshitz and Yair Be'ery, Efficient Linear Programming Decoding of HDPC Codes, IEEE Transactions on Communications, vol. 59, no. 3, pp. 758 - 766, March 2011. Link
  • S. Ouzan and Y. Be'ery, Moderate-Density Parity-Check Codes, submitted to IEEE Transactions on Communications, September 2009. Link
  • Ilan Dimnik and Yair Be’ery, Improved random redundant iterative HDPC decoding, IEEE Transactions on Communications, vol. 57, no. 7, pp. 1982-1985, July 2009. Link
  • A. Krause, A. Sella and Y. Be’ery, "Convergence analysis of turbo-decoding of serially concatenated block codes and product codes", EURASIP J. on Applied Signal Processing, Vol. 2005, pp. 795-807, June 2005. Link
  • Y. Shany and Y. Be'ery, "A Note on Nonlinear Xing Codes", IEEE Trans. on Information Theory, Vol. 50, pp. 699-700, April 2004. Link
  • Y. Shany, I. Reuven and Y. Be'ery, "Lower bounds on the state complexity of linear tail-biting trellises", IEEE Trans. on Information Theory, Vol. 50, pp. 566-571, March 2004. Link
  • O. Amrani and Y. Be'ery, "Reed-Muller codes: Projecting onto GF(4) and multilevel construction", IEEE Trans. on Information Theory, Vol. 47, pp. 2560-2565, September 2001. Link
  • A. Sella and Y. Be’ery, "Convergence analysis of turbo-decoding of product codes", IEEE Trans. on Information Theory, Vol. 47, pp. 723-735, February 2001. Link
  • Y. Shany and Y. Be'ery, "Bounds on the state complexity of codes from the Hermitian function field and its subfields”, IEEE Trans. on Information Theory, Vol. 46, pp. 1523-1527, July 2000. Link
  • Y. Shany and Y. Be'ery, "Linear tail-biting trellises, the square root bound, and applications for Reed-Muller codes", IEEE Trans. on Information Theory, Vol. 46, pp. 1514-1523, July 2000. Link
  • I. Reuven and Y. Be'ery, "Tail-biting trellises of block codes: trellis complexity and Viterbi decoding complexity", IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science, Vol. E82A, pp. 2043-2051, October 1999. Link
  • Y. Shany and Y. Be'ery, "The Preparata and Goethals codes: trellis complexity and twisted squaring construction", IEEE Trans. on Information Theory, Vol. 45, pp. 1667-1673, July 1999. Link
  • I. Reuven and Y. Be'ery, "The weighted-coordinates bound and trellis complexity of block codes and periodic packings", IEEE Trans. on Information Theory, Vol. 45, pp. 1658-1667, July 1999. Link
  • E. Fishler, O. Amrani and Y. Be'ery, "Geometrical and performance analysis of the GMD and Chase decoding algorithms", IEEE Trans. on Information Theory, Vol. 45, pp. 1406-1422, July 1999. Link
  • O. Amrani and Y. Be'ery, "Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors", IEEE Trans. on Information Theory, Vol. 44, pp. 3072-3082, November 1998. Link
  • Y. Shany, I. Reuven and Y. Be'ery, "On the trellis representation of the Kerdock and Delsarte-Goethals codes", IEEE Trans. on Information Theory, Vol. 44, pp. 1547-1554, July 1998. Link
  • I. Reuven and Y. Be'ery, "Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes", IEEE Trans. on Information Theory, Vol. 44, pp. 580-598, March 1998. Link
  • Y. Berger and Y. Be'ery, "The twisted squaring construction, trellis complexity and generalized weights of BCH and QR codes", IEEE Trans. on Information Theory, Vol. 42, pp. 1817-1827, November 1996. Link
  • O. Amrani and Y. Be'ery, "Efficient bounded distance decoding of the Hexacode and associated decoders for the Leech lattice and the Golay code", IEEE Trans. on Communications, Vol. 44, pp. 534-537, May 1996. Link
  • Y. Berger and Y. Be'ery, "Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes", IEEE Trans. on Information Theory, Vol. 41, pp. 1185-1191, July 1995. Link
  • O. Amrani, Y. Be’ery, A. Vardy, F.-W. Sun, and H.C.A. van Tilborg, "The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions", IEEE Trans. on Information Theory, Vol. 40, pp. 1030-1043, July 1994. Link
  • Y. Berger and Y. Be'ery, "Soft trellis-based decoder for linear block codes", IEEE Trans. on Information Theory, Vol. 40, pp. 764-773, May 1994. Link
  • A. Vardy and Y. Be'ery, "Maximum likelihood soft decision decoding of BCH codes”, IEEE Trans. on Information Theory, Vol. 40, pp. 546-554, March 1994. Link
  • O. Amrani, Y. Be’ery and A. Vardy, "Bounded distance decoding of the Leech lattice and the Golay code", Lecture Notes in Computer Science, Vol. 781, pp. 236-248, 1994. Link
  • S. Berger, Y. Be'ery, B. Ovadia, R. Perets, G. Wertheizer, Y. Gross, "An application specific DSP for speech applications", IEEE Trans. on Consumer Electronics, Vol. 39, pp. 733-739, November 1993. Link
  • A. Vardy and Y. Be'ery, "Maximum likelihood decoding of the Leech lattice", IEEE Trans. on Information Theory, Vol. 39, pp. 1435-1444, July 1993. Link
  • Y. Be'ery, "Variable bit-rate methods for low-delay speech coders", Speech Communications J., Vol. 12, pp. 183-192, June 1993. Link
  • H. Herzberg, Y. Be'ery and J. Snyders, "Concatenated multilevel block coded modulation", IEEE Trans. on Communications, Vol. 41, pp. 41-49, January 1993. Link
  • Y. Berger and Y. Be'ery, "Bounds on the trellis size of linear block codes", IEEE Trans. on Information Theory, Vol. 39, pp. 203-209, January 1993. Link
  • H. Herzberg, R. Haimi-Cohen and Y. Be'ery, "A systolic-array realization of adaptive filters and the effects of delayed adaptation", IEEE Trans. on Signal Processing, Vol. 40, pp. 2799-2803, November 1992. Link
  • A. Vardy and Y. Be'ery, "Even more efficient soft decoding of the Golay codes", IEEE Trans. on Information Theory, Vol. 37, pp. 667-672, May 1991. Link
  • A. Vardy and Y. Be'ery, "Bit level soft decision decoding of Reed-Solomon codes", IEEE Trans. on Communications, Vol. 39, pp. 440-444, March 1991. Link
  • A. Vardy and Y. Be'ery, "On the problem of finding zero-concurring codewords", IEEE Trans. on Information Theory, Vol. 37, pp. 180-187, January 1991. Link
  • A. Vardy, J. Snyders and Y. Be'ery, "Bounds on the dimension of codes and subcodes with prescribed contraction index", Linear Algebra and Its Applications, Vol. 142, pp. 237-261, 1990. Link
  • B. Nissenbaum and Y. Be'ery, "SYSTOOL - Systolic array programming tool", Microprocessing and Microprogramming J., Vol. 28, pp. 69-73, March 1990. Link
  • J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes", IEEE Trans. on Information Theory, Vol. IT-35, No. 5, pp. 963-975, September 1989. Link
  • Y. Be'ery, B. Shahar and J. Snyders, "Fast decoding of the Leech lattice", IEEE J. on Selected Areas in Communications, Vol. SAC-7, No. 8, pp. 959-967, August 1989. Link
  • O. Pardo and Y. Be'ery, "SPL - A different high level language for systolic processors", Microprocessing and Microprogramming J., Vol. 25, pp. 79-83, January 1989. Link
  • Y. Be'ery and J. Snyders , "A recursive Hadamard transform optimal soft-decision decoding algorithm", SIAM J. on Algebraic and Discrete Methods, Vol. 8, No. 4, pp. 778-789, October 1987 Link
  • Y. Be'ery and J. Snyders, "Optimal soft-decision block decoders based on fast Hadamard transform", IEEE Trans. on Information Theory, Vol. IT-32, No. 3, pp. 355-364, May 1986. Link
  • Y. Baram and Y. Be'ery, "Stochastic model simplification", IEEE Trans. on Automatic Control, Vol. AC-26, No. 2, pp. 379-390, April 1981. Link