On the public citation graph
On the Concatenated Structure of a Linear Code
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45961-8_25openalex-snapshot
An Observation on the Security of McEliece’s Public-Key Cryptosystem
inferredcites →https://doi.org/10.1007/bfb0019850openalex-snapshot
A method for finding codewords of small weight
inferredcites →https://doi.org/10.1016/0012-365x(85)90190-6openalex-snapshot
Linear intersecting codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1027351723034openalex-snapshot
McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1109/18.21270openalex-snapshot
A probabilistic algorithm for computing minimum weights of large error-correcting codes
inferredcites →https://doi.org/10.1109/18.651067openalex-snapshot
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
inferredcites →https://doi.org/10.1109/isit.1997.613303openalex-snapshot
Finding the permutation between equivalent binary codes
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1982.1056498openalex-snapshot
Computing automorphism groups of 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/3-540-44448-3_45openalex-snapshot
Strengthening McEliece Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_384openalex-snapshot
McEliece Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_385openalex-snapshot
Niederreiter Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-1-4757-3585-7_10openalex-snapshot
On the Security of the McEliece Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-54074-6_2openalex-snapshot
On the Decipherment of Sidel’nikov-Type Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_385openalex-snapshot
Niederreiter Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-56932-1_26openalex-snapshot
Code-Based Cryptosystems Using Generalized Concatenated Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-66787-4_1openalex-snapshot
A Side-Channel Assisted Cryptanalytic Attack Against QcBits
inferred← citeshttps://doi.org/10.1007/978-3-319-69284-5_10openalex-snapshot
Evolution of the McEliece Public Key Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-02384-2_6openalex-snapshot
Reducing Key Length of the McEliece Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-981-97-0641-9_33openalex-snapshot
Quantum-Safe Encryption Schemes Based on Hadamard Code
inferred← citeshttps://doi.org/10.1007/s11277-023-10854-xopenalex-snapshot
A Novel Hybrid Communication Policy Using Network Coding Based Post-Quantum Cryptography and Adaptive Neuro Fuzzy Inference System
inferred← citeshttps://doi.org/10.1007/s11786-009-0015-8openalex-snapshot
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1007/springerreference_375openalex-snapshot
Niederreiter Encryption Scheme
inferred← citeshttps://doi.org/10.1016/j.csa.2024.100039openalex-snapshot
Quantum vs post‐quantum security for future networks: Survey
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.035openalex-snapshot
Left dihedral codes over Galois rings GR(p2,m)
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113059openalex-snapshot
Construction and enumeration of left dihedral codes satisfying certain duality properties
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.01.001openalex-snapshot
Concatenated structure of left dihedral codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114480openalex-snapshot
A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
inferred← citeshttps://doi.org/10.1080/00207160.2015.1069819openalex-snapshot
On left quaternion codes
inferred← citeshttps://doi.org/10.1109/18.915687openalex-snapshot
Weak keys in the McEliece public-key cryptosystem
inferred← citeshttps://doi.org/10.1109/ants56424.2022.10227752openalex-snapshot
A Novel Hybrid Communication Policy using Network Coding Based Post-Quantum Cryptography and Fuzzy Inference System
inferred← citeshttps://doi.org/10.1109/icce-berlin53567.2021.9720026openalex-snapshot
Codes over Eisenstein integers for the Niederreiter cryptosystem
inferred← citeshttps://doi.org/10.1109/jsait.2021.3054598openalex-snapshot
Network Coding-Based Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1109/lcomm.2017.2779449openalex-snapshot
Cryptanalysis of a Public Key Encryption Scheme Based on QC-LDPC and QC-MDPC Codes
inferred← citeshttps://doi.org/10.1109/nss.2009.22openalex-snapshot
Weakness on Cryptographic Schemes Based on Chained Codes
inferred← citeshttps://doi.org/10.1109/ojcoms.2022.3206395openalex-snapshot
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003319openalex-snapshot
On the strength of asymmetric code cryptosystems based on the merging of generating matrices of linear codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2613115openalex-snapshot
On a Class of Left Metacyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2945981openalex-snapshot
Self-Dual Binary $[8m,\,\,4m]$ -Codes Constructed by Left Ideals of the Dihedral Group Algebra $\mathbb{F}_2[D_{8m}]$
inferred← citeshttps://doi.org/10.1109/tit.2026.3651210openalex-snapshot
Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information
inferred← citeshttps://doi.org/10.1145/3197507.3197513openalex-snapshot
A New LRPC-Kronecker Product Codes Based Public-Key Cryptography
inferred← citeshttps://doi.org/10.14529/mmp190308openalex-snapshot
The Use of the Direct Sum Decomposition Algorithm for Analyzing the Strength of Some Mceliece Type Cryptosystems
inferred← citeshttps://doi.org/10.15388/lmr.2003.32322openalex-snapshot
On the concatenated structure of quasi-cyclic codes
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.2585openalex-snapshot
A Class of Left Dihedral Codes Over Rings $\mathbb{F}_q+u\mathbb{F}_q$
inferred← citeshttps://doi.org/10.3390/cryptography5040033openalex-snapshot
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
inferred← citeshttps://doi.org/10.37394/23209.2022.19.10openalex-snapshot
Some Public-key Cryptosystems Over Finite Fields
inferred← citeshttps://doi.org/10.48550/arxiv.0804.0409openalex-snapshot
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06246openalex-snapshot
McEliece Cryptosystem Based On Extended Golay Code
inferred← citeshttps://doi.org/10.48550/arxiv.1812.05008openalex-snapshot
McNie: A code-based public-key cryptosystem
inferred← citeshttps://doi.org/10.48550/arxiv.1902.07533openalex-snapshot
Self-dual binary $[8m, 4m]$-codes constructed by left ideals of the dihedral group algebra $\mathbb{F}_2[D_{8m}]$
inferred← citeshttps://doi.org/10.70675/5e149c2az73a6z49fazbec7zc816a6bc6a1aopenalex-snapshot
Analysis of code-based post-quantum cryptosystems
inferred← citeshttps://doi.org/10.70675/768c8e60zc3e6z4c17za728zec57125eed6bopenalex-snapshot
An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory
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.