Reed–Solomon Codes Over Small Fields With Constrained Generator Matrices
نویسندگان
چکیده
منابع مشابه
Optimum Linear Codes with Support Constraints over Small Fields
We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size. As a by-product of this result, we settle the GM-MDS conjecture of Dau et. al. in the affirmative.
متن کاملZ2Z4-linear codes: generator matrices and duality
A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z...
متن کاملGeneralized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
We prove that for any positive integers n and k such that n≥ k≥ 1, there exists an [n, k] generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size q ≥ n+ ⌈ k(k−1) n ⌉, where sparsest means that each row of the generator matrix has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two c...
متن کاملList decoding Reed-Muller codes over small fields
The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes. Fix a finite field F. The Reed-Muller code RMF(n, d) is defined by n-variate degree-d polynomials over F. In this work, we study the ...
متن کاملConstructions of High-Rate MSR Codes over Small Fields
Three constructions of minimum storage regenerating (MSR) codes are presented. The first two constructions provide access-optimal MSR codes, with two and three parities, respectively, which attain the sub-packetization bound for access-optimal codes. The third construction provides larger MSR codes with three parities, which are not access-optimal, and do not necessarily attain the sub-packetiz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2897767