On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)
From MaRDI portal
Publication:6130600
DOI10.1007/s10623-022-01179-0arXiv2108.13082OpenAlexW4318425238MaRDI QIDQ6130600
Marco Timpanella, Giovanni Zini
Publication date: 3 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.13082
Polynomials over finite fields (11T06) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new family of linear maximum rank distance codes
- Automorphism groups of Gabidulin-like codes
- MRD codes with maximum idealizers
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- On dually almost MRD codes
- A new family of MRD-codes
- Scattered subspaces and related codes
- A class of linear sets in \(\mathrm{PG} (1,q^5)\)
- Extending two families of maximum rank distance codes
- On the number of roots of some linearized polynomials
- On certain linearized polynomials with high degree and kernel of small dimension
- On a conjecture about maximum scattered subspaces of \(\mathbb{F}_{q^6}\times\mathbb{F}_{q^6}\)
- On kernels and nuclei of rank metric codes
- Improved explicit estimates on the number of solutions of equations over a finite field
- Connections between scattered linear sets and MRD-codes
- Algebraic Function Fields and Codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: On a family of linear MRD codes with parameters \([8\times 8,16,7]_q\)