Explicit construction of q-ary 2-deletion correcting codes with low redundancy

We consider the problem of efficient construction of q -ary 2-deletion correcting codes with low redundancy. We show that our construction requires less redundancy than any existing efficiently encodable q -ary 2-deletion correcting codes. Precisely speaking, we present an explicit construction of a...

Full description

Saved in:
Bibliographic Details
Main Authors: Liu, Shu, Tjuawinata, Ivan, Xing, Chaoping
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2024
Subjects:
Online Access:https://hdl.handle.net/10356/173448
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first