Probabilistic algorithm for finding roots of linearized polynomials
From MaRDI portal
Publication:1008961
DOI10.1007/s10623-007-9125-yzbMath1196.11164OpenAlexW2045480749MaRDI QIDQ1008961
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9125-y
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Fast decoding of Gabidulin codes ⋮ Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes ⋮ On decoding additive generalized twisted Gabidulin codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Algorithms for exponentiation in finite fields
- Probabilistic Algorithms in Finite Fields
- Studying the locator polynomials of minimum weight codewords of BCH codes
- Probabilistic crisscross error correction
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: Probabilistic algorithm for finding roots of linearized polynomials
