The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
Abstract
In this paper, error-correcting codes from perfect nonlinear mappings are constructed, and then employed to construct secret sharing schemes. The error-correcting codes obtained in this paper are very good in general, and many of them are optimal or almost optimal. The secret sharing schemes obtained in this paper have two types of access structures. The first type is democratic in the sense that every participant is involved in the same number of minimal-access sets. In the second type of access structures, there are a few dictators who are in every minimal access set, while each of the remaining participants is in the same number of minimal-access sets.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
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
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
Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems
Carlet, C., Charpin, P., & Zinoviev, V. A. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008344232130 · Cited by 615
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-citationOn subfield subcodes of modified Reed-Solomon codes (Corresp.)
Delsarte, P. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055435 · Cited by 277
Minimal 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-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
- Carlet, C., Ding, C., & Yuan, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-06
- Volume
- 51
- Issue
- 6
- Pages
- 2089-2102
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2123695891
- Cited by
- 408
- References
- 14
- FWCI
- 2.75
- 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: Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes. https://app.cochat.ai/papers/10.1109/tit.2005.847722
- The paper
- Carlet, C., Ding, C., & Yuan, J. (2005). Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2005.847722
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.