Paul H. Siegel - Publications

Recently Submitted Journal Papers

The following notice applies to the articles below that have been submitted to the IEEE for possible publication:

  This work has been submitted to the IEEE for possible publication. 
  Copyright may be transferred without notice, after which this version 
  may no longer be accessible.

• J. Han, R.M. Roth, and P.H. Siegel, “Single-Exclusion Number and the Stopping Redundancy of MDS Codes,” IEEE Trans. Inform. Theory, submitted December 2007.


• M.H. Taghavi and P.H. Siegel, “Graph-Based Decoding in the Presence of ISI,” IEEE Trans. Inform. Theory, submitted June 2007.


• M.H. Taghavi and P.H. Siegel, “Adaptive Methods for Linear Programming Decoding,” IEEE Trans. Inform. Theory, submitted March 2007; under revision.


• I. Demirkan, P.H. Siegel, and J.K. Wolf, “Error Event Characterization on 2-D ISI Channels,” IEEE Trans. Inform. Theory, submitted March 2007.




Journal Articles (most recent first)

The following copyright notice applies to the articles below that have been published by the IEEE:

  ©1982-2005 IEEE. Personal use of this material is permitted. However, permission 
  to reprint/republish this material for advertising or promotional purposes or for 
  creating new collective works for resale or redistribution to servers or lists, or 
  to reuse any copyrighted component of this work in other works must be obtained from 
  the IEEE.



1. J. Han, P.H. Siegel, and A. Vardy, “Improved Probabilistic Bounds on Stopping Redundancy,” IEEE Trans. Inform. Theory, vol. 54, no. 4, pp. 1749-1753, April 2008.


2. J. Chen and P.H. Siegel, “Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels,” IEEE Trans. Inform. Theory, vol. 54, no. 3, pp. 1295-1303, March 2008.


3. H.D. Pfister and P.H. Siegel, “Joint Iterative Decoding of LDPC Codes for Channels with Memory and Erasure Noise,” IEEE Journal Selec. Areas Commun., Special Issue on Equalization Techniques for Wireless Communications – Theory & Applications, vol. 26, no. 2, pp. 320-337, February 2008.


4. S. Aviran, P.H. Siegel, and J.K. Wolf, “Optimal Parsing Trees for Run-Length Coding of Biased Data,” IEEE Trans. Inform. Th., vol. 54, no. 2, pp. 841-849, February 2008.


5. S. Karakulak, P.H. Siegel, J.K. Wolf, and H.N. Bertram, “A New Read Channel Model for Patterned Media Storage,” IEEE Trans. Magn., vol. 44, no. 1, pt. 2, pp. 193-197, January 2008.


6. B.E. Moision, A. Orlitsky, and P.H. Siegel, “ On Codes with Local Joint Constraints,” Lin. Alg. Appl., vol. 422, iss. 2-3, pp. 442-454, April 15, 2007.


7. J.B. Soriaga, H.D. Pfister, and P.H. Siegel, “ Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels using Multistage Decoding,” IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1416-1429, April 2007.


8. Z. Wu, P.H. Siegel, H.N. Bertram, and J.K. Wolf, “ Design Curves and Information Theoretic Limits for Perpendicular Recording Systems,” IEEE Trans. Magn., vol. 43, no. 2, pp. 721-726, February 2007.


9. J. Han and P.H. Siegel, “ Improved Upper Bounds on Stopping Redundancy,” IEEE Trans. Inform. Theory, vol. 53, no. 1, pp. 90-104, January 2007.


10. P.H. Siegel, “ Book Review: Codes for Mass Data Storage Systems (Second Edition), by K.A. Schouhamer Immink ,” IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5614-5616, December 2006.


11. M.H. Taghavi N., G.C. Papen, and P.H. Siegel “ On the Multiuser Capacity of WDM in a Nonlinear Optical Fiber: Coherent Communication,” IEEE Trans. Inform. Theory, vol. 52, no. 11, pp. 5008-5022, November 2006 .
    
    
12. P. Chaichanavong, H.N. Bertram, and P.H. Siegel “ Design Parameter Optimization for Perpendicular Magnetic Recording Systems,” IEEE Trans. Magn., vol. 42, no. 10, pp. 2549-2554, October 2006.
    
    
13. J. Han, P. Lee, and P.H. Siegel, “ On the Probability of Undetected Error for Over-Extended Reed-Solomon Codes,” IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3662-3669, August 2006.
    
    
14. P. Chaichanavong and P.H. Siegel, “ Tensor-Product Parity Codes: Combination with Constrained Codes and Application to Perpendicular Recording,” IEEE Trans. Magn., vol. 42, no. 2, pt. 1, pp. 214-219, February 2006.
    
    
15. P. Chaichanavong and P.H. Siegel, “ A Tensor-Product Parity Code for Magnetic Recording,” IEEE Trans. Magn., vol. 42, no. 2, pt. 2, pp. 350-352, February 2006.
    
    
16. J. Chen and P.H. Siegel, “On the Symmetric Information Rate of Two-Dimensional Finite State ISI Channels,” IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 227-236, January 2006.
    
    
17. N. Kashyap, P.H. Siegel and A. Vardy, “Coding for the Optical Channel --- the Ghost Pulse Constraint,” IEEE Trans. Inform. Theory, vol. 52, no. 1, pp. 64-77, January 2006.
    
    
18. N. Kashyap, P.H. Siegel and A. Vardy, “ An Application of Ramsey Theory to Coding for the Optical Channel,” SIAM J. Discr. Math., vol. 19, no. 4, pp. 921–937, December 2005
    
    
19. S. Aviran, P.H. Siegel, and J.K. Wolf, “Noise-Predictive Turbo Equalization for Partial-Response Channels,” IEEE Trans. Magn., vol. 41, no. 10, pp. 2959-2961, Oct. 2005.
    
    
20. B. Kurkoski, P.H. Siegel, and J.K. Wolf, “Soft-Output Detector for Partial-Response Channels Using Vector Quantization,” IEEE Trans. Magn., vol. 41, no. 10, pp. 2989-2991, Oct. 2005.
    
    
21. S. Aviran, P.H. Siegel, and J.K. Wolf, “ An Improvement to the Bit Stuffing Algorithm,” IEEE Trans. Inform. Theory, vol. 51, no. 8, pp. 2885-2891, August 2005.
    
    
22. Y. Zhang, L.B. Milstein, and P.H. Siegel, “Tradeoff Between Diversity Gain and Interference Suppression in a MIMO MC-CDMA System,” IEEE Trans. Commun., vol. 53, no. 4, pp. 623-631, April 2005.
    
    
23. J. Hou, P.H. Siegel, and L.B Milstein, “Design of Multi-Input Multi-Output Systems Based on Low-Density Parity-Check Codes,” IEEE Trans. Commun., vol. 53, no. 4, pp. 601—611, April 2005.
    
    
24. H.M. Tullberg and P.H. Siegel, “ Serial Concatenated TCM with an Inner Accumulate Code – Part II: Density Evolution Analysis,” IEEE Trans. Commun., vol. 53, no. 2, pp. 252-262, February 2005.
    
    
25. H.M. Tullberg and P.H. Siegel, “Serial Concatenated TCM with an Inner Accumulate Code – Part I: Maximum-Likelihood Analysis,” IEEE Trans. Commun., vol. 53, no. 1, pp. 64-73, January 2005.
    
    
26. A.P. des Rosiers and P.H. Siegel, “ On Performance Bounds for Space-Time Codes on Fading Channels,” IEEE Trans. Commun., vol. 52, no. 10, pp. 1688-1697, October 2004.
    
    
27. M.N. Marrow, M.K. Cheng, P.H. Siegel, and J.K. Wolf, “ A Fast Microtrack Simulator for High-Density Perpendicular Recording, IEEE Trans. Magn., vol. 40, no. 4, pp. 3117-3119, July 2004.
    
    
28. N. Kashyap and P.H. Siegel, “Sliding-Block Decodable Encoders Between (d,k) Runlength-Limited Constraints of Equal Capacity,” IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1327-1331, June 2004.
    
    
29. S. Halevy, J. Chen; R.M. Roth, P.H. Siegel, J.K. Wolf, “ Improved Bit-Stuffing Bounds on Two-Dimensional Constraints,” IEEE Trans. Inform. Theory, vol. 50, no. 5, pp. 824-838, May 2004.
    
    
30. N. Kashyap and P.H. Siegel, “ Equalities among Capacities of (d,k) Constrained Systems,” SIAM J. Discr. Math., vol. 17, no. 2, pp. 276-297, 2003.
    
    
31. J.B. Soriaga, H.D. Pfister, and P.H. Siegel, “ On the Low Rate Shannon Limit for Binary Intersymbol Interference Channels,” IEEE Trans. Commun., vol. 51, no. 12, pp. 1962-1964, December 2003.
    
    
32. J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, “ Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes,” IEEE Trans. Inform. Theory, vol. 49, no. 9, pp. 2141-2155, September 2003.
    
    
33. K. Tang, L. B. Milstein, and P .H. Siegel, “MLSE Receiver for Direct-Sequence Spread-Spectrum Systems on a Multipath Fading Channel,” IEEE Trans. Commun., vol. 51, no. 7, pp. 1173-–1184, July 2003.
    
    
34. H. D. Pfister and P. H. Siegel, “ The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers,” IEEE Trans. Inform. Theory, vol. 49, no. 6, pp. 1425–1438, June 2003.
    
    
35. B.M. Kurkoski, P.H. Siegel, and J.K. Wolf, “Joint Message Passing Decoding of LCPC Coded Partial-Response Channels,” IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1410-1422, June 2002. (See also B.M. Kurkoski, P.H. Siegel, and J.K. Wolf, “Correction to “Joint Message Passing Decoding of LCPC Coded Partial-Response Channels”,” IEEE Trans. Inform. Theory, vol. 49, no. 8, p. 2076, August 2003.)
    
    
36. X.-W. Wu and P.H. Siegel, “Efficient Root-Finding Algorithm with Application to List-Decoding of Algebraic-Geometric Codes,” IEEE Trans. Inform. Theory, vol. 47, no. 6, pp. 2579-2587, September 2001.
    
    
37. K. Tang, L.B. Milstein, and P.H. Siegel, “Combined MMSE Interference Suppression and Turbo Coding for a Coherent DS-CDMA System,” IEEE J. Select. Areas Commun., Issue on The Turbo Principle: From Theory to Practice II, vol. 19, no. 9, pp. 1793-1803, September 2001.
    
    
38. P.H. Siegel, D.Divsalar, E. Eleftheriou, J. Hagenauer,D. Rowitch, “Guest Editorial: The Turbo Principle: From Theory to Practice - II,” IEEE J. Select. Areas Commun.,vol. 19, no. 9, pp. 1659-1661, September 2001.
    
    
39. K. Tang, L.B. Milstein, and P.H. Siegel, “A Comparison of Long Versus Short Spreading Sequences in Coded Asynchronous DS-CDMA Systems,” IEEE Journal Selec. Areas Commun., vol. 19, no. 8, pp. 1614-1624, August 2001.
    
    
40. J. Hou, P.H. Siegel, and L.B. Milstein, “ Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels,” IEEE J. Select. Areas Commun., Issue on The Turbo Principle: From Theory to Practice I, vol. 19, no. 5, pp. 924-934, May 2001.
    
    
41. P.H. Siegel, D. Divsalar, E. Eleftheriou, J. Hagenauer, D. Rowitch, “Guest Editorial: The Turbo Principle: From Theory to Practice - I,” IEEE J. Select. Areas Commun., vol. 19, no. 5, pp. 793-799, May 2001.
    
    
42. M. Φberg and P. H. Siegel, “Performance Analysis of Turbo-Equalized Partial-Response Channels,” IEEE Trans. Commun., vol. 49, no 3, pp.436-444, March 2001.
    
    
43. R.M. Roth, P.H. Siegel, and J.K. Wolf, “Efficient Coding Schemes for the Hard-Square Model ,” IEEE Trans. Inform. Theory, vol. 47, no 3, March 2001.
    
    
44. B.E. Moision, A. Orlitsky, and P.H. Siegel, “On Codes That Avoid Specified Differences,” IEEE Trans. Inform. Theory, vol. 47, no. 1, pp. 433-442, January 2001.
    
    
45. T. Souvignier, M. Φberg, P.H. Siegel, R.E. Swanson, and J.K. Wolf, “Turbo Decoding for Partial Response Channels,” IEEE Trans. Commun., vol. 48 , no. 8 , pp. 1297-1308, August 2000.
    
    
46. R. Karabed, P.H. Siegel, and E. Soljanin, “Constrained Coding for Binary Channels with High Intersymbol Interference,” IEEE Trans. Inform. Theory, vol. 45, pp. 1777-1797, September 1999.
    
    
47. S.A. Atlekar, M. Berggren, B.E. Moision, P.H. Siegel, and J.K. Wolf, “Error Event Characterization on Partial Response Channels,” IEEE Trans. Inform. Theory, vol. 45, no. 1, pp. 241-247, January 1999.
    
    
48. B. Marcus, R. Roth, and P. Siegel, “Constrained Systems and Coding for Recording Channels,” Handbook of Coding Theory, Elsevier Scientific Publishers, 1998, pp. 1635-1764.
    
    
49. A. Vityaev and P.H. Siegel, “Improved Estimates of Viterbi Detector Path Metric Differences,” IEEE Trans. Commun., pp. 1549-1554, December 1998.
    
    
50. K.A.S. Immink, P.H. Siegel, J.K. Wolf, “Codes for Digital Recorders,” IEEE Trans. Inform. Theory, Special Commemorative Issue, pp. 2260-2299, October 1998.
    
    
51. B.E. Moision, P.H. Siegel, and E. Soljanin, “ Distance-Enhancing Codes for Digital Recording,” IEEE Trans. Magn., vol. 34, no. 1, pp. 69-74, Jan. 1998.
    
    
52. J.J. Ashley, R. Karabed, and P.H. Siegel, “Complexity and Sliding-Block Decodability,” IEEE Trans. Inform. Theory, Special Issue on Codes and Complexity, pp. 1925-1947, November 1996.
    
    
53. A. Vardy, M. Blaum, P.H. Siegel, and G.T. Sincerbox, “ Conservative Arrays: Multidimensional Modulation Codes for Holographic Recording,” IEEE Trans. Inform. Theory, pp. 227-230, January 1996.
    
    
54. J. Rae, G. Christiansen, S.-M. Shih, H. Thapar, R. Karabed, and P. Siegel, “Design and Performance of a VLSI 120 Mb/s Trellis-Coded Partial-Response Channel,” IEEE Trans. Magn., pp. 1208-1214, March 1995.
    
    
55. L. Fredrickson, R. Karabed, P. Siegel, H. Thapar, and R. Wood, “Improved Trellis Coding for Partial-Response Channels,” IEEE Trans. Magn., pp. 1141-1148, March 1995.
    
    
56. R. Roth, P. Siegel, and A. Vardy, “High-Order Spectral-Null Codes: Constructions and Bounds,” IEEE Trans. Inform. Theory, pp. 1828-1840, November 1994.
    
    
57. R. Roth and P. Siegel, “Lee-Metric BCH Codes and Their Application to Constrained and Partial-Response Channels,” IEEE Trans. Inform. Theory, pp. 1083-1096, July 1994.
    
    
58. H. Thapar, C. Shung, J. Rae, R. Karabed, and P. Siegel, “Real-Time Recording Results for Trellis-Coded Partial Response (TCPR) System,” IEEE Trans. Magn., vol. 29, no. 6, pp. 4009-4011, November 1993.
    
    
59. C. Shung, H.-D. Lin, R. Cypher, P. Siegel, and H. Thapar, “Area-Efficient Architectures for the Viterbi Algorithm - Part I: Theory and Part II: Applications,” IEEE Trans. Commun., pp. 636-644, April 1993 and pp. 802-807, May 1993.
    
    
60. H.K. Thapar, J. Rae, C.B. Shung, R. Karabed, and P.H. Siegel, “On the Performance of a Rate 8/10 Matched Spectral Null Code for Class-4 Partial Response,” IEEE Trans. Magn., vol. 28, no. 5, pp. 2884-2889, September 1992.
    
    
61. P. Siegel, “ Review of Finite Fields for Computer Scientists and Engineers, by R. J. McEliece,” IEEE Trans. Inform. Theory, vol. 38, no. 1, pp. 315-316, January 1993.
    
    
62. B. Marcus, P. Siegel, and J.K. Wolf, “Finite-State Modulation Codes for Data Storage,” IEEE Journal Selec. Areas Commun., vol. 10, no. 1, pp. 5-37, January 1992.
    
    
63. B. Shung, P. Siegel, H. Thapar, R. Karabed, “A 30 MHz Trellis Codec Chip for Partial-Response Channels,” IEEE Journal of Solid-State Circuits, Special Issue on Analog and Signal Processsing Circuits,} vol. 26, no. 12, pp. 1981-1987, December 1991.
    
    
64. P. Siegel and J.K. Wolf, “Modulation and Coding for Information Storage,” IEEE Commun. Magazine, vol. 29, no. 12, pp. 68-86, December 1991.
    
    
65. R. Karabed and P. Siegel, “Matched Spectral Null Codes for Partial Response Channels,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 818-855, May 1991.
    
    
66. C. Heegard, B.H. Marcus, and P.H. Siegel, “Variable Length State Splitting with Applications to Average Runlength Constrained (ARC) Codes,” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 759-777, May 1991.
    
    
67. A.R. Calderbank, P. Siegel, and J. K. Wolf, “Introduction to the Special Issue (on Coding for Storage Devices),” IEEE Trans. Inform. Theory, vol. 37, no. 3, pt. II, pp. 709-710, May 1991.
    
    
68. A. Gallopoulos, C. Heegard, and P. Siegel, “The Power Spectrum of Run-Length-Limited Codes,” IEEE Trans. Commun., vol. 37, no. 9, pp. 906-917, September 1989.
    
    
69. J. Ashley and P. Siegel, “A Note on the Shannon Capacity of Run-Length-Limited Codes,” IEEE Trans. Inform. Theory, vol. 33, No. 4, pp. 601-605, July 1987. (See also J. Ashley, M. Hilden, P. Perry, and P. Siegel, “Correction to A Note on the Shannon Capacity of Run-Length-Limited Codes,” IEEE Trans. Inform. Theory, vol. 39, No. 3, pp. 1110-1112, May 1993.)
    
    
70. B. Marcus and P. Siegel, “On Codes with Spectral Nulls at Rational Submultiples of the Symbol Frequency,” IEEE Trans. Inform. Theory, vol. 33, No. 4, pp. 557-568, July 1987.
    
    
71. P. Siegel, “Recording Codes for Digital Magnetic Storage,” IEEE Trans. Magn., vol. MAG-21, No. 5, pp. 1344-1349, September 1985.
    
    
72. P. Siegel and B. Marcus, “Worst Case Code Patterns for Magnetic Buried Servos,” IEEE Trans. Magn., vol. MAG-20, No. 5, pp. 906-908, September 1984.
    
    
73. M. Goresky and P. Siegel, “Linking Pairings on Singular Spaces,” Comm. Math. Helv., vol. 58, No.1, pp. 96-110, 1983.
    
    
74. P. Siegel, “Witt Spaces: A Geometric Cycle Theory for ko-Homology at Odd Primes (big! 2MB),” Am. J. Math., vol. 105, No. 5, pp.1067-1105, October 1983.
    
    
75. P. Siegel, “Applications of a Peak Detection Channel Model,” IEEE Trans. Magn., vol. MAG-18, No. 6, pp. 1250-1252, November 1982.
    
    

Conference Publications (most recent first)


1. J. Han, R.M. Roth, and P.H. Siegel, “Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes,” Proc. 2007 IEEE Int. Symp. Inform. Theory, Nice, France, June 24-29, 2007, pp. 2941-2945.


2. M.H. Taghavi and P.H. Siegel, “Equalization on Graphs: Linear Programming and Message Passing,” Proc. 2007 IEEE Int. Symp. Inform. Theory, Nice, France, June 24-29, 2007, pp. 2551-2555.


3. S. Aviran, P.H. Siegel, and J.K. Wolf, “Optimal Parsing Trees for Run-Length Coding of Biased Data,” Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, Washington, July 9-14, 2006, pp. 1495-1499.


4. I. Demirkan, P.H. Siegel, and J.K. Wolf, “Error Event Characterization on 2-D ISI Channels,” Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, Washington, July 9-14, 2006, pp. 1095-1099.


5. J. Han and P.H. Siegel, “On the Stopping Redundancy of MDS Codes,” Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, Washington, July 9-14, 2006, pp. 2491-2495


6. M. Taghavi N. and P.H. Siegel, “Adaptive Linear Programming Decoding,” Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, Washington, July 9-14, 2006, pp. 1374-1379.


7. P. H. Siegel, “Information-theoretic Limits of Two-dimensional Optical Recording Channels,” in Optical Data Storage 2006 (Proceedings of SPIE, Vol. 6282, Eds. Ryuichi Katayama and Tuviah E. Schlesinger), Montreal, Quebec, Canada, April 23-26, 2006, pp. 62820W-1– 2820W-13.


8. J.B. Soriaga and P.H. Siegel, “On the Design of Finite-State Shaping Encoders for Partial-Response Channels,” Inaugural Workshop of the Center for Information Theory and its Applications, Unversity of California at San Diegeo, La Jolla, California, February 6-10, 2006.


9. M.H. Taghavi N., G.C. Papen, and P.H. Siegel, “Multiuser Capacity Analysis of WDM in Nonlinear Fiber Optics,” Proc. 43rd Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, September 28-September 30, 2005.


10. P. Chaichanavong and P.H. Siegel, “Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes,” Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 805-809 .


11. M. Schwartz, P.H. Siegel, and A. Vardy, “On the Asymptotic Performance of Iterative Decoders for Product Codes,” Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 1758-1762.


12. J.B. Soriaga, P.H. Siegel, M.N. Marrow, and J.K. Wolf, “On Achievable Rates of Multistage Decoding on Two-Dimensional ISI Channels,” Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 1348-1352.


13. S. Aviran, P.H. Siegel, and J.K. Wolf, “Two-Dimensional Bit-Stuffing Schemes with Multiple Transformers,” Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005.


14. J. Chen and P.H. Siegel, “Lower Bounds on the Capacity of Asymmetric Two-Dimensional (d,infinity)-Constraints,” Proc. 2005 IEEE Int. Symp. Inform. Theory, Adelaide, Australia, September 4-9, 2005, pp. 666-670 .


15. P. Ellingsen, O. Ytrehus, and P.H. Siegel, “Enhanced Decoding by Error Detection on a Channel with Correlated 2-Dimensional Noise,” Proc. IEEE Inform. Theory Workshop, San Antonio, Texas, October 24-29, 2004.


16. J. Han and P.H. Siegel, “Reducing Acyclic Network Coding Problems to Single-Transmitter-Single-Demand Form,” Proc. 42st Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, September 29-October 1, 2004.


17. “On Near-Capacity Coding Systems for Partial-Response Channels,” Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, Illinois, June 27-July 2, 2004.


18. B.M. Kurkoski, P.H. Siegel, and J.K. Wolf, “Analysis of Convolutional Codes on the Erasure Channel,” Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, Illinois, June 27-July 2, 2004.


19. S. Aviran, P.H. Siegel and J.K. Wolf, “An Improvement to the Bit Stuffing Algorithm,” Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, Illinois, June 27-July 2, 2004.


20. N. Kashyap and P.H. Siegel, “Sliding-Block Decodable Encoders Between (d,k)-Constrained Systems of Equal Capacity,” Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, Illinois, June 27-July 2, 2004.


21. N. Kashyap, P.H. Siegel and A. Vardy, “A Ramsey Theory Approach to Ghostbusting,” Proc. 2004 IEEE Int. Symp. Inform. Theory, Chicago, Illinois, June 27-July 2, 2004.


22. M.K. Cheng and P.H. Siegel, “List-Decoding of Parity-Sharing Reed-Solomon Codes in Magnetic Recording Systems,” IEEE International Conference on Communications, Paris, France, June 20--24, 2004.


23. B.M. Kurkoski, P.H. Siegel, and J.K. Wolf, “Exact Probability of Erasure and a Decoding Algorithm for Some Convolutional Codes on the Binary Erasure Channel,” Proceedings IEEE Global Telecommun. Conf., San Francisco, California, December 1--5, 2003.


24. M.K. Cheng and P.H. Siegel, “Iterative Soft-Decision Reed-Solomon Decoding on Partial Response Channels,” Proceedings IEEE Global Telecommun. Conf., San Francisco, California, December 1-5, 2003.


25. J.B. Soriaga and P.H. Siegel, “On Distribution Shaping Codes for Partial Response Channels,” Proc. 41st Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, October 1-3, 2003.


26. H.D. Pfister and P.H. Siegel, “Joint Iterative Decoding of LDPC Codes and Channels with Memory,” Proc. 3rd Intl. Symp. Turbo Codes and Related Topics, Brest, France, September 15, 2003.


27. B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, “Precoders for Message-Passing Detection of Partial-Response Channels,” Proc. IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003.


28. N. Kashyap and P. H. Siegel, “Capacity Equalities in 1-Dimensional (d,k)-Constrained Systems,” Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003.


29. J. Chen and P. H. Siegel, “Information Rates of Two-Dimensional Finite State ISI Channels,” Proc. 2003 IEEE Int. Symp. Inform. Theory, Yokohama, Japan, June 29-July 4, 2003.


30. A. P. des Rosiers and P. H. Siegel, “Space-Time Code Performance Bounds on Quasistatic Fading Channels,” IEEE International Conference on Communications (ICC 2003), Anchorage, AK, May 11-15, 2003.


31. J. Chen and P. H. Siegel, "On the Symmetric Information Rate of Two-Dimensional Finite State ISI Channels,” Proc. IEEE Inform. Theory Workshop, Paris, France, April 2003, pp. 320-323.


32. M. K. Cheng, J. Campello, and P. H. Siegel, “Soft-Decision Reed-Solomon Decoding on Partial Response Channels,” Proc. IEEE Global Telecommun. Conf. (GLOBECOM 2002), Taipei, Taiwan, November 2002, pp. 1026-1030.


33. S. Halevy, J. Chen, R.M. Roth, P.H. Siegel, and J.K. Wolf, “Improved Bit-Stuffing Bounds on Two-Dimensional Constraints,” Proc. IEEE Int. Symp. Inform. Theory, June 30-July 5, 2002, Lausanne, Switzerland.


34. H.M. Tullberg and P.H. Siegel, “Serial Concatenated Trellis Coded Modulation with Inner Rate-1 Accumulate Code,” Proc. IEEE Global Telecommunications Conference (Globecom 2001), November 25-29, 2001.


35. H.D. Pfister, J. B. Soriaga, and P.H. Siegel, “On the Achievable Information Rates of Finite State ISI Channels,” Proc. IEEE Global Telecommunications Conference (Globecom 2001), November 25-29, 2001, pp. 2992-2996.


36. J. Hou, P.H. Siegel, L.B. Milstein, and H.D. Pfister, “Multilevel Coding with Low-Density Parity-Check Component Codes,” Proc. IEEE Global Telecommunications Conference (Globecom 2001), November 25-29, 2001.


37. H.M. Tullberg and P.H. Siegel, “Serial Concatenated Trellis Coded Modulation with Inner Rate-1 Accumulate Code,” Proc. IEEE Annual Vehicular Technology Conf. (VTC2001-Fall), Atlantic City, New Jersey, October 8-10, 2001.


38. J. Hou, P.H. Siegel, L.B. Milstein, and H.D. Pfister, “Design of Low-Density Parity-Check Codes for Bandwidth Efficient Modulation,” Proc. IEEE Inform. Theory Workshop, Cairns, Australia, September 2-7, 2001, p. 24.


39. B.E. Moision and P.H. Siegel, “Periodic Finite-Type Shift Spaces,” Proc. 1998 IEEE Int. Symp. Inform. Theory, Washington, D.C., June 25-29, 2001, p. 65


40. M. Φberg and P.H. Siegel, “Performance Bound for Parity-Check Coded Partial-Response Channels,” Proc. IEEE Int. Conf. Commun., Helsinki, Finland, June 11-14, 2001, vol. 9, pp. 2701-2705.


41. K.Tang, L.B. Milstein, and P.H. Siegel, “A Comparison of Long versus Short Spreading Sequences in Coded Asynchronous DS-CDMA Systems,” Proc. 35th Annual Conference on Information Sciences and Systems (CISS), Baltimore, Maryland, March 21-23, 2001.


42. J. Hou, P.H. Siegel, and L.B. Milstein, “Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels,” Proc. 38th Allerton Conference on Communications, Control, and Computing, Monticello, Illinois, October 4-6, 2000.


43. H.D. Pfister and P.H. Siegel, “Coding Theorems for Generalized Repeat Accumulate Codes,” Proc. Int. Symp. Inform. Theory and its Appl. (ISITA), Honolulu, Hawaii, November 5-8, 2000.


44. A.P. des Rosiers and P.H. Siegel, “Generalized Performance Bounds for Space Time Coded Modulation on Fading Channels,” Proc. Int. Symp. Inform. Theory and its Appl. (ISITA), Honolulu, Hawaii, November 5-8, 2000.


45. A. Ranheim, A.P. des Rosiers, P.H. Siegel, and D.B. Rao, “An Iterative Receiver Algorithm for Space-Time Encoded Signals,” Conf. Record 34th Asilomar Conf. on Signals, Systems, and Computers, vol. 1 Pacific Grove, CA, October 29 - November 1, 2000, pp. 516-520.


46. X.-W. Wu and P.H. Siegel, “Fast Computation of Roots of Polynomials over Function Fields and Fast List Decoding of Algebraic Geometric Codes,” Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 478.


47. R.M. Roth, P.H. Siegel, J.K. Wolf, “Efficient Coding for a Two-Dimensional Runlength-Limited Constraint,” Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 307.


48. B.E. Moision, A. Orlitsky, and P.H. Siegel, “On Codes Avoiding Specified Differences,” Proc. IEEE Int. Symp. Inform. Theory, Sorrento, Italy, June 25-30, 2000, p. 145.


49. H.M. Tullberg and P.H. Siegel, “ Bit-Interleaved Coded Modulation for Delay-Constrained Mobile Communication Channels,” Proc. IEEE Annual Vehicular Technology Conf. VTC2000-Spring, vol. 3, Tokyo, Japan, May 15-18, 2000, pp. 2212-2216.


50. K. Tang, P.H. Siegel, and L.B. Milstein, “ Turbo Coding for a Coherent DS-CDMA System Employing a MMSE Receiver on a Rayleigh Fading Channel,”Proc. 34th Annual Conf. Information Sciences and Systems (CISS), Princeton, NJ, March 15-17, 2000.


51. M. Φberg and P.H. Siegel, “ Parity Check Codes for Partial Response Channels,” Proc. 1999 IEEE Global Telecommun. Conf. (GLOBECOM'99), Rio de Janeiro, Brazil, December 5-9, 1999.


52. B.E. Moision, A. Orlitsky, and P.H. Siegel, “Bounds on the Rate of Codes Which Forbid Specified Difference Sequences,” Proc. 1999 IEEE Global Telecommun. Conf. (GLOBECOM'99), Rio de Janeiro, Brazil, December 5-9, 1999.


53. H. Pfister and P.H. Siegel, “On the Serial Concatenation of Rate-One Codes Through Uniform Random Interleavers,” Proceedings 37th Allerton Conference on Communication, Control and Computing, Monticello, Illinois, September 22-24, 1999.


54. Ron M. Roth, P. H. Siegel, and Jack K. Wolf, “Efficient Coding for a Two-Dimensional Runlength-Limited Constraint,” Proc. 1999 Int. Symp. on Optical Science, Engineering, and Instrumentation (SPIE'99) Denver, Colorado, Paper 3802-5, July 1999.


55. A.P. des Rosiers and P.H. Siegel, “Effect of Varying Source Kurtosis on the Multimoduli Algorithm,” Proc. IEEE Int. Conf. Commun., Vancouver, Canada, Paper S33-4, June 1999.


56. T. Souvignier, A. Friedman, M. Oberg, P. H. Siegel, R. E. Swanson and J. K. Wolf, “Turbo codes for PR4: Parallel versus serial concatenation,” Proc. 1999 IEEE Int. Conf. Commun., Vancouver, Canada, Paper S41-4, June 1999.


57. B. Moision and P. Siegel, “Distance Enhancing Constraints for Noise Predictive Maximum Likelihood Detectors,” Proc. 1998 IEEE Global Telecommun. Conf. (GLOBECOM'98), Sydney, Australia, pp. 2730-2734, November 1998.


58. S. Halter, M. Φberg, P. M. Chau, and P.H. Siegel,“ Reconfigurable Signal Processor for Channel Coding and Decoding in Low SNR Wireless Communications,” Proc. 1998 IEEE Workshop on Signal Processing Systems (SiPS), Boston, Massachusetts, October 8-10, 1998.

59. J. K. Wolf and P.H. Siegel, “On Two-Dimensional Arrays and Crossword Puzzles,” Proc. 36th Allerton Conference on Communication, Control and Computing, Monticello, Illinois, pp. 366-371, September 1998.


60. M. Oberg and P. H. Siegel, “Performance Analysis of Turbo-Equalized Dicode Partial-Response Channel,” Proc. 36th Allerton Conference on Communication, Control and Computing, Monticello, Illinois, pp. 230-239, September 1998.


61. B. E. Moision, P.H. Siegel, and E. Soljanin, “Error Event Characterization and Coding for the Equalized Lorentzian Channel,” Proc. 1998 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, p. 77, August 1998.


62. P.H. Siegel and J.K. Wolf, “Bit-Stuffing Bounds on the Capacity of 2-Dimensional Constrained Arrays,” Proc. 1998 IEEE Int. Symp. Inform. Theory, Cambridge, Massachusetts, p. 323, August 1998.


63. B.E. Moision, P.H. Siegel, and E. Soljanin, “Distance-Enhancing Codes for Digital Recording,” IEEE Trans. Magn., vol. 34, no. 1, pp. 69-74, Jan. 1998.


64. M. Oberg and P.H. Siegel, “Application of Distance Spectrum Analysis to the Improvement of Turbo Code Performance,” Proc. 35-th Annual Allerton Conf. on Commun., Control, and Computing, pp. 701-710, September 1997. (invited)


65. M. Oberg and P.H. Siegel, “Lowering the Error Floor for Turbo Codes,” Proc. Int. Symp. on Turbo Codes & Related Topics, (Brest, France), pp. 204-207, Sept. 1997


66. M. Oberg, A. Vityaev, and P.H. Siegel, “The Effect of Puncturing in Turbo Encoders," Proc. Int. Symp. on Turbo Codes & Related Topics, (Brest, France), pp. 184-187, Sept. 1997.
    



Book Chapters (most recent first)

1. J.B. Soriaga, H.D. Pfister, and P.H. Siegel, “On Approaching theCapacity of Finite-State Intersymbol Interference Channels,” Information, Coding, and Mathematics, M. Blaum, P.G. Farrell,and H.C.A. van Tilborg, eds., Kluwer Academic Publishers, 2002, pp. 365-378.


2. K.A.S. Immink, P.H. Siegel, and J.K. Wolf, “Codes for Digital Recorders,” Information Theory: 50 Years of Discovery, S.W. McLaughlin and S. Verdu, eds., IEEE Press, 1999, pp. 216-255.


3. B. Marcus, R. Roth, and P. Siegel, “Constrained Systems and Coding for Recording Channels,” Handbook of Coding Theory, Elsevier Scientific Publishers, 1998.(extended version of 2.)


4. B.Marcus, R. Roth, and P. Siegel, “Modulation Codes for Digital Data Storage,” Proc. of Symposia Applied Mathematics, vol. 50, AMS Short Course Proceedings, Different Aspects of Coding Theory, A. R. Calderbank, ed., 1995, pp. 41-94.


5. L. Fredrickson, R. Karabed, P. Siegel, and H. Thapar, “Decoding on a Finite State Transition Diagram While Avoiding a Sub-Diagram,” DIMACS Series in Discrete Math. and Theoretical Comp. Science, Proc. Joint DIMACS/IEEE Workshop on Coding and Quantization, vol. 14, October 1992, pp. 149-151.


Home Page

---



Last Updated: 3/31/08