On the public citation graph

A Multisecret-Sharing Scheme Based on LCD Codes

0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11596981_61openalex-snapshot
A New (t, n)-Threshold Multi-secret Sharing Scheme
inferredcites →https://doi.org/10.1007/978-3-319-17296-5_9openalex-snapshot
Complementary Dual Codes for Counter-Measures to Side-Channel Attacks
inferredcites →https://doi.org/10.1007/978-3-642-20901-7_2openalex-snapshot
Secret-Sharing Schemes: A Survey
inferredcites →https://doi.org/10.1016/0012-365x(92)90563-uopenalex-snapshot
Linear codes with complementary duals
inferredcites →https://doi.org/10.1016/0012-365x(94)90283-6openalex-snapshot
The condition for a cyclic code to have a complementary dual
inferredcites →https://doi.org/10.1016/j.amc.2004.06.120openalex-snapshot
A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing
inferredcites →https://doi.org/10.1016/j.disc.2004.05.005openalex-snapshot
Linear codes with complementary duals meet the Gilbert–Varshamov bound
inferredcites →https://doi.org/10.1016/j.ffa.2009.01.002openalex-snapshot
On complementary-dual quasi-cyclic codes
inferredcites →https://doi.org/10.1016/j.ffa.2016.07.005openalex-snapshot
Quasi-cyclic complementary dual codes
inferredcites →https://doi.org/10.1016/s0019-9958(64)90438-3openalex-snapshot
Reversible codes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00149-5openalex-snapshot
Robust vector space secret sharing schemes
inferredcites →https://doi.org/10.1016/s0096-3003(03)00355-2openalex-snapshot
A (t,n) multi-secret sharing scheme
inferredcites →https://doi.org/10.1049/el:19941076openalex-snapshot
Multistage secret sharing based on one-way function
inferredcites →https://doi.org/10.1049/el:19950201openalex-snapshot
Multistage secret sharing based on one-wayfunction
inferredcites →https://doi.org/10.1080/00207160.2015.1091071openalex-snapshot
Multisecret-sharing schemes and bounded distance decoding of linear codes
inferredcites →https://doi.org/10.1109/dasc.2006.11openalex-snapshot
A Reliable (k, n) Image Secret Sharing Scheme
inferredcites →https://doi.org/10.1109/hst.2015.7140242openalex-snapshot
Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses
inferredcites →https://doi.org/10.1109/iccee.2008.76openalex-snapshot
A New (t, n) Multi-Secret Sharing Scheme
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1109/tit.1970.1054517openalex-snapshot
On the minimum distance of certain reversible cyclic codes (Corresp.)
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.1504/ijicot.2017.083827openalex-snapshot
The combinatorics of LCD codes: linear programming bound and orthogonal matrices
inferredcites →https://doi.org/10.3217/jucs-003-09-1023openalex-snapshot
Linear Multisecret-Sharing Schemes and Error-Correcting Codes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-981-96-4273-1_25openalex-snapshot
A Novel (2, 3) Secret Sharing Scheme Using Fundamental Theorem of Arithmetic and Strictly Binary Tree
inferred← citeshttps://doi.org/10.1007/s00200-021-00497-5openalex-snapshot
Formally self-dual LCD codes from two-class association schemes
inferred← citeshttps://doi.org/10.1007/s00200-021-00532-5openalex-snapshot
LCD codes from equitable partitions of association schemes
inferred← citeshttps://doi.org/10.1007/s00200-026-00756-3openalex-snapshot
Infinite families of LCD codes and their weight distributions
inferred← citeshttps://doi.org/10.1007/s10623-023-01251-3openalex-snapshot
LCD subspace codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01420-yopenalex-snapshot
LCD codes and almost optimally extendable codes from self-orthogonal codes
inferred← citeshttps://doi.org/10.1007/s12190-023-01941-0openalex-snapshot
DNA multi-secret sharing schemes based on linear codes over $${\mathbb {Z}}_{4} \times R$$
inferred← citeshttps://doi.org/10.1007/s12190-024-02002-wopenalex-snapshot
On quantum and LCD codes from the cyclic codes over the ring $$\mathbb {F}_q[\textsf{u}, \textsf{v},\textsf{w}]/\langle \textsf{u}^3-\textsf{u},\textsf{v}^2-\textsf{v}, \textsf{w}^2-\textsf{w}, \textsf{u}\textsf{v}, \textsf{v}\textsf{u}, \textsf{u}\textsf{w}, \textsf{w}\textsf{u},…
inferred← citeshttps://doi.org/10.1007/s12190-025-02493-1openalex-snapshot
Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices
inferred← citeshttps://doi.org/10.1007/s40314-024-02789-1openalex-snapshot
Hermitian hull of constacyclic codes over a class of non-chain rings and new quantum codes
inferred← citeshttps://doi.org/10.1007/s40314-025-03082-5openalex-snapshot
Application of multi-secret sharing schemes using LCD codes over $$\mathfrak {R}=\mathcal {R}\left[ w\right] $$
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115379openalex-snapshot
Multisecret-sharing scheme using LCD subspace codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102441openalex-snapshot
Binary and ternary leading-systematic LCD codes from special functions
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102591openalex-snapshot
On the construction of nonbinary LCD quadratic residue and double quadratic residue codes
inferred← citeshttps://doi.org/10.1016/j.jksuci.2023.101784openalex-snapshot
Defensive strategies against PCC attacks based on ideal (t,n)-secret sharing scheme
inferred← citeshttps://doi.org/10.1080/00207160.2025.2493959openalex-snapshot
A verifiable multi-secret sharing scheme based on LCD quadratic residue codes
inferred← citeshttps://doi.org/10.1109/icecet63943.2025.11472339openalex-snapshot
Complementary Dual And Quantum Codes From Skew Constacyclic Codes
inferred← citeshttps://doi.org/10.1109/mesiicon55227.2022.10093356openalex-snapshot
Secret Sharing Scheme: Based on LCD Code
inferred← citeshttps://doi.org/10.1109/tit.2023.3332332openalex-snapshot
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes
inferred← citeshttps://doi.org/10.1140/epjp/s13360-023-04253-1openalex-snapshot
Complementary dual skew polycyclic codes and their applications to EAQECCs
inferred← citeshttps://doi.org/10.1142/s179383092250104xopenalex-snapshot
LCD matrix product codes with an application
inferred← citeshttps://doi.org/10.12677/aam.2024.1312497openalex-snapshot
Verifiable Multi-Secret Sharing Scheme Based on LCD Code
inferred← citeshttps://doi.org/10.13069/jacodesmath.v10i3.232openalex-snapshot
A new construction of quadratic double circulant LCD codes
inferred← citeshttps://doi.org/10.2298/fil2511609aopenalex-snapshot
Exploring simplex codes and their applications over Z3Z6
inferred← citeshttps://doi.org/10.23919/cje.2024.00.278openalex-snapshot
Self-Orthogonal Codes from Plateaued Functions
inferred← citeshttps://doi.org/10.28991/esj-2020-01229openalex-snapshot
A Study on Multisecret-Sharing Schemes Based on Linear Codes
inferred← citeshttps://doi.org/10.31590/ejosat.999112openalex-snapshot
A New Public-Key Cryptosystem Based on LCD Codes
inferred← citeshttps://doi.org/10.3390/e28040369openalex-snapshot
Accelerated Multisecret Sharing Scheme Using Fast Matrix Spectral Factorization
inferred← citeshttps://doi.org/10.3390/math8050654openalex-snapshot
Some Multisecret-Sharing Schemes over Finite Fields
inferred← citeshttps://doi.org/10.3390/math8101644openalex-snapshot
Secret Sharing, Zero Sum Sets, and Hamming Codes
inferred← citeshttps://doi.org/10.3934/amc.2023053openalex-snapshot
Some constructions of $l$-Galois LCD codes
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.