On the public citation graph
A fast matrix decoding algorithm for rank-error-correcting codes
0 signed · 55 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-46416-6_41openalex-snapshot
Ideals over a Non-Commutative Ring and their Application in Cryptology
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1109/tcom.1973.1091734openalex-snapshot
Error-Correcting Codes, Second Edition
inferredcites →https://doi.org/10.1134/11122.1608-3253openalex-snapshot
Problems of Information Transmission
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.228openalex-snapshot
Security of the GPT cryptosystem and its applications to cryptography
inferred← citeshttps://doi.org/10.1007/11779360_2openalex-snapshot
On Codes Correcting Symmetric Rank Errors
inferred← citeshttps://doi.org/10.1007/11779360_24openalex-snapshot
A New Public-Key Cryptosystem Based on the Problem of Reconstructing p–Polynomials
inferred← citeshttps://doi.org/10.1007/11779360_4openalex-snapshot
A Welch–Berlekamp Like Algorithm for Decoding Gabidulin Codes
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_19openalex-snapshot
The Security of the Gabidulin Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_18openalex-snapshot
Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-12929-2_11openalex-snapshot
Designing a Rank Metric Based McEliece Cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-007-9160-8openalex-snapshot
Attacks and counter-attacks on the GPT public key cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-008-9185-7openalex-snapshot
Error and erasure correcting algorithms for rank codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9659-5openalex-snapshot
Fast decoding of Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9704-4openalex-snapshot
Linear codes using skew polynomials with automorphisms and derivations
inferred← citeshttps://doi.org/10.1016/j.crma.2004.10.004openalex-snapshot
Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.012openalex-snapshot
Symmetric matrices and codes correcting rank errors beyond the ⌊(d-1)/2⌋ bound
inferred← citeshttps://doi.org/10.1016/j.image.2018.12.015openalex-snapshot
Application of rank metric codes in digital image watermarking
inferred← citeshttps://doi.org/10.1109/ent-mipt.2018.00016openalex-snapshot
Multicomponent Subspace Codes in Network Coding
inferred← citeshttps://doi.org/10.1109/icassp.2018.8462647openalex-snapshot
Watermarking and Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/icent.2017.12openalex-snapshot
New Rank Codes with Efficient Decoding
inferred← citeshttps://doi.org/10.1109/isit.2005.1523305openalex-snapshot
On subcodes of codes in rank metric
inferred← citeshttps://doi.org/10.1109/isit.2009.5205280openalex-snapshot
One family of algebraic codes for network coding
inferred← citeshttps://doi.org/10.1109/isit.2009.5206029openalex-snapshot
On improving security of GPT cryptosystems
inferred← citeshttps://doi.org/10.1109/isit.2010.5513549openalex-snapshot
A Smart approach for GPT cryptosystem based on rank codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517904openalex-snapshot
Efficient Decoding of Gabidulin Codes over Galois Rings
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518115openalex-snapshot
Decoding of Space-Symmetric Rank Errors
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834742openalex-snapshot
Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric
inferred← citeshttps://doi.org/10.1109/itw.2014.6970898openalex-snapshot
Iterative list-decoding of Gabidulin codes via Gröbner based interpolation
inferred← citeshttps://doi.org/10.1109/tit.2013.2274653openalex-snapshot
Bounds on List Decoding of Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2544347openalex-snapshot
Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
inferred← citeshttps://doi.org/10.1109/tit.2017.2780848openalex-snapshot
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
inferred← citeshttps://doi.org/10.1109/tit.2018.2865750openalex-snapshot
Communication Cost for Updating Linear Functions When Message Updates are Sparse: Connections to Maximally Recoverable Codes
inferred← citeshttps://doi.org/10.1109/tvlsi.2010.2096239openalex-snapshot
Rank Metric Decoder Architectures for Random Linear Network Coding With Error Control
inferred← citeshttps://doi.org/10.1134/s0032946010040034openalex-snapshot
Decoding of random network codes
inferred← citeshttps://doi.org/10.1134/s0032946013010043openalex-snapshot
Rank subcodes in multicomponent network coding
inferred← citeshttps://doi.org/10.1134/s0032946013020075openalex-snapshot
Information security in a random network coding network
inferred← citeshttps://doi.org/10.1145/2488608.2488715openalex-snapshot
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
inferred← citeshttps://doi.org/10.1184/r1/6605417openalex-snapshot
Explicit rank-metric codes list-decodable with optimal redundancy
inferred← citeshttps://doi.org/10.13069/jacodesmath.369863openalex-snapshot
A module minimization approach to Gabidulin decoding via interpolation
inferred← citeshttps://doi.org/10.1561/0100000119openalex-snapshot
Rank-Metric Codes and Their Applications
inferred← citeshttps://doi.org/10.1561/9781638280019openalex-snapshot
Rank-Metric Codes and Their Applications
inferred← citeshttps://doi.org/10.20533/ijisr.2042.4639.2014.0050openalex-snapshot
Modified GPT Cryptosystem for Information Network Security
inferred← citeshttps://doi.org/10.21236/ada329310openalex-snapshot
Error Detection and Correction for Optical Memories
inferred← citeshttps://doi.org/10.24297/ijct.v11i4.3130openalex-snapshot
Enhancing the Security of the GPT Cryptosystem Against Attacks
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.748openalex-snapshot
Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5716openalex-snapshot
List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7152openalex-snapshot
Iterative List-Decoding of Gabidulin Codes via Gröbner Based Interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2303openalex-snapshot
Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules
inferred← citeshttps://doi.org/10.48550/arxiv.1911.13119openalex-snapshot
RAMESSES, a Rank Metric Encryption Scheme with Short Keys
inferred← citeshttps://doi.org/10.70675/30724882zd0c3z4f9dza503ze158a92b5f94openalex-snapshot
Protection des contenus multimédias pour la certification des données
inferred← citeshttps://doi.org/10.70675/baee59e6zc790z4090za837zfa09b5da4e61openalex-snapshot
Decoding of block and convolutional codes in rank metric
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.