Rank error-correcting pairs
From MaRDI portal
Publication:2364642
DOI10.1007/s10623-016-0284-6zbMath1417.94120arXiv1512.08144OpenAlexW2275724313MaRDI QIDQ2364642
Umberto Martínez-Peñas, Pellikaan, Ruud
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
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Bounds on codes (94B65) Decoding (94B35)
Related Items
Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric
Cites Work
- Unnamed Item
- Rank-metric codes and their duality theory
- On defining generalized rank weights
- On the roots and minimum rank distance of skew cyclic codes
- A symmetric Roos bound for linear codes
- Skew codes of prescribed distance or rank
- Skew-cyclic codes
- Theory of codes with maximum rank distance
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
- On decoding by error location and dependent sets of error positions
- Bilinear forms over a finite field, with applications to coding theory
- On the existence of error-correcting pairs
- On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
- Isometries for rank distance and permutation group of gabidulin codes
- A new lower bound for the minimum distance of a cyclic code
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Error-locating pairs for cyclic codes
- On Metrics for Error Correction in Network Coding
- Generalizations of the BCH bound
- Coding and Cryptography
This page was built for publication: Rank error-correcting pairs
