Rank error-correcting pairs

DOI10.1007/S10623-016-0284-6MaRDI QIDQ2364642zbMATH OpenOpenAlexFDO

Authors Umberto Martínez-Peñas, Ruud Pellikaan

Publication date 21 July 2017

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

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

zbMATH Keywords

decodingerror-correcting pairslinearized polynomialsrank metricvector products

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Decoding (94B35) Bounds on codes (94B65)

Abstract: Error-correcting pairs were introduced independently by Pellikaan and K"otter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known families of codes. In this paper, we define new types of vector products, extending the coordinatewise product, some of which preserve symbolic products of linearized polynomials after evaluation and some of which coincide with usual products of matrices. Then we define rank error-correcting pairs for codes that are linear over the extension field and for codes that are linear over the base field, and relate both types. Bounds on the minimum rank distance of codes and MRD conditions are given. Finally we show that some well-known families of rank-metric codes admit rank error-correcting pairs, and show that the given algorithm generalizes the classical algorithm using error-correcting pairs for the Hamming metric.

Recommendations

• Error and erasure correcting algorithms for rank codes
• Coding and Cryptography
• On the existence of error-correcting pairs
• Systematic Error-Correcting Codes for Rank Modulation
• Codes in Permutations and Error Correction for Rank Modulation
• scientific article; zbMATH DE number 741106
• Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric Codes
• Codes Correcting Erasures and Deletions for Rank Modulation
• Rank-metric codes
• Ranks of propelinear perfect binary codes

Cites work

• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• A new lower bound for the minimum distance of a cyclic code
• A symmetric Roos bound for linear codes
• Bilinear forms over a finite field, with applications to coding theory
• Coding and Cryptography
• Error-locating pairs for cyclic codes
• Generalizations of the BCH bound
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• Isometries for rank distance and permutation group of gabidulin codes
• On decoding by error location and dependent sets of error positions
• On defining generalized rank weights
• On Metrics for Error Correction in Network Coding
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• On the existence of error-correcting pairs
• On the roots and minimum rank distance of skew cyclic codes
• On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
• Rank-metric codes and their duality theory
• Skew codes of prescribed distance or rank
• Skew-cyclic codes
• Theory of codes with maximum rank distance

Cited in

(9)

• Error and erasure correcting algorithms for rank codes
• On the existence of error-correcting pairs
• Encoding and decoding of several optimal rank metric codes
• Theory of supports for linear codes endowed with the sum-rank metric
• A characterization of MDS codes that have an error correcting pair
• Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
• Coding and Cryptography
• Private information retrieval from locally repairable databases with colluding servers
• The error-correcting pair for direct sum codes

This page was built for publication: Rank error-correcting pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364642)