RECORD
A Study of the Separating Property in Reed-Solomon Codes by Bounding the Minimum Distance
Information Theory · Submitted 3 Mar 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. | background 1.00 | 0.05 | 0.02 | asserted 1.00 |
| s1 | It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. | background 1.00 | 0.04 | 0.03 | asserted 1.00 |
| s2 | Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. | gap 0.57 | 0.03 | 0.02 | asserted 0.50 |
| s3 | Under different assumptions, several papers have given a negative answer to the question. | background 0.94 | 0.03 | 0.02 | asserted 1.00 |
| s4 | In this paper further progress is made. | contribution 0.85 | 0.49 | 0.03 | asserted 0.69 |
| s5 | We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property. | result 0.82 | 0.96 | 0.93 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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.
Human review
How the literature uses it
What this paper does with the arXiv papers it cites
What it cites
Cites as background 1 paper
-
The IPP has received considerable attention in the recent years, having been studied by several authors [ref] .
Probabilistic Existence Results for Parent-Identifying Schemes · Introduction. · 0.99
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.