Vitaly Skachek

• Research

I am currently a Research Fellow with the Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore.

Research interests 

• Coding Theory
• Network Coding
• Information Theory
• Combinatorics
• Theoretical Computer Science

Major Publications 

Copyright notice: The material presented on this page is a subject for copyright and other rights. Personal use of this material is permitted. However, it is understood that any copying/reprinting/redistribution of this material or any component of it should be done in accordance to the rules imposed by its copyright holder. The final versions of these papers can be obtained directly from the corresponding copyright holders.

Theses 

• V. Skachek, Low-Density Parity-Check Codes: Constructions and Bounds, Ph. D. Thesis, Technion, Haifa, Israel, January 2007.



• V. Skachek, Coding for Spectral-Null Constraints (in Hebrew), Master's Thesis, Technion, Haifa, Israel, February 1998.

Journals 

• V. Skachek, Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming, submitted.



• E. Byrne, M. Greferath, A. Kohnert, V. Skachek, New Bounds for Codes Over Finite Frobenius Rings, submitted.



• V. Skachek, Recursive Code Construction for Random Networks, submitted.



• M.F. Flanagan, V. Skachek, E. Byrne, M. Greferath, Linear-programming Decoding of Non-binary Linear Codes, IEEE Trans. On Inform. Theory, vol. 55, pp. 4134-4154, September 2009.



• V. Skachek, R.M. Roth, Probabilistic Algorithm for Finding Roots of Linearized Polynomials, Designs, Codes and Cryptography, vol. 46:1, pp. 17-23, January 2008.



• A. Ashikhmin, V. Skachek, Decoding of Expander Codes at Rates Close to Capacity, IEEE Trans. On Inform. Theory, vol. 52, pp. 5475-5485, December 2006.



• R.M. Roth, V. Skachek, Improved Nearly-MDS Expander Codes, IEEE Trans. On Inform. Theory, vol. 52, pp. 3650-3661, August 2006.



• V. Skachek, T. Etzion, R.M. Roth, Efficient Encoding Algorithm for Third-Order Spectral-Null Codes, IEEE Trans. On Inform. Theory, vol. 44, pp. 846-851, March 1998.

Conferences 

• V. Skachek, On LP Decoding of Nonbinary Expander Codes, Proc. IEEE International Symposium on Information Theory (ISIT), Seoul, Korea, June-July 2009.



• E. Byrne, M. Greferath, A. Kohnert, V. Skachek, Refined Bounds for Ring-Linear Codes, Proc. 6^th International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, June 2009.



• V. Skachek, M.F. Flanagan, Lower Bounds on the Minimum Pseudodistance for Linear Codes with q-ary PSK Modulation over AWGN, Proc. 5^th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 2008.



• V. Skachek, M.F. Flanagan, E. Byrne, M. Greferath, Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes, Proc. IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, July 2008.



• V. Skachek, Minimum Distance Bounds for Expander Codes (invited paper, the open problems session), Information Theory and Applications Workshop (ITA), UCSD, San Diego, CA, USA, January 2008.



• M.F. Flanagan, V. Skachek, E. Byrne, M. Greferath Linear-programming Decoding of Non-binary Linear Codes, Proc. 7^th International ITG Conference on Source and Channel Coding (SCC), Ulm, Germany, January 2008.



• A. Ashikhmin, V. Skachek, Decoding of Expander Codes at Rates Close to Capacity, Proc. IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, September 2005.



• R.M. Roth, V. Skachek, On Nearly-MDS Expander Codes, Proc. IEEE International Symposium on Information Theory (ISIT), Chicago, IL, USA, June-July 2004, p. 8.



• V. Skachek, R.M. Roth, Generalized Minimum Distance Iterative Decoding of Expander Codes, Proc. IEEE Information Theory Workshop (ITW), Paris, France, March-April 2003, pp. 245-248.



• V. Skachek, T. Etzion, R.M. Roth, Efficient Encoding Algorithm for Third-Order Spectral-Null Codes, Proc. IEEE Information Theory Workshop (ITW), Svalbard, Norway, July 1997, pp. 32-33.

Selected Presentations

·         Asymptotic Goodness of Expander Codes with Weak Constituent Codes, The Shannon Workshop on Coding and Cryptography, University College Cork, Cork, Ireland, May 2007.

·         Expander Codes: Constructions and Bounds, Ph.D. Seminar, Computer Science Department, Technion, November 2006.

·         Decoding of Expander Codes at Rates Close to Capacity, IEEE International Symposium on Information Theory 2005, Adelaide, Australia, September 2005.

·         On Nearly-MDS Expander Codes, IEEE International Symposium on Information Theory 2004, Chicago, USA, June-July 2004.

---

• Teaching position

During the Fall 2009 semester I am teaching Calculus III -- MAS211.

In the past, I was also lecturing the following courses at UCD:

• Linear Algebra -- MST1003E,

and at the Technion:

• Introduction to C Language -- 234112,
• Introduction to Computer Science -- 234111/4/7.

Past TA appointments include the following courses:

• Introduction to System Programming (MATAM) -- 234122,
• Combinatorics for Computer Science -- 234141,
• Discrete Mathematics -- 234144,
• Algorithms in Graph Theory -- 234246,
• Structure of Digital Computers (MAMAS) -- 234267,
• Coding for Storage Systems -- 236520.

---

• Education

Ph.D. in Computer Science, Technion, January 2007.
    Supervisor: Prof. Ronny Roth. 
    Research topic: Low-Density Parity-Check Codes.

M.Sc. in Computer Science, Technion, March 1998. 
    Suprevisors: Prof. Tuvi Etzion and Prof. Ronny Roth. 
    Research topic: Coding for Spectral-Null Constraints.   

B.A in Computer Science, Technion, December 1994.

---

• Contact Information

Vitaly Skachek
Division of Mathematical Sciences
School of Physical and Mathematical Sciences
SPMS-MAS-03-01
Nanyang Technological University
21 Nanyang Link
637371 Singapore

E-mail: Vitaly.Skachek at ntu.edu.sg

---