A Study of the Separating Property in Reed-Solomon Codes by Bounding the Minimum Distance

03/03/2021
by   Marcel Fernandez, et al.
0

According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/27/2018

Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes

Motivated by applications in combinatorial design theory and constructin...
01/19/2021

A family of codes with locality containing optimal codes

Locally recoverable codes were introduced by Gopalan et al. in 2012, and...
12/11/2020

Classification of 8-divisible binary linear codes with minimum distance 24

We classify 8-divisible binary linear codes with minimum distance 24 and...
07/30/2019

High dimensional affine codes whose square has a designed minimum distance

Given a linear code C, its square code C^(2) is the span of all componen...
05/05/2021

Improved Singleton bound on insertion-deletion codes and optimal constructions

Insertion-deletion codes (insdel codes for short) play an important role...
02/05/2020

Embedding linear codes into self-orthogonal codes and their optimal minimum distances

We obtain a characterization on self-orthogonality for a given binary li...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.