Puncturing maximum rank distance codes
From MaRDI portal
Publication:2313418
DOI10.1007/s10801-018-0833-3zbMath1475.94216arXiv1807.04108OpenAlexW2963700690WikidataQ129387976 ScholiaQ129387976MaRDI QIDQ2313418
Bence Csajbók, Alessandro Siciliano
Publication date: 19 July 2019
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04108
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (6)
Pseudo-ovals of elliptic quadrics as Delsarte designs of association schemes ⋮ Scalar \(q\)-subresultants and Dickson matrices ⋮ Scattered subspaces and related codes ⋮ Orbit codes from forms on vector spaces over a finite field ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-linear maximum rank distance codes
- Rank-metric codes and their duality theory
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Automorphism groups of Gabidulin-like codes
- MRD-codes and linear sets
- Generalized twisted Gabidulin codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- The cyclic model for \(PG(n,q)\) and a construction of arcs
- External flats to varieties in \(\mathbb{P}\mathbb{G}(M_{n,n}(GF(q)))\)
- Maximum scattered linear sets and MRD-codes
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- Isometry and automorphisms of constant dimension codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Linearized polynomials over finite fields revisited
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Additive Rank Metric Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Universal Secure Network Coding via Rank-Metric Codes
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Endliche Gruppen I
This page was built for publication: Puncturing maximum rank distance codes
