Krishna Gopal Benerjee

Krishna Gopal Benerjee

Auto-generated profile, based on publicly available information

Krishna Gopal Benerjee

Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, India

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 October 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
KBKrishna Gopal Benerjee
Krishna Gopal Benerjee
ABAdrish Banerjee
Adrish Banerjee
We consider the problem of designing a set of DNA sequences (DNA codes) for various DNA computing applications, such as DNA based data storage. A chemically active DNA sequence forms unlikely secondary structure by folding back onto itself by hybridization among base pairs. DNA sequences with secondary structures are less active chemically and are needed to unfold before reading. On the other side, during synthesis and sequencing of DNA sequences with homopolymers of large run-length, errors occur frequently. In this letter, we have presented families of DNA codes with several properties such as DNA sequences free from secondary structures of stem length more than two and also free from homopolymers of run-length more than four. All constructed DNA sequences of any DNA codes are sufficiently dissimilar to their reverse-complement DNA sequences. Further, DNA sequences obtained by concatenating all those DNA sequences also avoid secondary structures and homopolymers.

13 October 2020 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
KBKrishna Gopal Benerjee
Krishna Gopal Benerjee
Sourav DebSourav Deb
Sourav Deb
Manish K. GuptaManish K. Gupta
Manish K. Gupta

26 June 2022
Verified
Conference Paper
Closed access
KBKrishna Gopal Benerjee
Krishna Gopal Benerjee
ABAdrish Banerjee
Adrish Banerjee
Motivated from Reed-Muller codes, families of reversible, reversible-complement, and GC-balanced DNA codes are constructed from the ring ℤ6. In addition, DNA codewords are free from any secondary structures having stems of length more than two and homopolymers with run-length more than three. Also, DNA strings obtained from concatenations of those DNA codewords avoid secondary structures and homopolymers. We have also given a lower bound on the size of DNA codes with all these properties together.

1 September 2015
Verified
Conference Paper
Closed access
KBKrishna Gopal Benerjee
Krishna Gopal Benerjee
MGManish Kumar Gupta
Manish Kumar Gupta
Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.

1 January 2021 in Problems of Information Transmission
Verified
Journal Article
Closed access
PDF file
KBK. G. Benerjee
K. G. Benerjee
Manish K. GuptaManish K. Gupta
Manish K. Gupta
We consider heterogeneous distributed storage systems (DSSs) having flexible reconstruction degree, where each node in the system has nonuniform repair bandwidth and nonuniform storage capacity. In particular, a data collector can reconstruct the file using some \(k\) nodes in the system and, for a node failure, the system can be repaired by some set of active nodes. Using min-cut bound, we investigate the fundamental trade-off between storage and repair costs for our model of the heterogeneous DSS. Further, the problem is formulated as bi-objective optimization linear programing problem for various heterogeneous DSSs. For some DSSs, it is shown that the calculated min-cut bound is tight.

20 February 2025 in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
Verified
Journal Article
Closed access
TNTamoghno Nath
Tamoghno Nath
KBKrishna Gopal Benerjee
Krishna Gopal Benerjee
ABAdrish Banerjee
Adrish Banerjee
Intersymbol Interference (ISI) has a detrimental impact on any Molecular Communication via Diffusion (MCvD) system. Also, the receiver noise can severely degrade the MCvD channel performance. However, the channel codes proposed in the literature for the MCvD system have only addressed one of these two challenges independently. In this paper, we have designed single Error Correcting Codes in an MCvD system with channel memory and noise. We have also provided encoding and decoding algorithms for the proposed codes, which are simple to follow despite having a non-linear code construction. Finally, through simulation results, we show that the proposed single ECCs, for given code parameters, perform better than the existing codes in the literature in combating the effect of ISI in the channel and improving the average Bit Error Rate (BER) performance in a noisy channel.