Yair Be ery - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2011

Efficient Linear Programming Decoding of HDPC CodesAlex Yufit, Asi Lifshitz, Yair Be ery. tcom, 59(3):758-766, 2011. [doi]

2009

Improved random redundant iterative HDPC decodingIlan Dimnik, Yair Be ery. tcom, 57(7):1982-1985, 2009. [doi]

2005

Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product CodesAmir Krause, Assaf Sella, Yair Be ery. ejasp, 2005(6):795-807, 2005. [doi]

2004

A note on nonlinear Xing codesYaron Shany, Yair Be ery. TIT, 50(4):699-700, 2004.

Lower bounds on the state complexity of linear tail-biting trellisesYaron Shany, Ilan Reuven, Yair Be ery. TIT, 20(3):566-571, 2004.

2001

Reed-Muller codes: Projections onto GF (4) and multilevel constructionOfer Amrani, Yair Be ery. TIT, 47(6):2560-2565, 2001.

Convergence analysis of turbo decoding of product codesAssaf Sella, Yair Be ery. TIT, 47(2):723-735, 2001.

2000

Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codesYaron Shany, Yair Be ery. TIT, 46(4):1514-1523, 2000.

Bounds on the state complexity of codes from the Hermitian function field and its subfieldsYaron Shany, Yair Be ery. TIT, 46(4):1523-1527, 2000.

1999

Geometrical and performance analysis of GMD and Chase decoding algorithmsEran Fishler, Ofer Amrani, Yair Be ery. TIT, 45(5):1406-1422, 1999.

The weighted coordinates bound and trellis complexity of block codes and periodic packingsIlan Reuven, Yair Be ery. TIT, 45(5):1658-1667, 1999.

Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z::4::-Linear RepresentationIlan Reuven, Yair Be ery. TIT, 45(2):713-720, 1999.

The Preparata and Goethals codes: Trellis complexity and twisted squaring constructionsYaron Shany, Yair Be ery. TIT, 45(5):1667-1673, 1999.

1998

Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest NeighborsOfer Amrani, Yair Be ery. TIT, 44(7):3072-3082, 1998.

Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear CodesIlan Reuven, Yair Be ery. TIT, 44(2):580-598, 1998.

On the Trellis Representation of the Delsarte-Goethals CodesYaron Shany, Ilan Reuven, Yair Be ery. TIT, 44(4):1547-1554, 1998.

1996

The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codesYuval Berger, Yair Be ery. TIT, 42(6):1817-1827, 1996.

1995

Trellis-oriented decomposition and trellis complexity of composite-length cyclic codesYuval Berger, Yair Be ery. TIT, 41(4):1185-1191, 1995.

1994

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructionsOfer Amrani, Yair Be ery, Alexander Vardy, Feng-Wen Sun, Henk C. A. van Tilborg. TIT, 40(4):1030-1043, 1994.

Soft trellis-based decoder for linear block codesYuval Berger, Yair Be ery. TIT, 40(3):764-773, 1994.

Maximum-likelihood soft decision decoding of BCH codesAlexander Vardy, Yair Be ery. TIT, 40(2):546, 1994.

1993

Bounded-Distance Decoding of the Leech Lattice and the Golay CodeOfer Amrani, Yair Be ery, Alexander Vardy. fiwac 1993: 236-248

Bounds on the trellis size of linear block codesYuval Berger, Yair Be ery. TIT, 39(1):203, 1993.

Variable bit-rate methods for low-delay speech codersYair Be ery. speech, 12(2):183-192, 1993. [doi]

Maximum likelihood decoding of the Leech latticeAlexander Vardy, Yair Be ery. TIT, 39(4):1435, 1993.

1991

More efficient soft decoding of the Golay codesAlexander Vardy, Yair Be ery. TIT, 37(3):667, 1991.

On the problem of finding zero-concurring codewordsAlexander Vardy, Yair Be ery. TIT, 37(1):180, 1991.

1989

Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesJakov Snyders, Yair Be ery. TIT, 35(5):963-975, 1989.

1986

Optimal soft decision block decoders based on fast Hadamard transformYair Be ery, Jakov Snyders. TIT, 32(3):355-364, 1986.

Sign in or sign up to see more results.

runs on WebDSL