DNA codes over groups

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2024-10-23 DOI:10.1007/s10623-024-01515-6

Cain Álvarez-García, Carlos Alberto Castillo-Guillén, Mohamed Badaoui, Andriy Kryvko

引用次数: 0

Abstract

The purpose of this paper is to establish a one-to-one correspondence between k-tuples of DNA codewords and the elements of a finite group to simulate the reverse and the complement operations of codewords by an automorphism and a translation of the group, respectively, in order to determine the structure of DNA codes. Finally, the case of vector spaces is characterized.

Abstract Image

查看原文本刊更多论文

组上的 DNA 编码

本文的目的是在 DNA 密码的 k 元组和有限群的元素之间建立一一对应关系，分别通过群的自动变形和平移来模拟密码的反向和补码运算，从而确定 DNA 密码的结构。最后，对向量空间的情况进行了描述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.