April 1st, 2008
Academic Information |
Error-correcting codes, combinatorial and algebraic methods.
Peak-to-Average Power Reduction in OFDM systems
Covering codes: bounds and constructions.
Bounds on the error probabilities. Error exponents.
Spectra of codes. Binomial approximations.
Codes for special applications (magnetic recording, multiple access, etc.)
Orthogonal polynomials, esp. Krawtchouk polynomials.
Combinatorics, sphere-packings, exponential sums
- Courses I teach:
Digital Logic Design.
- Curriculum Vitae
Review by H.F.Mattson, Jr. in Mathematical Reviews
Peak Power Control in Multicarrier Communications,
Cambridge University Press, 292 pp.
G.Cohen, S.Litsyn, A.Lobstein, G.Zémor, (Eds.)
Algebraic Coding ,
(First French-Soviet Workshop, Paris, July
Springer-Verlag, Lecture Notes in Computer Science. VOL. 573, 1992
G.Cohen, S.Litsyn, G.Zémor, (Eds.)
(First French-Israeli Workshop, Paris, France, July 19 - 21,
Springer-Verlag, Lecture Notes in Computer Science. VOL. 781, 1994
Alexander Barg, and Simon Litsyn (Eds.)
Codes and Association Schemes,
DIMACS: Series in Discrete Mathematics and Theoretical Computer Science,
List of papers
and Association Schemes. DIMACS workshop, Nov. 9-12,
1999, Organizers: A.Barg
Table of the best known binary codes of length up to 512 and
minimum distance up to 30.
Table of the best known binary covering codes of length up to 33
and covering radius up to 10.
Department of Electrical Engineering-Systems
Fac. of Eng.
If you have any comments or questions about this page, please send them to