default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. David Forney Jr.
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, USA
- award (2016): IEEE Medal of Honor
- award (1997): Marconi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j61]G. David Forney Jr.
:
Codes on Graphs: Models for Elementary Algebraic Topology and Statistical Physics. IEEE Trans. Inf. Theory 64(12): 7465-7487 (2018)- 2017
- [i19]G. David Forney Jr.:
Codes on graphs: Models for elementary algebraic topology and statistical physics. CoRR abs/1707.06621 (2017) - 2015
- [c11]G. David Forney Jr.:
Unique factorization and controllability of tail-biting trellis realizations via controller granule decompositions. ITW 2015: 1-5 - [i18]G. David Forney Jr.:
Unique Factorization and Controllability of Tail-Biting Trellis Realizations via Controller Granule Decompositions. CoRR abs/1502.06491 (2015) - 2014
- [j60]G. David Forney Jr.:
Codes on Graphs: Fundamentals. IEEE Trans. Inf. Theory 60(10): 5809-5826 (2014) - 2013
- [j59]G. David Forney Jr., Heide Gluesing-Luerssen:
Codes on Graphs: Observability, Controllability, and Local Reducibility. IEEE Trans. Inf. Theory 59(1): 223-237 (2013) - [j58]Heide Gluesing-Luerssen, G. David Forney Jr.:
Local Irreducibility of Tail-Biting Trellises. IEEE Trans. Inf. Theory 59(10): 6597-6610 (2013) - [i17]G. David Forney Jr.:
Codes on Graphs: Fundamentals. CoRR abs/1306.6264 (2013) - 2012
- [c10]G. David Forney Jr.:
Codes on graphs: Past, present and future. Allerton Conference 2012: 319-325 - [c9]G. David Forney Jr., Heide Gluesing-Luerssen:
Observability, controllability and local reducibility of linear codes on graphs. ISIT 2012: 641-645 - [c8]Heide Gluesing-Luerssen, G. David Forney Jr.:
Reducing complexity of tail-biting trellises. ISIT 2012: 646-650 - [i16]G. David Forney Jr., Heide Gluesing-Luerssen:
Observability, Controllability and Local Reducibility of Linear Codes on Graphs. CoRR abs/1202.0534 (2012) - [i15]Heide Gluesing-Luerssen, G. David Forney Jr.:
Reducing complexity of tail-biting trellises. CoRR abs/1202.1336 (2012) - [i14]G. David Forney Jr., Heide Gluesing-Luerssen:
Codes on Graphs: Observability, Controllability and Local Reducibility. CoRR abs/1203.3115 (2012) - [i13]Heide Gluesing-Luerssen, G. David Forney Jr.:
Local Irreducibility of Tail-Biting Trellises. CoRR abs/1212.3621 (2012) - 2011
- [j57]G. David Forney Jr.:
Minimal Realizations of Linear Systems: The "Shortest Basis" Approach. IEEE Trans. Inf. Theory 57(2): 726-737 (2011) - [j56]G. David Forney Jr.:
Codes on Graphs: Duality and MacWilliams Identities. IEEE Trans. Inf. Theory 57(3): 1382-1397 (2011) - [i12]G. David Forney Jr., Pascal O. Vontobel:
Partition Functions of Normal Factor Graphs. CoRR abs/1102.0316 (2011) - 2010
- [c7]G. David Forney Jr.:
MacWilliams identities for terminated convolutional codes. ISIT 2010: 1105-1109 - [i11]G. David Forney Jr.:
MacWilliams Identities for Terminated Convolutional Codes. CoRR abs/1001.0723 (2010)
2000 – 2009
- 2009
- [j55]Dave Forney:
Concatenated codes. Scholarpedia 4(2): 8374 (2009) - [i10]G. David Forney Jr.:
MacWilliams Identities for Codes on Graphs. CoRR abs/0903.4207 (2009) - [i9]G. David Forney Jr.:
Minimal realizations of linear systems: The "shortest basis" approach. CoRR abs/0910.4336 (2009) - [i8]G. David Forney Jr.:
Codes on graphs: MacWilliams identities. CoRR abs/0911.5508 (2009) - 2007
- [j54]Daniel J. Costello Jr., G. David Forney Jr.:
Channel coding: The road to channel capacity. Proc. IEEE 95(6): 1150-1177 (2007) - [j53]G. David Forney Jr., Markus Grassl, Saikat Guha:
Convolutional and Tail-Biting Quantum Error-Correcting Codes. IEEE Trans. Inf. Theory 53(3): 865-880 (2007) - 2006
- [i7]Daniel J. Costello Jr., G. David Forney Jr.:
Channel Coding: The Road to Channel Capacity. CoRR abs/cs/0611112 (2006) - 2005
- [c6]G. David Forney Jr., Saikat Guha:
Simple rate-1/3 convolutional and tail-biting quantum error-correcting codes. ISIT 2005: 1028-1032 - [i6]G. David Forney Jr.:
The Viterbi Algorithm: A Personal History. CoRR abs/cs/0504020 (2005) - [i5]G. David Forney Jr., Saikat Guha:
Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting Codes. CoRR abs/quant-ph/0501099 (2005) - [i4]G. David Forney Jr., Markus Grassl, Saikat Guha:
Convolutional and tail-biting quantum error-correcting codes. CoRR abs/quant-ph/0511016 (2005) - 2004
- [j52]Dae-Young Kim, Pierre A. Humblet, M. Vedat Eyuboglu, Les Brown, G. David Forney Jr., Sepehr Mehrabanzad:
V.92: the last dial-up modem? IEEE Trans. Commun. 52(1): 54-61 (2004) - [j51]G. David Forney Jr., Mitchell D. Trott:
The dynamics of group codes: Dual abelian group codes and systems. IEEE Trans. Inf. Theory 50(12): 2935-2965 (2004) - [i3]G. David Forney Jr., Mitchell D. Trott:
The Dynamics of Group Codes: Dual Abelian Group Codes and Systems. CoRR cs.IT/0408038 (2004) - [i2]G. David Forney Jr.:
Shannon meets Wiener II: On MMSE estimation in successive decoding schemes. CoRR cs.IT/0409011 (2004) - [i1]G. David Forney Jr.:
On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener. CoRR cs.IT/0409053 (2004) - 2003
- [j50]G. David Forney Jr.:
Codes on graphs: constraint complexity of cycle-free realizations of linear codes. IEEE Trans. Inf. Theory 49(7): 1597-1610 (2003) - [c5]G. David Forney Jr.:
Syndrome realizations of linear codes and systems. ITW 2003: 214-217 - 2002
- [j49]Yonina C. Eldar, G. David Forney Jr.:
Optimal tight frames and quantum measurement. IEEE Trans. Inf. Theory 48(3): 599-610 (2002) - [j48]Alexander Barg, G. David Forney Jr.:
Random codes: Minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9): 2568-2573 (2002) - 2001
- [j47]Sae-Young Chung, G. David Forney Jr., Thomas J. Richardson, Rüdiger L. Urbanke:
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun. Lett. 5(2): 58-60 (2001) - [j46]Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman:
Introduction to the special issue on codes on graphs and iterative algorithms. IEEE Trans. Inf. Theory 47(2): 493-497 (2001) - [j45]G. David Forney Jr.:
Codes on graphs: Normal realizations. IEEE Trans. Inf. Theory 47(2): 520-548 (2001) - [j44]Yonina C. Eldar, G. David Forney Jr.:
On quantum detection and the square-root measurement. IEEE Trans. Inf. Theory 47(3): 858-872 (2001) - 2000
- [j43]G. David Forney Jr., Mitchell D. Trott, Sae-Young Chung:
Sphere-bound-achieving coset codes and multilevel coset codes. IEEE Trans. Inf. Theory 46(3): 820-850 (2000)
1990 – 1999
- 1999
- [j42]A. Robert Calderbank, G. David Forney Jr., Alexander Vardy:
Minimal tail-biting trellises: The Golay code and more. IEEE Trans. Inf. Theory 45(5): 1435-1455 (1999) - [c4]G. David Forney Jr.:
Codes on Graphs: A Survey for Algebraists. AAECC 1999: 1-9 - 1998
- [j41]G. David Forney Jr., Gottfried Ungerboeck:
Modulation and Coding for Linear Gaussian Channels. IEEE Trans. Inf. Theory 44(6): 2384-2415 (1998) - 1996
- [j40]G. David Forney Jr., Les Brown, M. Vedat Eyuboglu, John L. Moran III:
The V.34 high-speed modem standard. IEEE Commun. Mag. 34(12): 28-33 (1996) - [j39]Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy:
Introduction to the special issue on codes and complexity. IEEE Trans. Inf. Theory 42(6): 1649-1659 (1996) - [j38]G. David Forney Jr., Rolf Johannesson, Zhe-xian Wan:
Minimal and canonical rational generator matrices for convolutional codes. IEEE Trans. Inf. Theory 42(6): 1865-1880 (1996) - [j37]G. David Forney Jr., Alexander Vardy:
Generalized minimum-distance decoding of Euclidean-space codes and lattices. IEEE Trans. Inf. Theory 42(6): 1992-2026 (1996) - 1995
- [j36]John M. Cioffi, Glen P. Dudevoir, M. Vedat Eyuboglu, G. David Forney Jr.:
MMSE decision-feedback equalizers and coding. I. Equalization results. IEEE Trans. Commun. 43(10): 2582-2594 (1995) - [j35]John M. Cioffi, Glen P. Dudevoir, M. Vedat Eyuboglu, G. David Forney Jr.:
MMSE decision-feedback equalizers and coding. II. Coding results. IEEE Trans. Commun. 43(10): 2595-2604 (1995) - 1994
- [j34]G. David Forney Jr.:
Dimension/length profiles and trellis complexity of linear block codes. IEEE Trans. Inf. Theory 40(6): 1741-1752 (1994) - [j33]G. David Forney Jr.:
Density/length profiles and trellis complexity of lattices codes. IEEE Trans. Inf. Theory 40(6): 1753-1772 (1994) - 1993
- [j32]M. Vedat Eyuboglu, G. David Forney Jr., Ping Dong, Guozhu Long:
Advanced Modulation Techniques for V.Fast. Eur. Trans. Telecommun. 4(3): 243-256 (1993) - [j31]M. Vedat Eyuboglu, G. David Forney Jr.:
Lattice and trellis quantization with lattice- and trellis-bounded codebooks - High-rate theory for memoryless sources. IEEE Trans. Inf. Theory 39(1): 46-59 (1993) - [j30]G. David Forney Jr., Mitchell D. Trott:
The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders. IEEE Trans. Inf. Theory 39(5): 1491-1513 (1993) - [e1]A. Robert Calderbank, G. David Forney Jr., Nader Moayeri:
Coding And Quantization, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, October 19-21, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 14, DIMACS/AMS 1993, ISBN 978-0-8218-6603-0 [contents] - 1992
- [j29]G. David Forney Jr.:
Trellis shaping. IEEE Trans. Inf. Theory 38(2): 281-300 (1992) - [j28]M. Vedat Eyuboglu, G. David Forney Jr.:
Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels. IEEE Trans. Inf. Theory 38(2): 301-314 (1992) - [j27]G. David Forney Jr.:
On the Hamming distance properties of group codes. IEEE Trans. Inf. Theory 38(6): 1797-1801 (1992) - [c3]G. David Forney Jr.:
On the Duality of Coding and Quantizing. Coding And Quantization 1992: 1-14 - [c2]G. David Forney Jr., Neil J. A. Sloane, Mitchell D. Trott:
The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode. Coding And Quantization 1992: 19-26 - [c1]A. Robert Calderbank, G. David Forney Jr., Nader Moayeri:
Preface. Coding And Quantization 1992: xi- - 1991
- [j26]G. David Forney Jr., M. Vedat Eyuboglu:
Combined equalization and coding using precoding. IEEE Commun. Mag. 29(12): 25-34 (1991) - [j25]G. David Forney Jr.:
Geometrically uniform codes. IEEE Trans. Inf. Theory 37(5): 1241-1260 (1991) - 1990
- [j24]G. David Forney Jr.:
Review of 'Sphere Packings, Lattices and Groups' (Conway, J.H., and Sloane, N.J.A.; 1988). IEEE Trans. Inf. Theory 36(4): 955- (1990)
1980 – 1989
- 1989
- [j23]G. David Forney Jr., Lee-Fang Wei:
Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations. IEEE J. Sel. Areas Commun. 7(6): 877-892 (1989) - [j22]G. David Forney Jr.:
Multidimensional constellations. II. Voronoi constellations. IEEE J. Sel. Areas Commun. 7(6): 941-958 (1989) - [j21]G. David Forney Jr.:
A bounded-distance decoding algorithm for the Leech lattice, with generalizations. IEEE Trans. Inf. Theory 35(4): 906-909 (1989) - [j20]G. David Forney Jr., A. Robert Calderbank:
Coset codes for partial response channels; or, coset codes with spectral nulls. IEEE Trans. Inf. Theory 35(5): 925-943 (1989) - 1988
- [j19]G. David Forney Jr.:
Coset codes-I: Introduction and geometrical classification. IEEE Trans. Inf. Theory 34(5): 1123-1151 (1988) - [j18]G. David Forney Jr.:
Coset codes-II: Binary lattices and related codes. IEEE Trans. Inf. Theory 34(5): 1152-1187 (1988) - 1984
- [j17]G. David Forney Jr., Robert G. Gallager, Gordon R. Lang, Fred M. Longstaff, Shahid U. Qureshi:
Efficient Modulation for Band-Limited Channels. IEEE J. Sel. Areas Commun. 2(5): 632-647 (1984)
1970 – 1979
- 1976
- [j16]G. David Forney Jr., James E. Vander Mey:
The codex 6000 series of intelligent network processors. Comput. Commun. Rev. 6(2): 7-11 (1976) - 1975
- [j15]G. David Forney Jr.:
Our reviewers. IEEE Trans. Inf. Theory 21(1): 2-3 (1975) - 1974
- [j14]G. David Forney Jr.:
Convolutional Codes II. Maximum-Likelihood Decoding. Inf. Control. 25(3): 222-266 (1974) - [j13]G. David Forney Jr.:
Convolutional Codes III. Sequential Decoding. Inf. Control. 25(3): 267-297 (1974) - 1973
- [j12]G. David Forney Jr.:
Editorial. IEEE Trans. Inf. Theory 19(1): 2 (1973) - [j11]G. David Forney Jr.:
Structural analysis of convolutional codes via dual codes. IEEE Trans. Inf. Theory 19(4): 512-518 (1973) - 1972
- [j10]G. David Forney Jr.:
Lower Bounds on Error Probability in the Presence of Large Intersymbol Interference. IEEE Trans. Commun. 20(1): 76-77 (1972) - [j9]G. David Forney Jr.:
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference. IEEE Trans. Inf. Theory 18(3): 363-378 (1972) - 1971
- [j8]Robert G. Gallager, James L. Massey, G. David Forney Jr.:
Arthur Kohlenberg 1924-1970 (Obituary). IEEE Trans. Inf. Theory 17(2): 126 (1971) - [j7]G. David Forney Jr.:
Correction to 'Convolution Codes I: Algebraic Structure'. IEEE Trans. Inf. Theory 17(3): 360 (1971) - 1970
- [j6]G. David Forney Jr.:
Convolutional codes I: Algebraic structure. IEEE Trans. Inf. Theory 16(6): 720-738 (1970) - [j5]G. David Forney Jr.:
Use of a sequential decoder to analyze convolutional code structure (Corresp.). IEEE Trans. Inf. Theory 16(6): 793-795 (1970)
1960 – 1969
- 1968
- [j4]G. David Forney Jr.:
Exponential error bounds for erasure, list, and decision feedback schemes. IEEE Trans. Inf. Theory 14(2): 206-220 (1968) - [j3]Arthur Kohlenberg, G. David Forney Jr.:
Convolutional coding for channels with memory. IEEE Trans. Inf. Theory 14(5): 618-626 (1968) - 1966
- [j2]G. David Forney Jr.:
Generalized minimum distance decoding. IEEE Trans. Inf. Theory 12(2): 125-131 (1966) - 1965
- [j1]G. David Forney Jr.:
On decoding BCH codes. IEEE Trans. Inf. Theory 11(4): 549-557 (1965)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
