The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
Open accessAbstract
In this paper, a class of two-weight and three-weight linear codes over GF(p) is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems.
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
Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
Carlet, C., Ding, C., & Yuan, J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847722 · Cited by 408
Self-citationMinimal vectors in linear codes
Ashikhmin, A., & Barg, A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705584 · Cited by 348
Secret sharing schemes from three classes of linear codes
Yuan, J., & Ding, C. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860412 · Cited by 310
Self-citationA family of skew Hadamard difference sets
Ding, C., & Yuan, J. Y. (2005) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2005.10.006 · Cited by 287
Self-citationMinimal Codewords and Secret Sharing
Massey, J. L. (1999) · Cited by 249
Carlet, C., & Ding, C. (2004) · Journal of Complexity · doi:10.1016/j.jco.2003.08.008 · Cited by 227
Self-citationCovering 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-citationHow to Build Robust Shared Control Systems
Anderson, R., Ding, C., Helleseth, T., & Kløve, T. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1026421315292 · Cited by 110
Self-citation
Metadata
- Authors
- Ding, K., & Ding, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2015-11
- Volume
- 61
- Issue
- 11
- Pages
- 5835-5842
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2962947453
- Cited by
- 315
- References
- 11
- FWCI
- 27.21
- Type
- journal article
- Language
- en
- Open access
- green
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: A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing. https://app.cochat.ai/papers/10.1109/tit.2015.2473861
- The paper
- Ding, K., & Ding, C. (2015). A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2015.2473861
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.