G. David Forney Jr.

Orcid: 0000-0003-1711-5974

Affiliations:
  • Massachusetts Institute of Technology, Cambridge, USA


According to our database1, G. David Forney Jr. authored at least 78 papers between 1965 and 2018.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1973, "For contributions to the theory and practice of error-correcting codes and data communications".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Codes on Graphs: Models for Elementary Algebraic Topology and Statistical Physics.
IEEE Trans. Inf. Theory, 2018

2015
Unique factorization and controllability of tail-biting trellis realizations via controller granule decompositions.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Codes on Graphs: Fundamentals.
IEEE Trans. Inf. Theory, 2014

2013
Local Irreducibility of Tail-Biting Trellises.
IEEE Trans. Inf. Theory, 2013

Codes on Graphs: Observability, Controllability, and Local Reducibility.
IEEE Trans. Inf. Theory, 2013

2012
Reducing complexity of tail-biting trellises.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Observability, controllability and local reducibility of linear codes on graphs.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Codes on graphs: Past, present and future.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Codes on Graphs: Duality and MacWilliams Identities.
IEEE Trans. Inf. Theory, 2011

Minimal Realizations of Linear Systems: The "Shortest Basis" Approach.
IEEE Trans. Inf. Theory, 2011

Partition Functions of Normal Factor Graphs
CoRR, 2011

2010
MacWilliams identities for terminated convolutional codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Concatenated codes.
Scholarpedia, 2009

Codes on graphs: MacWilliams identities
CoRR, 2009

MacWilliams Identities for Codes on Graphs
CoRR, 2009

2007
Convolutional and Tail-Biting Quantum Error-Correcting Codes.
IEEE Trans. Inf. Theory, 2007

Channel coding: The road to channel capacity.
Proc. IEEE, 2007

2005
The Viterbi Algorithm: A Personal History
CoRR, 2005

Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
The dynamics of group codes: Dual abelian group codes and systems.
IEEE Trans. Inf. Theory, 2004

V.92: the last dial-up modem?
IEEE Trans. Commun., 2004

On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener
CoRR, 2004

Shannon meets Wiener II: On MMSE estimation in successive decoding schemes
CoRR, 2004

2003
Codes on graphs: constraint complexity of cycle-free realizations of linear codes.
IEEE Trans. Inf. Theory, 2003

Syndrome realizations of linear codes and systems.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
Optimal tight frames and quantum measurement.
IEEE Trans. Inf. Theory, 2002

Random codes: Minimum distances and error exponents.
IEEE Trans. Inf. Theory, 2002

2001
Introduction to the special issue on codes on graphs and iterative algorithms.
IEEE Trans. Inf. Theory, 2001

Codes on graphs: Normal realizations.
IEEE Trans. Inf. Theory, 2001

On quantum detection and the square-root measurement.
IEEE Trans. Inf. Theory, 2001

On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit.
IEEE Commun. Lett., 2001

2000
Sphere-bound-achieving coset codes and multilevel coset codes.
IEEE Trans. Inf. Theory, 2000

1999
Minimal tail-biting trellises: The Golay code and more.
IEEE Trans. Inf. Theory, 1999

Codes on Graphs: A Survey for Algebraists.
Proceedings of the Applied Algebra, 1999

1998
Modulation and Coding for Linear Gaussian Channels.
IEEE Trans. Inf. Theory, 1998

1996
Generalized minimum-distance decoding of Euclidean-space codes and lattices.
IEEE Trans. Inf. Theory, 1996

Minimal and canonical rational generator matrices for convolutional codes.
IEEE Trans. Inf. Theory, 1996

Introduction to the special issue on codes and complexity.
IEEE Trans. Inf. Theory, 1996

The V.34 high-speed modem standard.
IEEE Commun. Mag., 1996

1995
MMSE decision-feedback equalizers and coding. II. Coding results.
IEEE Trans. Commun., 1995

MMSE decision-feedback equalizers and coding. I. Equalization results.
IEEE Trans. Commun., 1995

1994
Density/length profiles and trellis complexity of lattices codes.
IEEE Trans. Inf. Theory, 1994

Dimension/length profiles and trellis complexity of linear block codes.
IEEE Trans. Inf. Theory, 1994

1993
The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders.
IEEE Trans. Inf. Theory, 1993

Lattice and trellis quantization with lattice- and trellis-bounded codebooks - High-rate theory for memoryless sources.
IEEE Trans. Inf. Theory, 1993

Advanced Modulation Techniques for V.Fast.
Eur. Trans. Telecommun., 1993

1992
On the Hamming distance properties of group codes.
IEEE Trans. Inf. Theory, 1992

Trellis shaping.
IEEE Trans. Inf. Theory, 1992

Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels.
IEEE Trans. Inf. Theory, 1992

The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode.
Proceedings of the Coding And Quantization, 1992

On the Duality of Coding and Quantizing.
Proceedings of the Coding And Quantization, 1992

Preface.
Proceedings of the Coding And Quantization, 1992

1991
Geometrically uniform codes.
IEEE Trans. Inf. Theory, 1991

Combined equalization and coding using precoding.
IEEE Commun. Mag., 1991

1990
Review of 'Sphere Packings, Lattices and Groups' (Conway, J.H., and Sloane, N.J.A.; 1988).
IEEE Trans. Inf. Theory, 1990

1989
Coset codes for partial response channels; or, coset codes with spectral nulls.
IEEE Trans. Inf. Theory, 1989

A bounded-distance decoding algorithm for the Leech lattice, with generalizations.
IEEE Trans. Inf. Theory, 1989

Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations.
IEEE J. Sel. Areas Commun., 1989

Multidimensional constellations. II. Voronoi constellations.
IEEE J. Sel. Areas Commun., 1989

1988
Coset codes-II: Binary lattices and related codes.
IEEE Trans. Inf. Theory, 1988

Coset codes-I: Introduction and geometrical classification.
IEEE Trans. Inf. Theory, 1988

1984
Efficient Modulation for Band-Limited Channels.
IEEE J. Sel. Areas Commun., 1984

1976
The codex 6000 series of intelligent network processors.
Comput. Commun. Rev., 1976

1975
Our reviewers.
IEEE Trans. Inf. Theory, 1975

1974
Convolutional Codes III. Sequential Decoding
Inf. Control., July, 1974

Convolutional Codes II. Maximum-Likelihood Decoding
Inf. Control., July, 1974

1973
Structural analysis of convolutional codes via dual codes.
IEEE Trans. Inf. Theory, 1973

Editorial.
IEEE Trans. Inf. Theory, 1973

1972
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference.
IEEE Trans. Inf. Theory, 1972

Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference.
IEEE Trans. Commun., 1972

1971
Arthur Kohlenberg 1924-1970 (Obituary).
IEEE Trans. Inf. Theory, 1971

Correction to 'Convolution Codes I: Algebraic Structure'.
IEEE Trans. Inf. Theory, 1971

1970
Use of a sequential decoder to analyze convolutional code structure (Corresp.).
IEEE Trans. Inf. Theory, 1970

Convolutional codes I: Algebraic structure.
IEEE Trans. Inf. Theory, 1970

1968
Convolutional coding for channels with memory.
IEEE Trans. Inf. Theory, 1968

Exponential error bounds for erasure, list, and decision feedback schemes.
IEEE Trans. Inf. Theory, 1968

1966
Generalized minimum distance decoding.
IEEE Trans. Inf. Theory, 1966

1965
On decoding BCH codes.
IEEE Trans. Inf. Theory, 1965


  Loading...