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

page 1

page 2

page 3

page 4

research
05/27/2018

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

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

A family of codes with locality containing optimal codes

Locally recoverable codes were introduced by Gopalan et al. in 2012, and...
research
09/18/2023

On the Minimum Distance, Minimum Weight Codewords, and the Dimension of Projective Reed-Muller Codes

We give an alternative proof of the formula for the minimum distance of ...
research
05/10/2023

CSS-T Codes from Reed Muller Codes for Quantum Fault Tolerance

CSS-T codes are a class of stabilizer codes introduced by Rengaswami et ...
research
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...
research
07/11/2018

On nested code pairs from the Hermitian curve

Nested code pairs play a crucial role in the construction of ramp secret...
research
06/20/2022

Two-sided Robustly Testable Codes

We show that the tensor product of two random linear codes is robustly t...

Please sign up or login with your details

Forgot password? Click here to reset