TU2.R6.4

On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes

Luca Tallini, University of Teramo, Italy; Hoang Vu, Bella Bose, Oregon State University, United States
Session:
Biology: Insertions and Deletions
Track:
17: Information and Coding in Biology
Location:
Sigma/Delta
Presentation Time:
Tue, 9 Jul, 12:30 - 12:50
Session Chair:
Maël Le Treust, CNRS
Abstract
In a systematic code (systematic in the strict sense) a check symbol is appended to the data word. Here, the theory and design of systematic binary block codes capable of correcting t insertion and/or deletion of the symbol 0 in each and every 0-run are studied. This problem is related to the zero error capacity achieving systematic codes in limited magnitude error channels. Optimal and sub-optimal systematic code designs and the encoding/decoding algorithms are given.
Session TU2.R6
TU2.R6.1: Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code
Yuhang Pi, Zhifang Zhang, Chinese Academy of Sciences, University of Chinese Academy of Sciences., China; Yaqian Zhang, Shanghai Jiao Tong University, China
TU2.R6.2: New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
Wentu Song, Kui Cai, Tony Quek, Singapore University of Technology and Design, Singapore
TU2.R6.3: Improving the Singleton-type Upper Bounds for Non-Linear Deletion Correcting Codes
Shiqin Liu, Chen Wang, Shandong University, China; Gennian Ge, Capital Normal University, China; Yiwei Zhang, Shandong University, China
TU2.R6.4: On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes
Luca Tallini, University of Teramo, Italy; Hoang Vu, Bella Bose, Oregon State University, United States
Resources
View Manuscript