Hamming and simplex codes for the sum-rank metric

DOI10.1007/s10623-020-00772-5zbMath1476.94040arXiv1908.03239OpenAlexW3036732123MaRDI QIDQ782849

Umberto Martínez-Peñas

Publication date: 29 July 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.03239

zbMATH Keywords

locally repairable codesHamming codesHamming metricsimplex codesmultishot network codingrank metricsum-rank metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Decoding (94B35)

Related Items (7)

Sum-rank product codes and bounds on the minimum distance ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ Some matroids related to sum-rank metric codes ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

Cites Work

• MacWilliams extension theorems and the local-global property for codes over Frobenius rings
• Theory of codes with maximum rank distance
• Partial spreads in finite projective spaces and partial designs
• On t-covers in finite projective spaces
• Bilinear forms over a finite field, with applications to coding theory
• 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
• Partial spreads in random network coding
• On the Locality of Codeword Symbols
• Isometries for rank distance and permutation group of gabidulin codes
• A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
• Coding for Errors and Erasures in Random Network Coding
• Constructions for perfect mixed codes and other covering codes
• Fundamentals of Error-Correcting Codes
• Error Detecting and Error Correcting Codes
• Perfect byte-correcting codes
• Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
• Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
• Linear and nonlinear single-error-correcting perfect mixed codes
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems

This page was built for publication: Hamming and simplex codes for the sum-rank metric