Encoding and decoding of several optimal rank metric codes
From MaRDI portal
Publication:2096654
DOI10.1007/s12095-022-00578-3OpenAlexW4226364725WikidataQ114849126 ScholiaQ114849126MaRDI QIDQ2096654
Ferdinando Zullo, Wrya K. Kadir, Chunlei Li
Publication date: 11 November 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.03009
Hermitian matricessymmetric matricesBerlekamp-Massey algorithmalternating matriceslinearized polynomialsrank metric codesinterpolation-based decoding
Cites Work
- Unnamed Item
- Unnamed Item
- A new family of linear maximum rank distance codes
- Symmetric bilinear forms over finite fields with applications to coding theory
- Generalized twisted Gabidulin codes
- Theory of codes with maximum rank distance
- Alternating bilinear forms over GF(q)
- Bilinear forms over a finite field, with applications to coding theory
- Fast operations on linearized polynomials and their applications in coding theory
- Hermitian rank distance codes
- Some new non-additive maximum rank distance codes
- Symmetric bilinear forms over finite fields of even characteristic
- On decoding additive generalized twisted Gabidulin codes
- On maximum additive Hermitian rank-metric codes
- On equivalence of maximum additive symmetric rank-distance codes
- Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
- Additive Rank Metric Codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
- Linearized Shift-Register Synthesis
- Maximum-rank array codes and their application to crisscross error correction
- Coding and Cryptography
This page was built for publication: Encoding and decoding of several optimal rank metric codes
