• Publications
  • Influence
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1 May 1972
TLDR
A maximum-likelihood sequence estimator for a digital pulse-amplitude-modulated sequence in the presence of finite intersymbol interference and white Gaussian noise is developed and performance is shown that performance is effectively as good as could be attained by any receiver structure.
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
TLDR
Improved algorithms are developed to construct good low-density parity-check codes that approach the Shannon limit very closely, especially for rate 1/2.
Convolutional codes I: Algebraic structure
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1 November 1970
TLDR
Minimal encoders are shown to be immune to catastrophic error propagation and, in fact, to lead in a certain sense to the shortest decoded error sequences possible per error event.
Generalized minimum distance decoding
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1 April 1966
TLDR
A new distance measure is introduced which permits likelihood information to be used in algebraic minimum distance decoding techniques and an efficient decoding algorithm is given, and exponential bounds on the probability of not decoding correctly are developed.
Exponential error bounds for erasure, list, and decision feedback schemes
  • G. Forney
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1 March 1968
By an extension of Gallager's bounding methods, exponential error bounds applicable to coding schemes involving erasures, variable-size lists, and decision feedback are obtained. The bounds are
Modulation and Coding for Linear Gaussian Channels
TLDR
This paper surveys how the capacity of the linear Gaussian channel has been met during the past half century, and new capacity-approaching techniques include turbo coding and decoding, multilevel coding, and combined coding/precoding for intersymbol-interference channels.
Sphere-bound-achieving coset codes and multilevel coset codes
TLDR
It is shown that the sphere bound can be approached by a large class ofcoset codes or multilevel coset codes with multistage decoding, including certain binary lattices, andExponential error bounds for coset code bounds are developed, generalizing Poltyrev's (1994) bounds for lattices.
Random codes: minimum distances and error exponents
  • A. Barg, G. Forney
  • Computer Science, Physics
    Proceedings IEEE International Symposium on…
  • 1 September 2002
We consider the average and typical performance of random binary codes of length N and size M=e/sup NR/ from Shannon's random code ensemble (RCE) and from a random linear code ensemble (LCE), on a
Codes on graphs: normal realizations
  • G. Forney
  • Computer Science
    IEEE International Symposium on Information…
  • 25 June 2000
TLDR
This work shows that any Wiberg-type realization may be put into normal form without essential change in its graph or its decoding complexity, and shows that an appropriately defined dual of a group or linear normal realization realizes the dual group orlinear code.
MMSE decision-feedback equalizers and coding. I. Equalization results
The minimum mean-squared-error decision-feedback equalizer (MMSE-DFE) has properties that suggest that it is a canonical equalization structure for systems that combine equalization with coded
...
...