Variable-Length Codes Independent or Closed with respect to Edit Relations

04/29/2021
by   Jean Néraud, et al.
0

We investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewords act. The study is relied upon the two concepts of independent and closed sets. We focus to those word relations whose images are computed by applying some peculiar combinations of deletion, insertion, or substitution. In particular, characterizations of variable-length codes that are maximal in the families of τ-independent or τ-closed codes are provided.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

Complete Variable-Length Codes: An Excursion into Word Edit Operations

Given an alphabet A and a binary relation τ⊆ A * x A * , a language X ⊆ ...
research
03/07/2018

Some binary BCH codes with length n=2^m+1

Under research for near sixty years, Bose-Ray-Chaudhuri-Hocquenghem(BCH)...
research
11/27/2018

An explicit representation and enumeration for negacyclic codes of length 2^kn over Z_4+uZ_4

In this paper, an explicit representation and enumeration for negacyclic...
research
03/16/2021

Decoding of Variable Length PLH Codes

In this paper, we address the problem of the decoding of variable length...
research
01/06/2020

Coding for Sequence Reconstruction for Single Edits

The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
research
09/05/2023

Topologies for Error-Detecting Variable-Length Codes

Given a finite alphabet A, a quasi-metric d over A^*, and a non-negative...
research
01/16/2018

Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback

In this paper, we investigate the necessity of finite blocklength codes ...

Please sign up or login with your details

Forgot password? Click here to reset