Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 3 Mar 2021 in cs.IT, math.IT, and math.NT | (2103.02341v1)

Abstract: 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.