| Publication | Date of Publication | Type |
|---|
A Note on Nonlinear Xing Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Convergence analysis of turbo decoding of serially concatenated block codes and product codes
EURASIP Journal on Applied Signal Processing | 2005-10-28 | Paper |
Efficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
IEEE Transactions on Communications | 2002-09-08 | Paper |
Convergence analysis of turbo decoding of product codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Reed-Muller codes: projections onto GF(4) and multilevel construction
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Bounds on the state complexity of codes from the Hermitian function field and its subfields
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1456829 (Why is no real title available?) | 2000-06-07 | Paper |
Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes
IEEE Transactions on Information Theory | 1999-12-02 | Paper |
Bounded-distance decoding: algorithms, decision regions, and pseudo nearest neighbors
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Generalized Hamming weights of nonlinear codes and the relation to the Z/sub 4/-linear representation
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
The weighted coordinates bound and trellis complexity of block codes and periodic packings
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
The Preparata and Goethals codes: trellis complexity and twisted squaring constructions
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On the trellis representation of the Delsarte-Goethals codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Geometrical and performance analysis of GMD and Chase decoding algorithms
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
IEEE Transactions on Information Theory | 1997-04-27 | Paper |
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
IEEE Transactions on Information Theory | 1996-02-04 | Paper |
Soft trellis-based decoder for linear block codes
IEEE Transactions on Information Theory | 1995-11-15 | Paper |
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Maximum-likelihood soft decision decoding of BCH codes
IEEE Transactions on Information Theory | 1994-10-10 | Paper |
Maximum likelihood decoding of the Leech lattice
IEEE Transactions on Information Theory | 1994-10-04 | Paper |
Concatenated multilevel block coded modulation
IEEE Transactions on Communications | 1993-08-16 | Paper |
Bounds on the trellis size of linear block codes
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
Bit-level soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Communications | 1992-06-27 | Paper |
On the problem of finding zero-concurring codewords
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Bounds on the dimension of codes and subcodes with prescribed contraction index
Linear Algebra and its Applications | 1990-01-01 | Paper |
Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A Recursive Hadamard Transform Optimal Soft Decision Decoding Algorithm
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Optimal soft decision block decoders based on fast Hadamard transform
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
