Binary Error Correcting Code for DNA Databank

2017 ◽  
pp. 1-12
Author(s):  
Jagannath Samanta ◽  
Jaydeb Bhaumik ◽  
Soma Barman ◽  
Raj Kumar Maity
Keyword(s):  
Error Correcting Code

An error-correcting code framework for genetic sequence analysis

2004 ◽  
Vol 341 (1-2) ◽  
pp. 89-109 ◽  
Author(s):  
Elebeoba E. May ◽  
Mladen A. Vouk ◽  
Donald L. Bitzer ◽  
David I. Rosnick
Keyword(s):  
Sequence Analysis ◽  
Error Correcting Code ◽  
Genetic Sequence ◽  
Genetic Sequence Analysis

scholarly journals An Application of p-Fibonacci Error-Correcting Codes to Cryptography

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 789
Author(s):  
Emanuele Bellini ◽  
Chiara Marcolla ◽  
Nadir Murru
Keyword(s):  
Error Correcting Code ◽  
Error Correcting Codes ◽  
Multiparty Computation ◽  
Zero Knowledge ◽  
Signature Schemes ◽  
Standardization Process ◽  
Technology Standardization

In addition to their usefulness in proving one’s identity electronically, identification protocols based on zero-knowledge proofs allow designing secure cryptographic signature schemes by means of the Fiat–Shamir transform or other similar constructs. This approach has been followed by many cryptographers during the NIST (National Institute of Standards and Technology) standardization process for quantum-resistant signature schemes. NIST candidates include solutions in different settings, such as lattices and multivariate and multiparty computation. While error-correcting codes may also be used, they do not provide very practical parameters, with a few exceptions. In this manuscript, we explored the possibility of using the error-correcting codes proposed by Stakhov in 2006 to design an identification protocol based on zero-knowledge proofs. We showed that this type of code offers a valid alternative in the error-correcting code setting to build such protocols and, consequently, quantum-resistant signature schemes.

scholarly journals Palmprint Based Multidimensional Fuzzy Vault Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Hailun Liu ◽  
Dongmei Sun ◽  
Ke Xiong ◽  
Zhengding Qiu
Keyword(s):  
Error Correcting Code ◽  
Experimental Results ◽  
Fuzzy Vault ◽  
Biometric Template ◽  
Template Protection ◽  
Biometric Template Protection

Fuzzy vault scheme (FVS) is one of the most popular biometric cryptosystems for biometric template protection. However, error correcting code (ECC) proposed in FVS is not appropriate to deal with real-valued biometric intraclass variances. In this paper, we propose a multidimensional fuzzy vault scheme (MDFVS) in which a general subspace error-tolerant mechanism is designed and embedded into FVS to handle intraclass variances. Palmprint is one of the most important biometrics; to protect palmprint templates; a palmprint based MDFVS implementation is also presented. Experimental results show that the proposed scheme not only can deal with intraclass variances effectively but also could maintain the accuracy and meanwhile enhance security.

401 km, 622 Mb/s and 357 km, 2.488 Gb/s IM/DD repeaterless transmission experiments using erbium-doped fiber amplifiers and error correcting code

1992 ◽  
Vol 4 (10) ◽  
pp. 1148-1151 ◽  
Author(s):  
P.M. Gabla ◽  
J.L. Pamart ◽  
R. Uhel ◽  
E. Leclerc ◽  
J.O. Frorud ◽  
...  
Keyword(s):  
Error Correcting Code ◽  
Fiber Amplifiers ◽  
Erbium Doped

Codes from multipartite graphs and minimal permutation decoding sets

2015 ◽  
Vol 07 (04) ◽  
pp. 1550060
Author(s):  
P. Seneviratne
Keyword(s):  
Automorphism Group ◽  
Error Correcting Code ◽  
Binary Codes ◽  
Hard Problem ◽  
Complete Multipartite Graph ◽  
Decoding Algorithm ◽  
Permutation Decoding ◽  
Multipartite Graphs ◽  
Multipartite Graph ◽  
Complete Multipartite

Permutation decoding method developed by MacWilliams and described in [Permutation decoding of systematic codes, Bell Syst. Tech. J. 43 (1964) 485–505] is a decoding technique that uses a subset of the automorphism group of the code called a PD-set. The complexity of the permutation decoding algorithm depends on the size of the PD-set and finding a minimal PD-set for an error correcting code is a hard problem. In this paper we examine binary codes from the complete-multipartite graph [Formula: see text] and find PD-sets for all values of [Formula: see text] and [Formula: see text]. Further we show that these PD-sets are minimal when [Formula: see text] is odd and [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document