default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Heegard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2003
[j25]Chris Heegard, Sean Coffey, Srikanth Gummadi, Eric J. Rossin, Matthew B. Shoemake, Michael Wilhoyte:
Combined equalization and decoding for IEEE 802.11b devices. IEEE J. Sel. Areas Commun. 21(2): 125-138 (2003)- 2001
- [j24]Chris Heegard, John (Seán) T. Coffey, Srikanth Gummadi, Peter A. Murphy, Ron Provencio, Eric J. Rossin, Sid Schrum, Matthew B. Shoemake:
High-performance wireless Ethernet. IEEE Commun. Mag. 39(11): 64-73 (2001) - 2000
- [j23]Chris Heegard, Andrew J. King:
FIR parity check codes. IEEE Trans. Commun. 48(7): 1108-1113 (2000) - 1998
- [j22]Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei:
Algebraic-Geometry Codes. IEEE Trans. Inf. Theory 44(6): 2596-2618 (1998) - 1995
- [j21]Eric J. Rossin, Nagabhushana T. Sindhushayana, Chris Heegard:
Trellis group codes for the Gaussian channel. IEEE Trans. Inf. Theory 41(5): 1217-1245 (1995) - [j20]Keith Saints, Chris Heegard:
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases. IEEE Trans. Inf. Theory 41(6): 1733-1751 (1995) - [j19]Chris Heegard, J. Little, Keith Saints:
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes. IEEE Trans. Inf. Theory 41(6): 1752-1761 (1995) - 1993
- [j18]Chris Heegard, Scott A. Lery, Woo H. Paik:
Practical Coding for QAM Transmission of HDTV. IEEE J. Sel. Areas Commun. 11(1): 111-118 (1993) - 1992
- [j17]Chris Heegard, Lawrence H. Ozarow:
Bounding the Capacity of Saturation Recording: The Lorentz Model and Applications. IEEE J. Sel. Areas Commun. 10(1): 145-156 (1992) - [j16]Kenneth J. Kerpez, Ayis Gallopoulos, Chris Heegard:
Maximum Entropy Charge-Constrained Run-Length Codes. IEEE J. Sel. Areas Commun. 10(1): 242-253 (1992) - 1991
- [j15]Chris Heegard, Alexandra Duel-Hallen, Rajeev Krishnamoorthy:
On the capacity of the noisy runlength channel. IEEE Trans. Inf. Theory 37(3): 712-720 (1991) - [j14]Chris Heegard, Brian H. Marcus, Paul H. Siegel:
Variable-length state splitting with applications to average runlength-constrained (ARC) codes. IEEE Trans. Inf. Theory 37(3): 759-777 (1991) - 1990
- [j13]Thomas E. Fuja, Chris Heegard:
Focused codes for channels with skewed errors. IEEE Trans. Inf. Theory 36(4): 773-783 (1990) - 1989
- [j12]Alexandra Duel-Hallen, Chris Heegard:
Delayed decision-feedback sequence estimation. IEEE Trans. Commun. 37(5): 428-436 (1989) - [j11]Ayis Gallopoulos, Chris Heegard, Paul H. Siegel:
The power spectrum of run-length-limited codes. IEEE Trans. Commun. 37(9): 906-917 (1989) - [j10]Thomas E. Fuja, Chris Heegard, Mario Blaum:
Cross parity check convolutional codes. IEEE Trans. Inf. Theory 35(6): 1264-1276 (1989) - 1988
- [j9]Thomas E. Fuja, Chris Heegard, Rodney M. Goodman:
Linear Sum Codes for Random Access Memories. IEEE Trans. Computers 37(9): 1030-1042 (1988) - 1986
- [j8]Thomas E. Fuja, Chris Heegard:
Row/Column Replacement for the Control of Hard Defects in Semiconductor RAM's. IEEE Trans. Computers 35(11): 996-1000 (1986) - [j7]A. Robert Calderbank, Chris Heegard, Ting-Ann Lee:
Binary convolutional codes with application to magnetic recording. IEEE Trans. Inf. Theory 32(6): 797-815 (1986) - 1985
- [j6]Chris Heegard:
On the capacity of permanent memory. IEEE Trans. Inf. Theory 31(1): 34-41 (1985) - [j5]Chris Heegard, Toby Berger:
Rate distortion when side information may be absent. IEEE Trans. Inf. Theory 31(6): 727-734 (1985) - 1983
- [j4]Chris Heegard, Abbas A. El Gamal:
On the capacity of computer memory with defects. IEEE Trans. Inf. Theory 29(5): 731-739 (1983) - [j3]Chris Heegard:
Partitioned linear block codes for computer memory with 'stuck-at' defects. IEEE Trans. Inf. Theory 29(6): 831-842 (1983) - 1978
- [j2]Chris Heegard, Jerrold A. Heller, Andrew J. Viterbi:
A Microprocessor-Based PSK Modem for Packet Transmission Over Satellite Channels. IEEE Trans. Commun. 26(5): 552-564 (1978) - [j1]Chris Heegard, Hugo E. dePedro, Jack K. Wolf:
Permutation codes for the Gaussian broadcast channel with two receivers. IEEE Trans. Inf. Theory 24(5): 569-578 (1978)
Conference and Workshop Papers
- 1999
- [c6]Mehul Motani
, Chris Heegard:
Computing Weight Distributions of Convolutional Codes via Shift Register Synthesis. AAECC 1999: 314-323 - 1994
- [c5]Talal Shamoon, Chris Heegard:
A Rapidly Adaptive Lossless Compression Algorithm for High Fidelity Audio Coding. Data Compression Conference 1994: 430-439 - 1993
- [c4]Keith Saints, Chris Heegard:
On Hyperbolic Cascaded Reed-Solomon Codes. AAECC 1993: 291-303 - 1992
- [c3]Chris Heegard, Eric J. Rossin:
Trellis Codes, Symbolic Dynamics, and Isometries. Coding And Quantization 1992: 167-174 - [c2]Chris Heegard, Talal Shamoon:
High-fidelity audio compression: fractional-band wavelets. ICASSP 1992: 201-203 - 1983
- [c1]C. Richard Johnson Jr., James P. Lyons Jr., Chris Heegard:
A new adaptive parameter estimation structure applicable to ADPCM. ICASSP 1983: 1-4
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-24 22:57 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:
