The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Secret sharing schemes from three classes of linear codes
Abstract
Secret sharing has been a subject of study for over 20 years, and has had a number of real-world applications. There are several approaches to the construction of secret sharing schemes. One of them is based on coding theory. In principle, every linear code can be used to construct secret sharing schemes. But determining the access structure is very hard as this requires the complete characterization of the minimal codewords of the underlying linear code, which is a difficult problem in general. In this paper, a sufficient condition for all nonzero codewords of a linear code to be minimal is derived from exponential sums. Some linear codes whose covering structure can be determined are constructed, and then used to construct secret sharing schemes with nice access structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
Lide, R., & Niederreiter, H. (1996) · Cited by 2,213
Karnin, E., Greene, J., & Hellman, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056621 · Cited by 630
On sharing secrets and Reed-Solomon codes
McEliece, R. J., & Sarwate, D. V. (1981) · Communications of the ACM · doi:10.1145/358746.358762 · Cited by 625
Minimal vectors in linear codes
Ashikhmin, A., & Barg, A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705584 · Cited by 348
Minimal Codewords and Secret Sharing
Massey, J. L. (1999) · Cited by 249
Covering and Secret Sharing with Linear Codes
Ding, C., & Yuan, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45066-1_2 · Cited by 132
Self-citationSecret-sharing with a class of ternary codes
Ding, C., Kohel, D., & Ling, S. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00207-3 · Cited by 37
Self-citation
Cited by
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
Ding, K., & Ding, C. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2473861 · Cited by 315
Self-citation
Metadata
- Authors
- Yuan, J., & Ding, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-01
- Volume
- 52
- Issue
- 1
- Pages
- 206-212
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2120756519
- Cited by
- 310
- References
- 9
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Secret sharing schemes from three classes of linear codes. https://app.cochat.ai/papers/10.1109/tit.2005.860412
- The paper
- Yuan, J., & Ding, C. (2006). Secret sharing schemes from three classes of linear codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2005.860412
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.