Non-linear maximum rank distance codes
DOI10.1007/s10623-015-0108-0zbMath1386.94112OpenAlexW2175076659MaRDI QIDQ281322
Francesco Pavese, Giuseppe Marino, Antonio Cossidente
Publication date: 10 May 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0108-0
Singer cyclic groupSegre varietysubspace codesconstant rank distance codemaximum rank distance codeVeronese variety
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60) Combinatorial structures in finite projective spaces (51E20) Projective techniques in algebraic geometry (14N05)
Related Items (24)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exterior splashes and linear sets of rank 3
- Scattered linear sets generated by collineations between pencils of lines
- Rank properties of subspaces of symmetric and Hermitian matrices over finite fields
- On the automorphism group of planes of Figueroa type
- Theory of codes with maximum rank distance
- On the flocks of \(Q^+(3,q)\)
- A fimily of not \((V,\ell)\)-transitive projective planes of order \(q^3\), \(q \not\equiv 1 (\mod 3)\) and \(q>2\)
- Flocks of hyperbolic quadrics and linear groups containing homologies
- Bilinear forms over a finite field, with applications to coding theory
- External flats to varieties in \(\mathbb{P}\mathbb{G}(M_{n,n}(GF(q)))\)
- (\(B\))-geometries and flocks of hyperbolic quadrics
- Mixed partitions of PG\((5,q)\)
- Maximum scattered linear sets of pseudoregulus type and the Segre variety \(\mathcal{S}_{n,n}\)
- Subgeometries and linear sets on a projective line
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- Generalizing flocks of Q+(3,q)
- Field reduction and linear sets in finite geometry
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Bounds on List Decoding of Rank-Metric Codes
- Endliche Gruppen I
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Non-linear maximum rank distance codes