 | 2012 |
|---|
| 34 |       | Ohad Gidon,
Yair Be'ery:
On Pseudocodewords and Improved Union Bound of Linear Programming Decoding of HDPC Codes
CoRR abs/1203.1850: (2012) |
| 33 | | Asi Lifshitz,
Yair Be'ery:
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes.
IEEE Transactions on Communications 60(4): 963-971 (2012) |
| 2011 |
|---|
| 32 | | Asi Lifshitz,
Yair Be'ery:
On Pseudocodewords and Decision Regions of Linear Programming Decoding of HDPC Codes
CoRR abs/1105.2631: (2011) |
| 31 | | Alex Yufit,
Asi Lifshitz,
Yair Be'ery:
Efficient Linear Programming Decoding of HDPC Codes.
IEEE Transactions on Communications 59(3): 758-766 (2011) |
| 2009 |
|---|
| 30 | | Samuel Ouzan,
Yair Be'ery:
Moderate-Density Parity-Check Codes
CoRR abs/0911.3262: (2009) |
| 29 | | Alex Yufit,
Asi Lifshitz,
Yair Be'ery:
Efficient Linear Programming Decoding of HDPC Codes
CoRR abs/0912.3907: (2009) |
| 28 | | Ilan Dimnik,
Yair Be'ery:
Improved random redundant iterative HDPC decoding.
IEEE Transactions on Communications 57(7): 1982-1985 (2009) |
| 2005 |
|---|
| 27 | | Amir Krause,
Assaf Sella,
Yair Be'ery:
Convergence Analysis of Turbo Decoding of Serially Concatenated Block Codes and Product Codes.
EURASIP J. Adv. Sig. Proc. 2005(6): 795-807 (2005) |
| 2004 |
|---|
| 26 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
Lower bounds on the state complexity of linear tail-biting trellises.
IEEE Transactions on Information Theory 20(3): 566-571 (2004) |
| 25 | | Yaron Shany,
Yair Be'ery:
A note on nonlinear Xing codes.
IEEE Transactions on Information Theory 50(4): 699-700 (2004) |
| 2001 |
|---|
| 24 | | Assaf Sella,
Yair Be'ery:
Convergence analysis of turbo decoding of product codes.
IEEE Transactions on Information Theory 47(2): 723-735 (2001) |
| 23 | | Ofer Amrani,
Yair Be'ery:
Reed-Muller codes: Projections onto GF (4) and multilevel construction.
IEEE Transactions on Information Theory 47(6): 2560-2565 (2001) |
| 2000 |
|---|
| 22 | | Yaron Shany,
Yair Be'ery:
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.
IEEE Transactions on Information Theory 46(4): 1514-1523 (2000) |
| 21 | | Yaron Shany,
Yair Be'ery:
Bounds on the state complexity of codes from the Hermitian function field and its subfields.
IEEE Transactions on Information Theory 46(4): 1523-1527 (2000) |
| 1999 |
|---|
| 20 | | Ilan Reuven,
Yair Be'ery:
Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation.
IEEE Transactions on Information Theory 45(2): 713-720 (1999) |
| 19 | | Eran Fishler,
Ofer Amrani,
Yair Be'ery:
Geometrical and performance analysis of GMD and Chase decoding algorithms.
IEEE Transactions on Information Theory 45(5): 1406-1422 (1999) |
| 18 | | Ilan Reuven,
Yair Be'ery:
The weighted coordinates bound and trellis complexity of block codes and periodic packings.
IEEE Transactions on Information Theory 45(5): 1658-1667 (1999) |
| 17 | | Yaron Shany,
Yair Be'ery:
The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions.
IEEE Transactions on Information Theory 45(5): 1667-1673 (1999) |
| 1998 |
|---|
| 16 | | Ilan Reuven,
Yair Be'ery:
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes.
IEEE Transactions on Information Theory 44(2): 580-598 (1998) |
| 15 | | Yaron Shany,
Ilan Reuven,
Yair Be'ery:
On the Trellis Representation of the Delsarte-Goethals Codes.
IEEE Transactions on Information Theory 44(4): 1547-1554 (1998) |
| 14 | | Ofer Amrani,
Yair Be'ery:
Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest Neighbors.
IEEE Transactions on Information Theory 44(7): 3072-3082 (1998) |
| 1996 |
|---|
| 13 | | Yuval Berger,
Yair Be'ery:
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes.
IEEE Transactions on Information Theory 42(6): 1817-1827 (1996) |
| 1995 |
|---|
| 12 | | Yuval Berger,
Yair Be'ery:
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes.
IEEE Transactions on Information Theory 41(4): 1185-1191 (1995) |
| 1994 |
|---|
| 11 | | Alexander Vardy,
Yair Be'ery:
Maximum-likelihood soft decision decoding of BCH codes.
IEEE Transactions on Information Theory 40(2): 546-554 (1994) |
| 10 | | Yuval Berger,
Yair Be'ery:
Soft trellis-based decoder for linear block codes.
IEEE Transactions on Information Theory 40(3): 764-773 (1994) |
| 9 | | 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 Transactions on Information Theory 40(4): 1030-1043 (1994) |
| 1993 |
|---|
| 8 | | Ofer Amrani,
Yair Be'ery,
Alexander Vardy:
Bounded-Distance Decoding of the Leech Lattice and the Golay Code.
Algebraic Coding 1993: 236-248 |
| 7 | | Yuval Berger,
Yair Be'ery:
Bounds on the trellis size of linear block codes.
IEEE Transactions on Information Theory 39(1): 203-209 (1993) |
| 6 | | Alexander Vardy,
Yair Be'ery:
Maximum likelihood decoding of the Leech lattice.
IEEE Transactions on Information Theory 39(4): 1435-1444 (1993) |
| 5 | | Yair Be'ery:
Variable bit-rate methods for low-delay speech coders.
Speech Communication 12(2): 183-192 (1993) |
| 1991 |
|---|
| 4 | | Alexander Vardy,
Yair Be'ery:
On the problem of finding zero-concurring codewords.
IEEE Transactions on Information Theory 37(1): 180-187 (1991) |
| 3 | | Alexander Vardy,
Yair Be'ery:
More efficient soft decoding of the Golay codes.
IEEE Transactions on Information Theory 37(3): 667-672 (1991) |
| 1989 |
|---|
| 2 | | Jakov Snyders,
Yair Be'ery:
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes.
IEEE Transactions on Information Theory 35(5): 963-975 (1989) |
| 1986 |
|---|
| 1 | | Yair Be'ery,
Jakov Snyders:
Optimal soft decision block decoders based on fast Hadamard transform.
IEEE Transactions on Information Theory 32(3): 355-364 (1986) |
Data released under the ODC-BY 1.0 license — See also our legal information page