On a class of codes for the insertion-deletion metric

被引：0
|
作者：
D'yachkov, A [1 ]
Torney, D [1 ]
Vilenkin, P [1 ]
White, S [1 ]
机构：
[1] Moscow MV Lomonosov State Univ, Moscow, Russia
来源：
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/ISIT.2002.1023644
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study a class of q-ary codes for the insertion - deletion distance function [1] in the space of q-ary n-sequences. For q = 4, the codes arise from the potentialities of molecular biology [2, 3]. With the help of random coding arguments we obtain a lower bound on the code rate.
引用
收藏
页码：372 / 372
页数：1
相关论文
共 50 条
  • [1] Feedback Insertion-Deletion Codes
    Maringer, G.
    Polyanskii, N. A.
    Vorobyev, I. V.
    Welter, L.
    PROBLEMS OF INFORMATION TRANSMISSION, 2021, 57 (03) : 212 - 240
  • [2] Feedback Insertion-Deletion Codes
    G. Maringer
    N. A. Polyanskii
    I. V. Vorobyev
    L. Welter
    Problems of Information Transmission, 2021, 57 : 212 - 240
  • [3] Feedback Insertion-Deletion Codes
    Maringer, Georg
    Polyanskii, Nikita
    Vorobyev, Ilya
    Welter, Lorenz
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [4] A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes
    D'yachkov, AG
    Macula, AJ
    Pogozelski, WK
    Renz, TE
    Rykov, VV
    Torney, DC
    DNA COMPUTING, 2005, 3384 : 90 - 103
  • [5] Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions
    Chen, Bocong
    Zhang, Guanghui
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (05) : 3028 - 3033
  • [6] Insertion-Deletion with Substitutions II
    Vu, Martin
    Fernau, Henning
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2020, 2020, 12442 : 231 - 243
  • [7] Formalization of Insertion/Deletion Codes and the Levenshtein Metric in Lean
    Kong, Justin
    Webb, David J.
    Hagiwara, Manabu
    PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, : 11 - 15
  • [8] Matrix insertion-deletion systems
    Petre, Ion
    Verlan, Sergey
    THEORETICAL COMPUTER SCIENCE, 2012, 456 : 80 - 88
  • [9] Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes
    Chen, Hao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5126 - 5132
  • [10] Recent Developments on Insertion-Deletion Systems
    Verlan, Sergey
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2010, 18 (02) : 210 - 245
12345