Explicit Good Subspace-metric Codes and Subset-metric Codes

TL;DR

This paper introduces subspace-metric and subset-metric codes, providing bounds and constructions that enhance insertion-deletion error correction capabilities and are suitable for folded codes.

Contribution

It defines new coordinate-independent pseudometrics, proves bounds for linear codes, and constructs explicit insertion-deletion codes with high correction capabilities.

Findings

Half-Singleton bounds for linear subspace-metric codes

Construction of high-rate deletion-correcting codes from subspace codes

Folded codes exhibit high subset distances, making them effective for insertion-deletion correction

Abstract

In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear subspace-metric codes and linear subset-metric codes are proved. Subspace distances and subset distances of codes are natural lower bounds for insdel distances of codes, and then can be used to lower bound the insertion-deletion error-correcting capabilities of codes. Our subspace-metric codes or subset-metric codes can be used to construct explicit well-structured insertion-deletion codes directly. $k$-deletion correcting codes with rate approaching $1$ can be constructed from subspace codes. By analysing the subset distances of folded codes from evaluation codes of linear mappings, we prove that they have high subset distances and then are explicit good insertion-deletion codes.