New Constructions of Additive MDS TRS Codes
Anuj Kumar Bhagat, Ankit Yadav, Ritumoni Sarma
Abstract
Additive codes over finite fields generalize linear codes, and additive MDS codes provide a natural extension of linear MDS codes. In this article, we study additive twisted Reed--Solomon (TRS) codes and obtain new constructions of additive MDS codes. First, for additive TRS codes with twist t=2 and an arbitrary hook, we establish necessary and sufficient conditions for the codes to be additive MDS, thereby generalizing the results in Section 3 of [Jiayu Ma et al., New families of additive non-Reed-Solomon MDS codes]. In particular, we show that the existence of an additive MDS TRS code with t=2 and hook h=0 yields codes of larger lengths than those obtained for t=2 and h=k-1 in [Jiayu Ma et al., New families of additive non-Reed-Solomon MDS codes]. Next, we consider additive TRS codes with twist vector t=(1,2) and hook vector h=(0,0), and derive necessary and sufficient conditions for them to be additive MDS. We further establish the existence of such codes. Using the Schur square technique, we obtain mild conditions under which the constructed families are inequivalent to additive Reed--Solomon (RS) codes. Finally, we determine parity-check matrices for both families of additive MDS codes considered in this article.
Create a lesson
Related papers
Auxiliary Codes and the Generalized Packing-Covering Conjecture
Isaac Barouch Essayag, Aryeh Lev Zabokritskiy
Low-Rank Masking for Single-Server Matrix Multiplication
Alejandro Cohen, Rafael G. L. D'Oliveira, Alex Sprintson
Computing the entropy rate of a quantized stationary Gaussian process
Jeremy Magland
Counterexample to a Proposed Capacity Characterization of the Relay Channel
Chun Hei Michael Shiu
Common Randomness: A Key Enabler of Trustworthy 6G Communication Systems
Rami Ezzine, Moritz Wiese, Wafa Labidi et al.
Information Spectrum Methods for -Capacity Problems in the Theory of Mixed Multiple-Access Channels with Cost Constraint
Te Sun Han, Hideki Yagi