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.
Contact: punarbasu _at_ gmail _dot_ com

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

Product Construction of Affine Codes,
Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, and Patrick
Solé,
preprint, 5 pages, to appear in IEEE International Symposium on
Information Theory 2014.

Rewritable Coset Coding for Flash
Memories,
Yeow Meng Chee, Han Mao Kiah, and Punarbasu Purkayastha,
preprint, 5 pages, to appear in IEEE International Symposium on
Information Theory 2014.
Source code of simulations
Publications
Journal

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

CrossBifixFree 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.

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.
301314, January 2013.

Near MDS poset codes and distributions,
Alexander Barg, and Punarbasu Purkayastha,
ErrorCorrecting Codes, Cryptography and Finite Geometries,
Editors: A. Bruen and D. Wehlau, AMS series in Contemporary
Mathematics, vol. 523, 2010, pp. 135148.

Bounds on ordered codes and orthogonal arrays,
Alexander Barg, and Punarbasu Purkayastha,
Moscow Mathematical Journal, vol. 9, no. 2, 2009, pp. 211243.
Conference Proceedings

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. 28702874.
(full version in the link, 6 pages).
Source code of simulations

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. 641645.
Extended
version with all proofs.
Source code of simulations

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. 666670.
(Student Paper Award finalist. Student: Han Mao Kiah)

Optimal Family of qary 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. 116119.

Near MDS poset codes and distributions,
Alexander Barg, and Punarbasu Purkayastha,
IEEE International Symposium on Information Theory 2010, Austin,
Texas, U.S.A., pp. 13101314.
(Student Paper Award finalist.)

Bounds on ordered codes and orthogonal arrays,
Alexander Barg, and Punarbasu Purkayastha,
IEEE International Symposium on Information Theory 2007, Nice,
France, pp. 331335.
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. 329337.
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
 Sage
I am a contributor to the Sage
mathematical software system. My major contributions have been
to the graphics and coding theory subsystem. I have minor
contributions to other components of Sage, including
Latex, linear algebra, and the Sage notebook.
Click here to access my bug or patch submission history.
 Links to coauthor webpages
(alphabetical)
Github
Hop over to my
Github page to see some of my programs.
 papers contains
(and will contain any future) programs written for simulations in
my publications. The programs are
written in C, MATLAB, and Sage/Python/Cython.

sagepatches contains some pending patches to the Sage
mathematical software system.
This repository is not updated anymore since Sage has migrated
to a git based system, from a mercurial based system.
 btex: This
bash script is used for handling my latex compilation!
 quietemerge:
This bash script is like a wrapper around the Gentoo's package
update command called emerge, and is used to update my
Gentoo Linux installation. It was released in 2009 in the Gentoo
forums. Link to its
Google code page.
 easy_efl:
Another bash script which is a fork of a similarly named script. It
is used to update a system installation of EnlightenmentDR19.
This script is a modified version of the original
Easy_EFL.sh. It does not (yet) have all the
modifications I performed on the previous script called
Easy_E17.sh
that was used to update EnlightenmentDR17.