Hamming and simplex codes for the sum-rank metric
From MaRDI portal
Publication:782849
DOI10.1007/S10623-020-00772-5zbMATH Open1476.94040arXiv1908.03239OpenAlexW3036732123MaRDI QIDQ782849FDOQ782849
Publication date: 29 July 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes (thus of highest information rate) with minimum sum-rank distance at least (thus one-error-correcting) for a fixed redundancy , base-field size and field-extension degree (i.e., number of matrix rows). General upper bounds on their code length, number of shots or sublengths and average sublength are obtained based on such parameters. When the field-extension degree is , it is shown that sum-rank isometry classes of sum-rank Hamming codes are in bijective correspondence with maximal-size partial spreads. In that case, it is also shown that sum-rank Hamming codes are perfect codes for the sum-rank metric. Also in that case, estimates on the parameters (lengths and number of shots) of sum-rank Hamming codes are given, together with an efficient syndrome decoding algorithm. Duals of sum-rank Hamming codes, called sum-rank simplex codes, are then introduced. Bounds on the minimum sum-rank distance of sum-rank simplex codes are given based on known bounds on the size of partial spreads. As applications, sum-rank Hamming codes are proposed for error correction in multishot matrix-multiplicative channels and to construct locally repairable codes over small fields, including binary.
Full work available at URL: https://arxiv.org/abs/1908.03239
Recommendations
locally repairable codesHamming codesHamming metricsimplex codesmultishot network codingrank metricsum-rank metric
Cites Work
- Error Detecting and Error Correcting Codes
- Bilinear forms over a finite field, with applications to coding theory
- On the Locality of Codeword Symbols
- Fundamentals of Error-Correcting Codes
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- On t-covers in finite projective spaces
- Theory of codes with maximum rank distance
- Coding for Errors and Erasures in Random Network Coding
- Partial spreads in finite projective spaces and partial designs
- Partial spreads in random network coding
- Isometries for rank distance and permutation group of gabidulin codes
- Linear and nonlinear single-error-correcting perfect mixed codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Perfect byte-correcting codes
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Theory of supports for linear codes endowed with the sum-rank metric
- Asymptotic behaviour of codes in rank metric over finite fields
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Constructions for perfect mixed codes and other covering codes
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
Cited In (9)
- Sum-rank product codes and bounds on the minimum distance
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Monomial isomorphism for tensors and applications to code equivalence problems
- Some matroids related to sum-rank metric codes
- On decoding high-order interleaved sum-rank-metric codes
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- Linear cutting blocking sets and minimal codes in the rank metric
- The geometry of one-weight codes in the sum-rank metric
- Distinguishing and recovering generalized linearized Reed-Solomon codes
This page was built for publication: Hamming and simplex codes for the sum-rank metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782849)
