Conference
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix
Abstract
Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric, and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions on the existence of MSRD codes with support-constrained generator matrix. These conditions are identical to those for MDS codes and MRD codes. Moreover, the required field …
Authors
Liu H; Wei H; Wachter-Zeh A; Schwartz M
Volume
00
Pagination
pp. 7-12
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
April 28, 2023
DOI
10.1109/itw55543.2023.10161635
Name of conference
2023 IEEE Information Theory Workshop (ITW)