Mehul Motani, Venugopal V. Veeravalli and Chris Heegard,
“On Capacity and Spreading in CDMA Systems,”
2000 IEEE Information Theory Symposium,
Sorrento, ITALY, June, 2000.
Mehul Motani, Venugopal Veeravalli and Chris Heegard, “On Multiple
Access Spread Spectrum Systems,” Second International Conference on
Information, Communications & Signal Processing (ICICS'99), 7-10
December 1999, Hotel Mandarin, Singapore.
Kenneth Andrews,Chris Heegard and Dexter Kozen
“Interleaver Design Methods for Turbo Coding,”
1998 IEEE Information Theory Symposium,
Cambridge, MA, August, 1998.
Mehul Motani and Chris Heegard,
“The Viterbi Algorithm Meets the Key Equation,”
1998 IEEE Information Theory Symposium,
Cambridge, MA, August, 1998.
Matthew Shoemake and Chris Heegard,
“A New Turbo Code for 8-PSK Modulation,”
1998 IEEE Information Theory Symposium,
Cambridge, MA, August, 1998.
Ivelisse Rubio, Moss Sweedler and Chris Heegard,
“Gröbner Bases for 0-Dimensional Ideals
with Applications to Coding Theory,”
Algebraic Geometry and Coding Theory-6,
Marseilles, FRANCE, June, 1997.
Matthew Shoemake and Chris Heegard,
“Computationally Efficient Turbo Decoding
with the Bi-directional Viterbi,”
1997 IEEE Information Theory Symposium,
Ulm, GERMANY, June-July, 1997.
Ivelisse Rubio, Moss Sweedler and Chris Heegard,
“Gröbner Bases for Linear Recursion Relations on m-D Arrays
and Applications to Decoding,”
1997 IEEE Information Theory Symposium,
Ulm, GERMANY, June-July, 1997.
Chris Heegard,
“Shaping, Coding and Channel Capacity for the Gaussian Channel,”
1996 IEEE Information Theory Workshop,
Haifa, ISRAEL, June, 1996.
Chris Heegard,
“Cable Modem Technology: Hopes, Dreams and Reality,”
Workshop on Frontiers in Distributed Information Systems,
Key West, Florida, April 28 – May 1, 1996.
Chris Heegard,
“Constellation Shaping for the Gaussian Channel,”
1995 IEEE Information Theory Symposium,
Whistler, B.C., CANADA, September, 1995.
Eric Rossin, Chris Heegard and David Rowe,
“Punctured, Rotationally Invariant Trellis Coding,”
1995 IEEE Information Theory Symposium,
Whistler, B.C., CANADA, September, 1995.
Chris Heegard,
“Modulation and FEC for Digital TV Transmission,”
1995 IEEE Information Theory Workshop, Rydzyna, POLAND, June, 1995.
Chris Heegard,
“Digital TV,”
Workshop on Emerging Opportunities for Information Technology,
Key West, Florida, April 30 – May 2, 1995.
Talal Shamoon and Chris Heegard,
“Adaptive Update Algorithms for Fixed Dictionary Lossless Data Compressors,”
1994 IEEE Information Theory Symposium,
Trondheim, NORWAY, June 27 – July 1, 1994.
Nagabhushana T. Sindhushay and Chris Heegard
“Symbolic Dynamic Techniques for Trellis Group Codes,”
1994 IEEE Information Theory Symposium,
Trondheim, NORWAY, June 27 – July 1, 1994.
Keith Saints, Ivelisse Rubio and Chris Heegard,
“Decoding Algebraic-Geometric Codes Using Gröbner Bases,”
1994 IEEE Information Theory Symposium,
Trondheim, NORWAY, June 27 – July 1, 1994.
Eric J. Rossin and Chris Heegard
“On the Symmetries and Structure of Trellis Codes,”
1994 IEEE Information Theory Symposium,
Trondheim, NORWAY, June 27 – July 1, 1994.
Chris Heegard, Eric J. Rossin and Nagabhushana T. Sindhushay,
“Trellis Group Codes for the Gaussian Channel,”
1993 IEEE Information Theory Workshop on
Coding, System Theory and Symbolic Dynamics
Mansfield, Massachusetts, October 18–20, 1993.
Nagabhushana T. Sindhushay and Chris Heegard
“Symbolic Dynamics Groups and Generators,”
1993 IEEE Information Theory Workshop,
Mt. Fuji, Japan, June, 1993.
Keith Saints and Chris Heegard
“Cascaded Reed-Solomon Codes and Gröbner Bases,”
1993 IEEE Information Theory Workshop,
Mt. Fuji, Japan, June, 1993.
Eric J. Rossin and Chris Heegard,
“Rotationally Invariant Trellis Codes for QAM,”
1993 IEEE Information Theory Symposium,
San Antonio Texas, January, 1993.
Talal Shamoon and Chris Heegard,
“Lossless Compression Algorithms for
High Fidelity Audio Compression,”
1993 IEEE Information Theory Symposium,
San Antonio Texas, January, 1993.
Keith Saints and Chris Heegard,
“Algebraic Structure and Decoding of Two - Dimensional
Cascade Codes,”
1993 IEEE Information Theory Symposium,
San Antonio Texas, January, 1993.
Mignon Belongie and Chris Heegard,
“Runlength Limited Trellis Codes for
Partial Response Channels,”
1993 IEEE Information Theory Symposium,
San Antonio Texas, January, 1993.
Chris Heegard,
“Isometries of Trellis Codes via Symbolic Dynamics over Groups,”
MSRI Symbolic Dynamics Conference Program,
Berkeley, November 2–6, 1992.
Eric Rossin and Chris Heegard,
“Trellis Codes, Symbolic Dynamics, and Isometries,”
Joint DIMACS / IEEE Workshop on Coding and Quantization,
Rutgers University, October 19–21, 1992.
Chris Heegard, Mignon Belongie, Nagabhushana Sindhushay,
“Coding with Variable Length Graphs,”
1992 IEEE Information Theory Workshop,
Salvador, Brazil, June, 1992.
Mignon Belongie and Chris Heegard,
“Variable Length Trellis Decoding,”
1991 IEEE Information Theory Symposium,
Budapest, Hungary, June, 1991.
Chris Heegard and Mignon Belongie,
“Trellis Codes and Sequence Estimation for Recording Channels,”
1990 IEEE Information Theory Workshop,
Eigenhoven, Netherlands, June, 1990.
Mignon Belongie and Chris Heegard,
“Performance of Trellis Coded Run-Length Codes,”
1990 IEEE Information Theory Symposium,
San Diego, California, January 14–19, 1990.
Rajeev Krishnamoorthy and Chris Heegard,
“The Effect of Coding on the Reliability of Computer Memories,”
1990 IEEE Information Theory Symposium,
San Diego, California, January 14–19, 1990.
Kenneth Kerpez, Ayis Gallopoulos and Chris Heegard,
“Maximum Entropy, Charge Constrained, Run-length Codes,”
1990 IEEE Information Theory Symposium,
San Diego, California, January 14–19, 1990.
Rajeev Krishnamoorthy and Chris Heegard,
“Reliability of Computer Memory,”
1989 IEEE/CAM Information Theory Workshop,
Cornell University, Ithaca, New York, June 25–29, 1989.
Mignon Belongie and Chris Heegard,
“Trellis Constrained, Run-Length Codes,”
1989 IEEE/CAM Information Theory Workshop,
Cornell University, Ithaca, New York, June 25–29, 1989.
Chris Heegard and Rajeev Krishnamoorthy,
“Limits on Coding for Computer Memory,”
Workshop on Information Theory,
Mathematisches Forschungsinstitut Oberwolfach,
Oberwolfach, Germany, May, 1989.
Chris Heegard and Mignon Belongie,
“Trellis Constrained, Run-Length Codes,”
IEEE Communication Theory Workshop,
Hawkes Kaye, Florida, April 10–12, 1989.
Chris Heegard, Brian Marcus and Paul Siegel,
“Variable Length State Splitting with Applications to Average
Run-length Constrained (ARC) Codes,”
IEEE International Symposium on Information Theory,
Kobe, Japan, June, 1988.
Chris Heegard,
“Trellis Coded Run-Length Codes,”
1987 Workshop on Error - Correcting Codes,
Almaden Research Center, IBM, San Jose CA., September 1987.
Chris Heegard,
“Combined Trellis and Run-Length Coding,”
International Symposium on Information and Coding Theory,
Campinas, SP, Brazil, July 27–29, 1987.
Chris Heegard,
“Spectral Properties of Run-Length Limited
and Charge Constrained Modulation Codes,”
IEEE Communication Theory Workshop,
Howie-In-The-Hills, Florida, April 27–29, 1987.
Chris Heegard,
“Properties of Constrained Modulation Codes,”
National Radio Science meeting,
Boulder Colorado, January 12–15, 1987.
Thomas Fuja, Chris Heegard and Mario Blaum,
“Cross Parity Check Convolutional Codes for Magnetic Tape,”
IEEE International Symposium on Information Theory,
University of Michigan, Ann Arbor, October 6–9, 1986.
Chris Heegard, A. Robert Calderbank and Ting-Ann Lee,
“Binary Convolutional Codes with Application to Magnetic Recording,”
IEEE International Symposium on Information Theory,
University of Michigan, Ann Arbor, October 6–9, 1986.
Thomas Fuja, Chris Heegard and Mario Blaum,
“Cross Parity Check Codes for Magnetic Tape,”
1986 Workshop on Error-Correcting Codes,
Almaden Research Center, IBM, San Jose CA., August 1986.
Chris Heegard, Paul Siegal and Panagiotis Gallopoulos,
“On the Spectrum of (d, k) Codes,”
Workshop on Information Theory,
Mathematisches Forschungsinstitut Oberwolfach,
Oberwolfach, Germany, May 11–17, 1986.
Howard L. Dyckman and Chris Heegard,
“On the Capacity of Gaussian Channels with Intersymbol
Interference and a Cardinality Constraint on the Input,”
IEEE International Symposium on Information Theory,
Brighton, England, June 23–28, 1985.
Thomas Fuja, Chris Heegard and Rodney Goodman,
“Some Linear Sum Codes for Random Access Memories,”
IEEE International Symposium on Information Theory,
Brighton, England, June 23–28, 1985.
A. Robert Calderbank, Chris Heegard and Lawrence H. Ozarow,
“A New Approach to Coding for High Density Magnetic Recording,”
IEEE International Symposium on Information Theory,
Brighton, England, June 23–28, 1985.
Ting-Ann Lee and Chris Heegard,
“Binary Convolutional Codes for Partial Response Channels,”
Fourth Caribbean Conference on Combinatorics and Computing,
Puerto Rico, April 1–5, 1985.
Chris Heegard and Thomas Fuja,
“Redundancy in the Design of Semiconductor Memories,”
1984 IEEE Information Theory Workshop,
Caesarea Israel, July 2–6, 1984.
Chris Heegard and Toby Berger,
“Rate-Distortion when Side Information May Be Absent,”
IEEE International Symposium on Information Theory,
St. Jovite, Quebec, Canada, September 25–29, 1983.
Chris Heegard,
“Algebraic Codes for Optical Data Disks,”
IEEE International Symposium on Information Theory,
St. Jovite, Quebec, Canada, September 25–29, 1983.
Chris Heegard,
“Linear Block Codes for Computer Memory with Defects,”
IEEE International Symposium on Information Theory,
Les Arcs, France, June 1982.
Chris Heegard and Abbas El Gamal,
“On the Capacity of Computer Memory with Defects,”
IEEE International Symposium on Information Theory,
Santa Monica, California, February 1981.