On the public citation graph
A Welch–Berlekamp Like Algorithm for Decoding Gabidulin Codes
0 signed · 102 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.1007/bfb0034349openalex-snapshot
A fast matrix decoding algorithm for rank-error-correcting codes
inferredcites →https://doi.org/10.1007/bfb0034862openalex-snapshot
The cryptographic security of the syndrome decoding problem for rank distance codes
inferredcites →https://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
inferredcites →https://doi.org/10.1023/a:1020369320078openalex-snapshot
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
inferredcites →https://doi.org/10.1090/s0002-9947-1933-1501703-0openalex-snapshot
On a Special Class of Polynomials
inferredcites →https://doi.org/10.1090/s0002-9947-1934-1501740-7openalex-snapshot
Contributions to the Theory of Finite Fields
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.75248openalex-snapshot
Maximum-rank array codes and their application to crisscross error correction
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/9781118562819.ch6openalex-snapshot
Random Network Coding and Matroids
inferred← citeshttps://doi.org/10.1007/978-3-030-21548-4_10openalex-snapshot
Two New Module-Code-Based KEMs with Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-030-23696-0_5openalex-snapshot
An IND-CCA-Secure Code-Based Encryption Scheme Using Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-030-25510-7_20openalex-snapshot
Preventing Timing Attacks Against RQC Using Constant Time Decoding of Gabidulin Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_1openalex-snapshot
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-030-98365-9_2openalex-snapshot
The Rank-Based Cryptography Library
inferred← citeshttps://doi.org/10.1007/978-3-031-22301-3_10openalex-snapshot
Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018
inferred← citeshttps://doi.org/10.1007/978-3-031-26553-2_6openalex-snapshot
McEliece-Type Encryption Based on Gabidulin Codes with No Hidden Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-40003-2_1openalex-snapshot
An Extension of Overbeck’s Attack with an Application to Cryptanalysis of Twisted Gabidulin-Based Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-59265-7_7openalex-snapshot
Fuzzy Authentication Using Rank Distance
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/978-981-99-8739-9_10openalex-snapshot
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems with Smaller Sizes
inferred← citeshttps://doi.org/10.1007/s00200-019-00406-xopenalex-snapshot
A modified Dual-Ouroboros public-key encryption using Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s00200-020-00419-xopenalex-snapshot
On the security of the modified Dual-ouroboros PKE using Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s00200-022-00577-0openalex-snapshot
Two modifications for Loidreau’s code-based cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-007-9125-yopenalex-snapshot
Probabilistic algorithm for finding roots of linearized polynomials
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.1007/s10623-014-9953-5openalex-snapshot
List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
inferred← citeshttps://doi.org/10.1007/s10623-017-0425-6openalex-snapshot
Generalized Gabidulin codes over fields of any characteristic
inferred← citeshttps://doi.org/10.1007/s10623-020-00781-4openalex-snapshot
On the security of a Loidreau rank metric code based encryption scheme
inferred← citeshttps://doi.org/10.1007/s10623-021-00972-7openalex-snapshot
Extending Coggia–Couvreur attack on Loidreau’s rank-metric cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-022-01022-6openalex-snapshot
On the list decodability of rank-metric codes containing Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s11277-007-9389-6openalex-snapshot
Coding Schemes for Crisscross Error Patterns
inferred← citeshttps://doi.org/10.1007/s12095-020-00449-9openalex-snapshot
On decoding additive generalized twisted Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s12095-022-00578-3openalex-snapshot
Encoding and decoding of several optimal rank metric codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101946openalex-snapshot
Cardinal rank metric codes over Galois rings
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/acct51235.2020.9383242openalex-snapshot
On Software Implementation of Gabidulin Decoders
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635644openalex-snapshot
Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558679openalex-snapshot
Complexity of decoding Gabidulin codes
inferred← citeshttps://doi.org/10.1109/cwit.2009.5069509openalex-snapshot
Projective space codes for the injection metric
inferred← citeshttps://doi.org/10.1109/cwit.2015.7255141openalex-snapshot
Construction and decoding of generalized skew-evaluation codes
inferred← citeshttps://doi.org/10.1109/icassp.2018.8462647openalex-snapshot
Watermarking and Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541759openalex-snapshot
An alternative decoding method for Gabidulin codes in characteristic zero
inferred← citeshttps://doi.org/10.1109/isit.2016.7541761openalex-snapshot
A quadratic Welch-Berlekamp algorithm to decode generalized Gabidulin codes, and some variants
inferred← citeshttps://doi.org/10.1109/isit.2017.8007034openalex-snapshot
A decoding algorithm for twisted Gabidulin codes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437698openalex-snapshot
On the List-Decodability of Random Linear Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849472openalex-snapshot
Interpolation-based Decoding of Nonlinear Maximum Rank Distance Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517869openalex-snapshot
On the decoding of the sum of Gabidulin 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.9517980openalex-snapshot
On interpolation-based decoding of a class of maximum rank distance codes
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206683openalex-snapshot
Two new algorithms for error support recovery of low rank parity check codes
inferred← citeshttps://doi.org/10.1109/isnetcod.2011.5978942openalex-snapshot
General Linearized Polynomial Interpolation and Its Applications
inferred← citeshttps://doi.org/10.1109/isnetcod.2011.5979081openalex-snapshot
GMD-Based Erasure-and-Error Decoding of Lifted MRD Code for Network Error Correction
inferred← citeshttps://doi.org/10.1109/its.2014.6947968openalex-snapshot
An evaluation of erasure decoding algorithms for Gabidulin codes
inferred← citeshttps://doi.org/10.1109/itw.2009.5351428openalex-snapshot
On the decoder error probability of bounded rank distance decoders for rank metric codes
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/itw55543.2023.10161649openalex-snapshot
Improved decoding of symmetric rank metric errors
inferred← citeshttps://doi.org/10.1109/red.2012.6338413openalex-snapshot
On fast decoding of interleaved Gabidulin codes
inferred← citeshttps://doi.org/10.1109/redundancy52534.2021.9606451openalex-snapshot
New Communication Models and Decoding of Maximum Rank Distance Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2910578openalex-snapshot
Reconciling Similar Sets of Data
inferred← citeshttps://doi.org/10.1109/tit.2008.924697openalex-snapshot
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928284openalex-snapshot
Packing and Covering Properties of Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928291openalex-snapshot
A Rank-Metric Approach to Error Control in Random Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2010.2096032openalex-snapshot
Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
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.2014.2371915openalex-snapshot
On List-Decodability of Random Rank Metric Codes and Subspace Codes
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/tit.2019.2912165openalex-snapshot
Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2933520openalex-snapshot
Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
inferred← citeshttps://doi.org/10.1109/tit.2020.2966974openalex-snapshot
On the List Decodability of Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3067318openalex-snapshot
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
inferred← citeshttps://doi.org/10.1109/tit.2023.3236720openalex-snapshot
The Partial-Inverse Approach to Linearized Polynomials and Gabidulin Codes With Applications to Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2024.3366751openalex-snapshot
Algebraic Geometry Codes in the Sum–Rank Metric
inferred← citeshttps://doi.org/10.1109/tit.2025.3555075openalex-snapshot
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes
inferred← citeshttps://doi.org/10.1109/tsp.2012.2222400openalex-snapshot
Linearized Polynomial Interpolation and Its Applications
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.1137/16m1091769openalex-snapshot
Covering Radius of Matrix Codes Endowed with the Rank Metric
inferred← citeshttps://doi.org/10.1145/2090236.2090252openalex-snapshot
List decoding subspace codes from insertions and deletions
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.1155/2008/754021openalex-snapshot
MacWilliams Identity for Codes with the Rank Metric
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.21203/rs.3.rs-1250619/v1openalex-snapshot
Semilinear Transformations in Coding Theory: A New Technique in Code-Based Cryptography
inferred← citeshttps://doi.org/10.21203/rs.3.rs-860071/v1openalex-snapshot
Two Public-Key Cryptosystems Based on Expanded Gabidulin Codes
inferred← citeshttps://doi.org/10.3934/amc.2012.6.443openalex-snapshot
An algebraic approach for decoding spread codes
inferred← citeshttps://doi.org/10.48550/arxiv.0812.2379openalex-snapshot
On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2881openalex-snapshot
Rank Distance Bicodes and their Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.1202.0535openalex-snapshot
List decoding subspace codes from insertions and deletions
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4047openalex-snapshot
Rank metric and Gabidulin codes in characteristic zero
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2693openalex-snapshot
On List-decodability of Random Rank Metric Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1703.09125openalex-snapshot
Generalized Gabidulin codes over fields of any characteristic
inferred← citeshttps://doi.org/10.48550/arxiv.1911.13119openalex-snapshot
RAMESSES, a Rank Metric Encryption Scheme with Short Keys
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702077openalex-snapshot
Properties of Rank Metric Codes
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/67238cdfz59acz45c7zb136zc4ae1bf77739openalex-snapshot
Techniques of cryptanalysis for symmetric-key primitives
inferred← citeshttps://doi.org/10.70675/71022c8fzb2f6z486dzb4faz5bfc36f274ceopenalex-snapshot
Cryptographie à base de codes correcteurs d’erreurs en métrique rang et application
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.