home Home research Research

Homepage of Punarbasu Purkayastha

I am a Research Fellow at the Coding and Cryptography Research Group, at the Department of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, under Yeow Meng Chee.

I completed my Ph.D. degree in Coding Theory in 2010 under the direction of Alexander Barg at the Department of Electrical and Computer Engineering, University of Maryland, College Park.

My research interests include Coding Theory, Combinatorics, Information Theory, and Communication Theory, and their applications to communications and storage. Currently, I am investigating coding and decoding strategies for Power Line Communications, and constructions of codes for nonvolatile memories.

CV (pdf) Research Google+ Github
Contact: punarbasu _at_ gmail _dot_ com

Publications and Preprints

For a detailed description click here. The author names are in alphabetical order.

Preprints

  1. Product Construction of Affine Codes,
    Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Patrick Solé,
    preprint, 12 pages, submitted for review.

Publications

Journal

  1. Importance of Symbol Equity in Coded Modulation for Power Line Communications,
    Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Chengmin Wang,
    IEEE Transactions on Communications, vol. 61, no. 10, pp. 4381 - 4390, October 2013.
    Source code of simulations
  2. Cross-Bifix-Free Codes Within a Constant Factor of Optimality,
    Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Chengmin Wang,
    IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4668 - 4674, July 2013.
  3. Estimates on the Size of Symbol Weight Codes,
    Yeow Meng Chee, Han Mao Kiah, and Punarbasu Purkayastha,
    IEEE Transactions on Information Theory, vol. 59, no. 1, pp. 301-314, January 2013.
  4. Near MDS poset codes and distributions,
    Alexander Barg, and Punarbasu Purkayastha,
    Error-Correcting Codes, Cryptography and Finite Geometries, Editors: A. Bruen and D. Wehlau, AMS series in Contemporary Mathematics, vol. 523, 2010, pp. 135-148.
  5. Bounds on ordered codes and orthogonal arrays,
    Alexander Barg, and Punarbasu Purkayastha,
    Moscow Mathematical Journal, vol. 9, no. 2, 2009, pp. 211-243.

Conference Proceedings

  1. Product Construction of Affine Codes,
    Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Patrick Solé,
    IEEE International Symposium on Information Theory (ISIT) 2014, Honolulu, Hawaii, USA, pp. 1441 - 1445.
  2. Rewritable Coset Coding for Flash Memories,
    Yeow Meng Chee, Han Mao Kiah, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory (ISIT) 2014, Honolulu, Hawaii, USA, pp. 2082 - 2086.
    Extended version with all proofs
    Source code of simulations
  3. Matrix Codes and Multitone Frequency Shift Keying for Power Line Communications,
    Yeow Meng Chee, Han Mao Kiah, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory (ISIT) 2013, Istanbul, Turkey, pp. 2870-2874.
    (full version in the link, 6 pages).
    Source code of simulations
  4. Efficient Decoding of Permutation Codes Obtained from Distance Preserving Maps,
    Yeow Meng Chee, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory 2012, Boston, MA, U.S.A, pp. 641-645.
    Extended version with all proofs.
    Source code of simulations
  5. Importance of Symbol Equity in Coded Modulation for Power Line Communications,
    Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Chengmin Wang,
    IEEE International Symposium on Information Theory 2012, Boston, MA, U.S.A, pp. 666-670.
    (Student Paper Award finalist. Student: Han Mao Kiah)
  6. Optimal Family of q-ary Codes Obtained From a Substructure of Generalised Hadamard Matrices,
    Carl Braken, Yeow Meng Chee, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory 2012, Boston, MA, U.S.A, pp. 116-119.
  7. Near MDS poset codes and distributions,
    Alexander Barg, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory 2010, Austin, Texas, U.S.A., pp. 1310-1314.
    (Student Paper Award finalist.)
  8. Bounds on ordered codes and orthogonal arrays,
    Alexander Barg, and Punarbasu Purkayastha,
    IEEE International Symposium on Information Theory 2007, Nice, France, pp. 331-335.

Thesis: Bounds on the size of codes

Note: It has come to our notice that the problem in Chapter 6 was solved in G. Katona, "Intersection theorems for systems of finite sets", Acta Math. Acad. Sci. Hungar., vol. 15, 1964, pp. 329-337.
We believe that the new techniques introduced in Chapter 6 are still interesting from the viewpoint of algebraic combinatorics, in light of the way the intertwining functions are used. See the "Concluding Remarks" at the end of Chapter 6.

Links

Github

Hop over to my Github page to see some of my programs.