The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paul H. Siegel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Brian H. Marcus, Paul H. Siegel, Jack K. Wolf
    Finite-State Modulation Codes for Data Storage. [Citation Graph (0, 0)][DBLP]
    IEEE Journal on Selected Areas in Communications, 1992, v:10, n:1, pp:5-37 [Journal]
  2. Navin Kashyap, Paul H. Siegel
    Equalities among Capacities of (d, k)-Constrained Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:2, pp:276-297 [Journal]
  3. Navin Kashyap, Paul H. Siegel, Alexander Vardy
    An Application of Ramsey Theory to Coding for the Optical Channel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:921-937 [Journal]
  4. Jilei Hou, Paul H. Siegel, Laurence B. Milstein
    Design of multi-input multi-output systems based on low-density Parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:4, pp:601-611 [Journal]
  5. André P. des Rosiers, Paul H. Siegel
    On performance bounds for space-time codes on fading channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2004, v:52, n:10, pp:1688-1697 [Journal]
  6. Hugo M. Tullberg, Paul H. Siegel
    Serial concatenated TCM with an inner accumulate code-part I: maximum-likelihood analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:1, pp:64-73 [Journal]
  7. Hugo M. Tullberg, Paul H. Siegel
    Serial concatenated TCM with an inner accumulate code - part II: density-evolution analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:2, pp:252-262 [Journal]
  8. Yan Zhang, Laurence B. Milstein, Paul H. Siegel
    Tradeoff between diversity gain and interference suppression in a MIMO MC-CDMA system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:4, pp:623-631 [Journal]
  9. Shirish A. Altekar, Magnus Berggren, Bruce E. Moision, Paul H. Siegel, Jack K. Wolf
    Error-Event Characterization on Partial-Response Channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:241-247 [Journal]
  10. Jonathan J. Ashley, Michael Hilden, Patrick Perry, Paul H. Siegel
    Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:3, pp:1110-0 [Journal]
  11. Jonathan J. Ashley, Razmik Karabed, Paul H. Siegel
    Complexity and sliding-block decodability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1925-1947 [Journal]
  12. Jonathan J. Ashley, Paul H. Siegel
    A note on the Shannon capacity of run-length-limited codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:601-0 [Journal]
  13. Sharon Aviran, Paul H. Siegel, Jack K. Wolf
    An improvement to the bit stuffing algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2885-2891 [Journal]
  14. A. Robert Calderbank, Paul H. Siegel, Jack K. Wolf
    Introduction to special issue on coding for storage devices. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:709-711 [Journal]
  15. Jiangxin Chen, Paul H. Siegel
    On the symmetric information rate of two-dimensional finite-state ISI channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:227-236 [Journal]
  16. Shirley Halevy, Jiangxin Chen, Ron M. Roth, Paul H. Siegel, Jack K. Wolf
    Improved bit-stuffing bounds on two-dimensional constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:824-838 [Journal]
  17. Chris Heegard, Brian H. Marcus, Paul H. Siegel
    Variable-length state splitting with applications to average runlength-constrained (ARC) codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:759-777 [Journal]
  18. Jilei Hou, Paul H. Siegel, Laurence B. Milstein, Henry D. Pfister
    Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2141-2155 [Journal]
  19. Kees A. Schouhamer Immink, Paul H. Siegel, Jack K. Wolf
    Codes for Digital Recorders. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2260-2299 [Journal]
  20. Navin Kashyap, Paul H. Siegel
    Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1327-1331 [Journal]
  21. Navin Kashyap, Paul H. Siegel, Alexander Vardy
    Coding for the optical channel: the ghost-pulse constraint. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:64-77 [Journal]
  22. Razmik Karabed, Paul H. Siegel
    Matched spectral-null codes for partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:818-855 [Journal]
  23. Razmik Karabed, Paul H. Siegel, Emina Soljanin
    Constrained coding for binary channels with high intersymbol interference. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1777-1797 [Journal]
  24. Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf
    Joint message-passing decoding of LDPC Codes and partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1410-1422 [Journal]
  25. Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf
    Joint message-passing decoding of ldpc codes and partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:8, pp:2076-0 [Journal]
  26. Brian H. Marcus, Paul H. Siegel
    On codes with spectral nulls at rational submultiples of the symbol frequency. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:557-568 [Journal]
  27. Bruce E. Moision, Alon Orlitsky, Paul H. Siegel
    On codes that avoid specified differences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:433-442 [Journal]
  28. Henry D. Pfister, Paul H. Siegel
    The serial concatenation of rate-1 codes through uniform random interleavers. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1425-1438 [Journal]
  29. Ron M. Roth, Paul H. Siegel
    Lee-metric BCH codes and their application to constrained and partial-response channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1083-1096 [Journal]
  30. Ron M. Roth, Paul H. Siegel, Alexander Vardy
    High-order spectral-null codes - Construction and bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1826-1840 [Journal]
  31. Ron M. Roth, Paul H. Siegel, Jack K. Wolf
    Efficient coding schemes for the hard-square model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:3, pp:1166-1176 [Journal]
  32. Paul H. Siegel
    Editorial: The transactions goes monthly. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:3- [Journal]
  33. Paul H. Siegel
    Review of 'Finite Fields for Computer Scientists and Engineers' (McEliece, R.J.; 1987). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:1, pp:315-0 [Journal]
  34. Alexander Vardy, Mario Blaum, Paul H. Siegel, Glenn T. Sincerbox
    Conservative arrays: multidimensional modulation codes for holographic recording. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:227-230 [Journal]
  35. Xin-Wen Wu, Paul H. Siegel
    Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2579-2587 [Journal]
  36. Junsheng Han, Paul H. Siegel, Patrick Lee
    On the Probability of Undetected Error for Overextended Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3662-3669 [Journal]
  37. Mohammad H. Taghavi, G. C. Papen, Paul H. Siegel
    On the Multiuser Capacity of WDM in a Nonlinear Optical Fiber: Coherent Communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5008-5022 [Journal]
  38. Joseph B. Soriaga, Henry D. Pfister, Paul H. Siegel
    Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1416-1429 [Journal]
  39. Junsheng Han, Paul H. Siegel
    Improved Upper Bounds on Stopping Redundancy. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:90-104 [Journal]
  40. Mohammad H. Taghavi, Paul H. Siegel
    Adaptive Methods for Linear Programming Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  41. Mohammad H. Taghavi, Paul H. Siegel
    Adaptive Linear Programming Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  42. Mohammad H. Taghavi, Paul H. Siegel
    Graph-Based Decoding in the Presence of ISI [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  43. Nonlinear Transition Shift and Write Precompensation in Perpendicular Magnetic Recording. [Citation Graph (, )][DBLP]


  44. Characterizing flash memory: anomalies, observations, and applications. [Citation Graph (, )][DBLP]


  45. Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation. [Citation Graph (, )][DBLP]


  46. Relaxation Bounds on the Minimum Pseudo-Weight of Linear Block Codes [Citation Graph (, )][DBLP]


  47. On the Asymptotic Performance of Iterative Decoders for Product Codes [Citation Graph (, )][DBLP]


  48. Coding for the Optical Channel: the Ghost-Pulse Constraint [Citation Graph (, )][DBLP]


  49. Improved Upper Bounds on Stopping Redundancy [Citation Graph (, )][DBLP]


  50. Single-Exclusion Number and the Stopping Redundancy of MDS Codes [Citation Graph (, )][DBLP]


  51. Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application [Citation Graph (, )][DBLP]


  52. Gaussian Belief Propagation Based Multiuser Detection [Citation Graph (, )][DBLP]


  53. Gaussian Belief Propagation Solver for Systems of Linear Equations [Citation Graph (, )][DBLP]


  54. Multidimensional Flash Codes [Citation Graph (, )][DBLP]


  55. Efficient implementation of linear programming decoding [Citation Graph (, )][DBLP]


  56. A Nearly Optimal Construction of Flash Codes [Citation Graph (, )][DBLP]


  57. Storage Coding for Wear Leveling in Flash Memories [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002