Grassl–Rötteler cyclic and consta-cyclic MDS codes are generalised Reed–Solomon codes
نویسندگان
چکیده
We prove that the cyclic and constacyclic codes constructed by Grassl Rötteler in International Symposium on Information Theory (ISIT), pp. 1104–1108 (2015) are generalised Reed–Solomon codes. This note can be considered as an addendum to pp (2015). It also appendix Ball Vilar IEEE Trans Inform 68:3796–3805, (2022) where Conjecture 11 of (2015), which was stated for Grassl–Rötteler codes, is proven The content this note, together with therefore implies from true.
منابع مشابه
Cyclic arcs and pseudo-cyclic MDS codes
Cyclic arcs (defined by Storme and Van Maldghem, [1994]) and pseudocyclic MDS codes are equivalent objects. We survey known results on the existence of cyclic arcs. Some new results on cyclic arcs in PG(2, q) are also given.
متن کاملLong cyclic codes are good
Long quasi-cyclic codes of any fixed index > 1 have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. Güneri, H. Shoaib, P. Solé, 2017). We use this recent result to construct good long additive cyclic codes on any extension of fixed degree of the base field. Similarly selfdual double circulant codes, and self-dual four circulant codes, have ...
متن کاملPolynomial Codes and Cyclic Codes
As an example, take F2, n = 5 and g(x) = x2 + x + 1. The code consists of the 8 codewords 0 · g(x), . . . , (x2 + x + 1) · g(x). Equivalently, we can identify every polynomial with its vector of coefficients to get a codeword in F2 . Verify that a polynomial code is linear and has dimension k = n −m. Also, check that if g(x) = ∑n−k i=0 gix i is the generator polynomial, then an n× k generating ...
متن کاملGradient Coding from Cyclic MDS Codes and Expander Graphs
Gradient Descent, and its variants, are a popular method for solving empirical risk minimization problems in machine learning. However, if the size of the training set is large, a computational bottleneck is the computation of the gradient, and hence, it is common to distribute the training set among worker nodes. Doing this in a synchronous fashion faces yet another challenge of stragglers (i....
متن کاملCyclic additive codes and cyclic quantum stabilizer codes
The theory of cyclic linear codes in its ring-theoretic formulation is a core topic of classical coding theory. A simplified approach is in my textbook [1]. The language of ring theory is not needed. We will present a self-contained description of the more general theory of cyclic additive codes using the same method. This includes cyclic quantum stabilizer codes as a special case. The basic in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2022
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01174-5