The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yair Be'ery: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ofer Amrani, Yair Be'ery, Alexander Vardy
    Bounded-Distance Decoding of the Leech Lattice and the Golay Code. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:236-248 [Conf]
  2. Ofer Amrani, Yair Be'ery
    Reed-Muller codes: Projections onto GF (4) and multilevel construction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2560-2565 [Journal]
  3. Ofer Amrani, Yair Be'ery
    Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest Neighbors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3072-3082 [Journal]
  4. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1030-1043 [Journal]
  5. Yair Be'ery, Jakov Snyders
    Optimal soft decision block decoders based on fast Hadamard transform. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:355-364 [Journal]
  6. Yuval Berger, Yair Be'ery
    Bounds on the trellis size of linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:203-0 [Journal]
  7. Yuval Berger, Yair Be'ery
    Soft trellis-based decoder for linear block codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:764-773 [Journal]
  8. Yuval Berger, Yair Be'ery
    Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:4, pp:1185-1191 [Journal]
  9. Yuval Berger, Yair Be'ery
    The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1817-1827 [Journal]
  10. Eran Fishler, Ofer Amrani, Yair Be'ery
    Geometrical and performance analysis of GMD and Chase decoding algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1406-1422 [Journal]
  11. Ilan Reuven, Yair Be'ery
    Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:580-598 [Journal]
  12. Ilan Reuven, Yair Be'ery
    Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:713-720 [Journal]
  13. Ilan Reuven, Yair Be'ery
    The weighted coordinates bound and trellis complexity of block codes and periodic packings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1658-1667 [Journal]
  14. Assaf Sella, Yair Be'ery
    Convergence analysis of turbo decoding of product codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:723-735 [Journal]
  15. Yaron Shany, Yair Be'ery
    Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1514-1523 [Journal]
  16. Yaron Shany, Yair Be'ery
    Bounds on the state complexity of codes from the Hermitian function field and its subfields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1523-1527 [Journal]
  17. Yaron Shany, Yair Be'ery
    A note on nonlinear Xing codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:4, pp:699-700 [Journal]
  18. Yaron Shany, Yair Be'ery
    The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:5, pp:1667-1673 [Journal]
  19. Yaron Shany, Ilan Reuven, Yair Be'ery
    Lower bounds on the state complexity of linear tail-biting trellises. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:566-571 [Journal]
  20. Yaron Shany, Ilan Reuven, Yair Be'ery
    On the Trellis Representation of the Delsarte-Goethals Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1547-1554 [Journal]
  21. Jakov Snyders, Yair Be'ery
    Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:5, pp:963-975 [Journal]
  22. Alexander Vardy, Yair Be'ery
    On the problem of finding zero-concurring codewords. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:1, pp:180-0 [Journal]
  23. Alexander Vardy, Yair Be'ery
    More efficient soft decoding of the Golay codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:667-0 [Journal]
  24. Alexander Vardy, Yair Be'ery
    Maximum likelihood decoding of the Leech lattice. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1435-0 [Journal]
  25. Alexander Vardy, Yair Be'ery
    Maximum-likelihood soft decision decoding of BCH codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:546-0 [Journal]

  26. Moderate-Density Parity-Check Codes [Citation Graph (, )][DBLP]


  27. Efficient Linear Programming Decoding of HDPC Codes [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002