Completely decomposable rank-metric codes
The author investigates completely decomposable rank-metric codes, i.e.~rank-metric codes which are the direct sum of 1-dimensional MRD codes. This problem is also related to the representability of direct sums of \(q\)-matroids. The contribution of this paper are the following results: Completely decomposable codes are not minimal rank-metrix codes but for which one can detect the set of minimal codewords (Proposition 3.8). Further, the author studies the weight distribution of a completely decomposable rank-metric code and relates it to some shortened and punctured codes (Lemma 4.5 and Theorem 4.6). Finally, the author gives a classification for codes with the maximum number of minimum weight codewords within the class of completely decomposable codes (Theorem 4.10 and Theorem 4.14).
- A generalization of an addition theorem of Kneser.
- A geometric approach to rank metric codes and a classification of constant weight codes
- A Rank-Metric Approach to Error Control in Random Network Coding
- An analogue of Vosper's theorem for extension fields
- Bilinear forms over a finite field, with applications to coding theory
- Bounded-degree low-rank parity-check codes
- Classifications and constructions of minimum size linear sets on the projective line
- Clubs and their applications
- Codes in the sum-rank metric: fundamentals and applications
- Covering radius of matrix codes endowed with the rank metric
- CRITICAL PAIRS IN ABELIAN GROUPS AND KEMPERMAN'S STRUCTURE THEOREM
- Divisible linear rank metric codes
- Equality of geometric Goppa codes and equivalence of divisors
- Evasive subspaces, generalized rank weights and near MRD codes
- Generalising the scattered property of subspaces
- Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties
- Geometric dual and sum-rank minimal codes
- Linear cutting blocking sets and minimal codes in the rank metric
- Linear sets in finite projective spaces
- Linear sets on the projective line with complementary weights
- Maximum weight codewords of a linear rank-metric code
- Maximum-rank array codes and their application to crisscross error correction
- MRD codes: constructions and connections
- Multi-orbit cyclic subspace codes and linear sets
- On the minimum size of linear sets
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Rank-metric codes and their applications
- Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
- Representability of the direct sum of q-matroids
- Revisiting Kneser's theorem for field extensions
- Scattered subspaces and related codes
- Short rank-metric codes and scattered subspaces
- Suboptimum decoding of decomposable block codes
- Summenmengen in lokalkompakten abelschen Gruppen
- The Critical Pairs of Subsets of a Group of Prime Order
- The direct sum of q-matroids
- The error-correcting pair for direct sum codes
- Theory of codes with maximum rank distance
- Universal Secure Network Coding via Rank-Metric Codes
This page was built for publication: Completely decomposable rank-metric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932125)
