Citation: Y. Shany et al., ON THE TRELLIS REPRESENTATION OF THE DELSARTE-GOETHALS CODES, IEEE transactions on information theory, 44(4), 1998, pp. 1547-1554
Citation: I. Reuven et Y. Beery, ENTROPY LENGTH PROFILES, BOUNDS ON THE MINIMAL COVERING OF BIPARTITE GRAPHS, AND TRELLIS COMPLEXITY OF NONLINEAR CODES/, IEEE transactions on information theory, 44(2), 1998, pp. 580-598
Citation: O. Amrani et Y. Beery, EFFICIENT BOUNDED-DISTANCE DECODING OF THE HEXACODE AND ASSOCIATED DECODERS FOR THE LEECH LATTICE AND THE GOLAY CODE, IEEE transactions on communications, 44(5), 1996, pp. 534-537
Citation: Y. Berger et Y. Beery, THE TWISTED SQUARING CONSTRUCTION, TRELLIS COMPLEXITY, AND GENERALIZED WEIGHTS OF BCH AND QR CODES, IEEE transactions on information theory, 42(6), 1996, pp. 1817-1827
Citation: Y. Berger et Y. Beery, TRELLIS-ORIENTED DECOMPOSITION AND TRELLIS COMPLEXITY OF COMPOSITE-LENGTH CYCLIC CODES, IEEE transactions on information theory, 41(4), 1995, pp. 1185-1191
Authors:
AMRANI O
BEERY Y
VARDY A
SUN FW
FANTILBORG HCA
Citation: O. Amrani et al., THE LEECH LATTICE AND GOLAY CODE - BOUNDED-DISTANCE DECODING AND MULTILEVEL CONSTRUCTIONS, IEEE transactions on information theory, 40(4), 1994, pp. 1030-1043
Citation: A. Vardy et Y. Beery, MAXIMUM-LIKELIHOOD SOFT DECISION DECODING OF BCH CODES, IEEE transactions on information theory, 40(2), 1994, pp. 546-554