WebMinimal cyclic codes of length 2pn, Finite Fields Appl., 5(1999), 177-187. [1]], which considered the cases t= 1 and t= 2 respectively. We propose an approach di erent from … WebMay 26, 2024 · Finally we construct a linear MSRD code over an arbitrary finite field ... \ldots, t-1$, for any given minimum sum-rank distance. There is no restriction on the block ... A sum-rank-metric code attaining the Singleton bound is constructed over some F q -linear MSRD code over some field F q with different matrix sizes n 1 > n 2 ...
Asymptotically good ZprZps-additive cyclic codes - ScienceDirect
WebApr 1, 2024 · Kai and Zhu [29] later proposed a method for generating quantum codes using cyclic codes of odd length over the finite chain ring F 4 + v F 4 with u 2 = 0. Further, Qian [18] has introduced a method for generating quantum error-correcting codes using cyclic codes over the finite non-chain ring F 2 + v F 2 with arbitrary length v 2 = v. WebJan 1, 2024 · $\begingroup$ It would be easier to give a helpful answer, if you explained what you know about cyclic codes and Reed-Solomon codes. $\endgroup$ – Jyrki … how do you make a toilet flush stronger
A class of minimal cyclic codes over finite fields
WebAn irreducible code is a cyclic code in which the code, as an ideal is irreducible, i.e. is minimal in , so that its check polynomial is an irreducible polynomial. Examples [ edit ] For … WebPOLYNOMIAL CODES OVER CERTAIN FINITE FIELDS* I. S. REEDAND G. SOLOMON; Introduction. Acode is a mappingfrom a vector space of dimension m over a finite field … WebSince every linear code is contained in an MDS linear code with the same minimum distance over some finite field extension, we focus our study on MDS linear codes. It is well-known that an MDS linear code with minimum distance 2 ℓ + 1 has an ℓ -error-correcting pair if and only if it is a generalized Reed-Solomon code. how do you make a tint