Ronny Roth

Phone:	+972-4-829-4291
Fax:	+972-4-829-3900
E-mail:	ronny@cs.technion.ac.il
Location:	Taub Building 637
Address:	Computer Science Department Technion--Israel Institute of Technology Haifa 32000, ISRAEL

Areas of interest

Error-Correcting Codes
Coding for Magnetic and Optical Recording
Application of Coding Theory to Complexity
Information Theory

Introduction to Coding Theory

Published by Cambridge University Press. Hardback, 566+xi pages, ISBN 0521845041.

Table of Contents.

Where to order: Publisher site Amazon among other bookselling sites.

Corrections: See the list of changes that were inserted in the second printing (2007).

Solution set: Teachers who plan to use the book as a textbook can obtain the solutions to the problems by contacting the publisher's book resources.

Courses

Publications

Itemized list of journal articles

Recent journal articles

R.M. Roth, P.O. Vontobel, List decoding of burst errors, IEEE Trans. Inform. Theory, 55 (2009), 4179-4190.
J. Han, P.H. Siegel, R.M. Roth, Single-exclusion number and the stopping redundancy of MDS codes, IEEE Trans. Inform. Theory, 55 (2009), 4155-4166.
I. Tal, T. Etzion, R.M. Roth, On row-by-row coding for 2-D constraints, IEEE Trans. Inform. Theory, 55 (2009), 3565-3576.
R.M. Roth, W. Robinett, P.J. Kuekes, R.S. Williams, Defect-tolerant demultiplexer circuits based on threshold logic and coding, Nanotechnology, 20 No. 13 (1 April 2009) 135201.
R.M. Roth, K. Viswanathan, On the hardness of decoding the Gale-Berlekamp code, IEEE Trans. Inform. Theory, 54 (2008), 1050-1060.
V. Skachek, R.M. Roth, Probabilistic algorithm for finding roots of linearized polynomials, Designs, Codes, and Cryptography, 46 (2008), 17-23.
R.M. Roth, G. Seroussi, Bounds for binary codes with narrow distance distributions, IEEE Trans. Inform. Theory, 53 (2007), 2760-2768.
R.M. Roth, V. Skachek, Improved nearly-MDS expander codes, IEEE Trans. Inform. Theory, 52 (2006), 3650-3661.
E. Louidor, R.M. Roth, Lowest density MDS codes over extension alphabets, IEEE Trans. Inform. Theory, 52 (2006), 3186-3197.
P.J. Kuekes, W. Robinett, R.M. Roth, G. Seroussi, G.S. Snider, R.S. Williams, Resistor-logic demultiplexers for nanoelectronics based on constant-weight codes, Nanotechnology, 17 (2006), 1052-1061.
R.M. Roth, G. Seroussi, Symbol-intersecting codes, IEEE Trans. Inform. Theory, 51 (2005), 2266-2281.

Surveys

B.H. Marcus, R.M. Roth, P.H. Siegel, Constrained systems and coding for recording channels, Handbook of Coding Theory, V.S. Pless and W.C. Huffman (Editors), Elsevier, Amsterdam, 1998, pp. 1635-1764.
A short version of this survey, by the same authors, appeared under the title "Modulation codes for digital data storage," in Different Aspects of Coding Theory, Proceedings of Symposia in Applied Mathematics, Vol. 50, R.C. Calderbank (Editor), American Mathematical Society, Providence, Rhode Island, 1995, pp. 41-87.

Recent conference articles (that have no journal version)

A. Mazumdar, R.M. Roth, P.O. Vontobel, On linear balancing sets, Proc. IEEE Int'l Symp. on Information Theory, Seoul, Korea (June 2009), 2699-2703.
I. Tal, R.M. Roth, Concave programming upper bounds on the capacity of 2-D constraint, Proc. IEEE Int'l Symp. on Information Theory, Seoul, Korea (June 2009), 1060-1064.
E. Ordentlich, R.M. Roth, Approximate enumerative coding for 2-D constraints through ratios of matrix products, Proc. IEEE Int'l Symp. on Information Theory, Seoul, Korea (June 2009), 1050-1054.
A. Bremler-Barr, D. Hay, D. Hendler, R.M. Roth, PEDS: A Parallel error detection scheme for TCAM devices, Proc. 28th IEEE Conference on Computer Communication (INFOCOM 2009), Rio de Janeiro, Brazil (April 2009), 1296-1304.
A. Sharov, R.M. Roth, Two-dimensional constrained coding based on tiling, Proc. IEEE Int'l Symp. on Information Theory, Toronto, Ontario (July 2008), 1468-1472.
I. Tal, R.M. Roth, Bounds on the rate of 2-D bit-stuffing encoders, Proc. IEEE Int'l Symp. on Information Theory, Toronto, Ontario (July 2008), 1463-1467.
E. Ordentlich, R.M. Roth, Capacity lower bounds and approximate enumerative coding for 2-D constraints, Proc. IEEE Int'l Symp. on Information Theory, Nice, France (June 2007), 1681-1685.
I. Tal, R.M. Roth, On list decoding of alternant codes in the Hamming and Lee metrics, IEEE Int'l Symp. on Information Theory, Yokohama, Japan (June 2003).

Patents

P.J. Kuekes, W.J. Robinett, R.M. Roth, G. Seroussi, G.S. Snider, R.S. Williams, Constant-weight-code-based addressing of nanoscale and mixed microscale/nanoscale arrays, US Patent 7,489,583, 2009.
R.M. Roth, G. Seroussi, Error detection and correction in a layered, 3-dimensional storage architecture, US Patent 7,206,987, 2007.
J.N. Hogan, R.M. Roth, Fault-tolerant neighborhood-disjoint address logic for solid state memory, US Patent 6,535,455, 2003.
R.M. Roth, G. Seroussi, I.F. Blake, Burst error and additional random bit error correction in a memory, US Patent 6,532,565, 2003.
J.N. Hogan, R.M. Roth, Method of generating address configurations for solid state memory, US Patent 6,466,512, 2002.
J.N. Hogan, R.M. Roth, Fault-tolerant address logic for solid state memory, US Patent 6,459,648, 2002.
I.F. Blake, R.M. Roth, G. Seroussi, Apparatus and method for efficient arithmetic in finite fields through alternative representation, US Patent 6,199,087, 2001, and US Patent 6,466,959, 2002.
J.N. Hogan, R.M. Roth, G. Ruckenstein, Method and apparatus having cascaded decoding for multiple runlength-limited channel codes, US Patent 6,188,335, 2001.
E. Ordentlich, R.M. Roth, Two-dimensional DC-free encoder and decoder, US Patent 6,175,317, 2001.
Z. Yakhini, P.G. Webb, R.M. Roth, Partitioning of polymorphic DNAs, US Patent 6,074,831, 2000.
R.M. Roth, Method and apparatus for generating runlength-limited coding with DC control, US Patent 6,002,718, 1999, and European Patent 771,078, 2000.
R.M. Roth, G. Seroussi, Error correction method and apparatus based on two-dimensional code array with reduced redundancy, US Patent 5,719,884, 1998.
M. Blaum, R.M. Roth, Method and means for coding and rebuilding the data contents of unavailable DASDs or rebuilding the contents of a DASD in error in the presence of a reduced number of unavailable DASDs in a DASD array, US Patent 5,351,246, 1994.

Information theory links

To the Computer Science Department home page