Doubly and triply extended MSRD codes

DOI10.1016/J.FFA.2023.102272MaRDI QIDQ6136720zbMATH OpenOpenAlexFDO

Authors Umberto Martínez-Peñas

Publication date 31 August 2023

Published in Finite Fields and their Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

doubly extended codeslinearized Reed-Solomon codesmaximum sum-rank distance codessum-rank metrictriply extended

Mathematics Subject Classification ID

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

Abstract: In this work, doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the Singleton bound. We then use this result to obtain several families of doubly extended and triply extended maximum sum-rank distance (MSRD) codes that include doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes as particular cases. To conclude, we discuss when these codes are one-weight codes.

Review text

Extended Reed-Solomon codes are formed by extending Vandermonde matrices with additional columns. Doubly and triply extended Reed Solomon codes are Maximum Distance Separable (MDS) codes, that is they meet the Singleton bound \(d \leq n - k + 1\), where \(n\) is the length, \(k\) is the dimension, and \(d\) is the minimum distance. The authors generalize doubly and triply extended Reed Solomon codes and characterize when a multiply extended code attains the Singleton bound for general metrics. He applies this result to produce families of doubly and triply extended Maximum Sum-Rank Distance (MSRD) codes. Necessary and sufficient conditions for the doubly-extended MSRD codes to be one-weight codes are also given.

Recommendations

• On MDS extensions of generalized Reed- Solomon codes
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• The geometry of one-weight codes in the sum-rank metric
• Extending two families of maximum rank distance codes
• The Extended Codes of Some Linear Codes

Cites work

• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Bilinear forms over a finite field, with applications to coding theory
• Codes in the sum-rank metric: fundamentals and applications
• Fundamental Properties of Sum-Rank-Metric Codes
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Maximum-rank array codes and their application to crisscross error correction
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Sum-rank product codes and bounds on the minimum distance
• The geometry of one-weight codes in the sum-rank metric
• Theory of codes with maximum rank distance
• Theory of supports for linear codes endowed with the sum-rank metric
• Twisted linearized Reed-Solomon codes: a skew polynomial framework

Cited in

(3)

• New constructions of MSRD codes
• Fast decoding of interleaved linearized Reed-Solomon codes and variants
• One-weight codes in the sum-rank metric

This page was built for publication: Doubly and triply extended MSRD codes

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