I Introduction
The problem of designing a linear code with the largest possible minimum distance, subject to support constraints on the generator matrix, has recently found several applications. These include multiple access networks [5, 3] as well as weakly secure data exchange [4, 8]. A simple upper bound on the maximum minimum distance can be obtained from a sequence of Singleton bounds (see eq. (3) below) and can further be achieved by randomly choosing the nonzero elements of the generator matrix from a field of a large enough size.
A natural question to ask is whether the above maximum minimum distance can be achieved with a field of small size, and in particular with a structured, possible algebraic, construction. This question is equivalent to a recently proposed conjecture by Dau et al. [2], which is commonly referred to as the GMMDS conjecture.
In the past couple of years, progress has been reported on this conjecture. Heidarzadeh et al. [9] have proved it for dimensions . Halbawi et al. [5] have proved the statement for if there are distinct support sets on the rows of the generator matrix. In the authors’ previous work [1], the statement has been proved for . Halbawi et al. [6, 7] and Song et al. [10], have studied the problem when the generator matrix is sparsest and balanced and established the conjecture in this special case. Yan et al. [8] give some partial results.
In this paper we show that the largest minimum distance can be achieved by a subcode of a ReedSolomon code of small field size, in fact as low as , where is the code length, and is the maximum minimum distance dictated by the support constraints. As a byproduct of this result, we settle the GMMDS conjecture in the affirmative.
The remainder of the paper is organized as follows. In Section II, we characterize the generator matrices of subcodes of ReedSolomon codes. Section III defines the problem (of maximizing subject to support constraints) and shows that it can be reduced to the GMMDS conjecture. Section IV proposes a more general statement of the problem, that is not directly related to the coding problem, but that more readily lends itself to an induction argument. This is the result we prove which, by fiat, solves the problem of maximizing and the GMMDS conjecture. The proof is detailed in the Appendix.
Ia Notation
Matrices are shown by bold capital letters and vectors are shown by bold lower case letters. For
, we denote by the set by admitting . For , we write to represent the ordered list of objects . For a finite nonempty , is the ordered list of ’s for in the ascending order of their indices.represents the polynomial ring over the field , i.e. the set of polynomials with coefficients in . represents the field of rational functions in over the field , i.e. the set of functions that can be written as a ratio of two polynomials in such that the denominator is not the zero polynomial.
and represent a linear code over with length , dimension , and minimum distance .
Ii Subcodes of ReedSolomon Codes
An ReedSolomon code can be generated by a Vandermonde matrix
(1) 
for distinct . ReedSolomon codes have efficient decoders that can correct up to errors.
For , subcodes of ReedSolomon codes have generator matrices of the following form:
(2) 
where is full rank and is given in (1).
The minimum distance is equal to the minimum weight of over all nonzero row vectors . Since is a Vandermonde matrix, if we treat the entries of as coefficients of a nonzero polynomial , then, the entries of will be . As , the number of nonzero entries in is at least . Therefore, the minimum distance is bounded by .
We should mention that every linear code is a subcode of an ReedSolomon code. However, we are interested in the subcodes of ReedSolomon codes with the same minimum distance. In other words, we want to design , , and such that . Note that in that case, we can use the same decoder of the ReedSolomon code with the generator matrix to correct up to errors.
Iii Support Constraint on the Generator Matrix
Let . For an linear code, suppose that we have the support constraints on the generator matrix G. We are interested in finding a linear code having the largest minimum distance under these constraints.
For any nonempty , the rows of indexed in have zeros in all their entries indexed in . Consider the submatix of consisting of the rows indexed in and the columns indexed in . The minimum distance of is at most the minimum distance of the code generated by this submatrix, which is at most by the Singleton bound. Hence,
(3) 
Theorem 1 states that we can achieve this bound using the subcodes of ReedSolomon Codes if is large enough. In the proof of Theorem 1, we will show that it is enough to prove a special case, Theorem 2, where and the optimum code is an MDS code.
Theorem 1.
Let ,
(4) 
and be a field size. Then, there exists an subcode of a ReedSolomon code that achieves such that the generator matrix has zeros at for .
Proof.
For , we have . Let . By Theorem 2, there exists an ReedSolomon code that has a generator matrix such that for . The subcode with the generator matrix consisting of the first rows of satisfies the desired constraints. ∎
Iiia Existence of MDS codes
As a special case, we will describe necessary and sufficient conditions on the support constraints for the existence of a ReedSolomon code whose generator matrix satisfies these support constraints. Theorem 2 has been known as the GMMDS conjecture, which is proposed by Dau et al. in [2], where they showed that it is equivalent to Corollary 1 given in Section IV.
Theorem 2.
Let and be a field size. For any nonempty ,
(5) 
if and only if there exists an ReedSolomon code with a generator matrix such that for .
Iv Main Theorem
For , let be the field of rational functions in over the set of rational numbers. We will admit that . For and , define
(6)  
Define the matrix in terms of the parameters as follows (We will often write to indicate its parameters):
(7) 
The rows are partitioned into blocks and for , the th block is an upper triangular Toeplitz matrix, whose first row consists of the coefficients of the polynomial in descending order with respect to the degree. This matrix can be also thought of as a generalized Sylvester matrix that is constructed by polynomials. The condition ensures that the rows are not shifted too much that we lose a nonzero entry in the last row of the th block. Also, notice that the bottomright entry of the th block is nonzero if we have the equality , and zero otherwise. So, we need at least one equality if we want to be nonsingular.
In Proposition 1, we give an equivalent way of writing in terms of the polynomials that we use when constructing .
Proposition 1.
Let . For , define
(8) 
Then, if and only if there exist , not all zero, such that for and .
Proof.
For each , construct a row vector of size consisting of the coefficients of in and merge them into one row vector . Then, iff . The statement follows from iff there exists nonzero such that . ∎
Theorem 3 gives necessary and sufficient conditions on the parameters for to be nonzero.
Theorem 3.
Let , , . Then, if and only if for any nonempty ,
(9) 
Proof.
See Appendix A. ∎
In Theorem 3, if we let , , and , we will get Corollary 1.
Corollary 1.
Let such that . Then, the determinant of
(10) 
is nonzero if and only if for any nonempty ,
(11) 
Appendix A Proof of Theorem 3
Suppose that for some nonempty , the condition (9) is not true. Let , , . Then, . Consider the rows of in the blocks indexed in . They all have zeros in their last entries. Let be the submatrix consisting of these rows without including the last columns. We will prove that , which implies . Let be Vandermonde matrix. Then, because the polynomials with the coefficients in the rows of vanish at for . Hence,
(12) 
which proves the first direction.
For the other direction, we will apply induction on the parameters considered in the lexicographical order. For , and . For , all of ’s are empty; hence, for , (9) yields , for which, we already showed . For and , assume that the statement is true for parameters that are smaller than with respect to lexicographical order. Take any that satisfies the condition (9). We will prove that under three cases:

There exists such that and
(13) 
There exists a unique such that .

Else (i.e. 1 and 2 are false).
Case 1
Let . Note that . Define
(14) 
Then, (13) becomes
(15) 
Define for . Then,
(16) 
The first one is true because and for any , by (15),
(17) 
The second one is true because
(18) 
for and due to (15).
By the induction hypothesis, the statement is true for and . We will show that both satisfy the condition (9):

For any nonempty ,
(19) (20) (21) 
For any nonempty , if , then and (9) holds trivially. Assume for some . Then,
(22) (23) (24)
Hence, we have that
(25) 
Now, we will use Proposition 1. Define for ,
(26) 
and for ,
(27) 
Note that for , .
Consider any such that for and . We need to prove that for all . Define
(28) 
Note that :
(29)  
(30)  
(31) 
Also, we can write that
(32) 
Then, by Proposition 1, we get for all . Then, . Then, by Proposition 1, for all . Hence, for all . By Proposition 1, .
Case 2
W.l.o.g., let be the maximizer. Then, for ,
(33) 
Then, the last column of is all zero except the last entry, which is .
Hence, we have
(34) 
where and for assuming that . (If , the first multiplier would be , which is nonzero by the induction hypothesis.)
Note that since and for any due to the unique maximizer assumption.
By the induction hypothesis, the statement is true for . If we prove that it satisfies the condition (9), then .
For any nonempty , if , then (9) holds trivially. Assume .
(35)  
(36)  
(37)  
(38) 
Case 3
For any nonempty such that , we have
(39) 
Also, there exist at least two maximizers of . W.l.o.g., assume that
(40) 
If , we get a contradiction in (9):
(41) 
Then, either or . W.l.o.g., we can assume that . Substitute :
(42) 
where .
Note that since and for .
By the induction hypothesis, the statement is true for . If we prove that it satisfies the condition (9), then .
For , (9) holds trivially. For , we have
(43)  
(44)  
(45) 
For , it is enough to show that , which is true because
(46) 
References
 [1] H. Yildiz and B. Hassibi, “Further progress on the gmmds conjecture for reedsolomon codes,” arXiv preprint arXiv:1801.07865, 2018.
 [2] S. H. Dau, W. Song, and C. Yuen, “On the existence of mds codes over small fields with constrained generator matrices,” in International Symposium on Information Theory (ISIT). IEEE, 2014, pp. 1787–1791.
 [3] S. H. Dau, W. Song, and C. Yuen, “On simple multiple access networks,” IEEE Journal on Selected Areas in Communications. vol. 33, no. 2, pp. 236–249, 2015.
 [4] M. Yan and A. Sprintson, “Algorithms for weakly secure data exchange,” in International Symposium on Network Coding (NetCod). IEEE, 2013, pp. 1–6.
 [5] W. Halbawi, T. Ho, H. Yao, and I. Duursma, “Distributed reedsolomon codes for simple multiple access networks,” in International Symposium on Information Theory (ISIT). IEEE, 2014, pp. 651–655.
 [6] W. Halbawi, Z. Liu, and B. Hassibi, “Balanced reedsolomon codes,” in International Symposium on Information Theory (ISIT). IEEE, 2016, pp. 935–939.
 [7] W. Halbawi, Z. Liu, and B. Hassibi, “Balanced ReedSolomon codes for all parameters,” in Information Theory Workshop (ITW). IEEE, 2016, pp. 409–413.
 [8] M. Yan, A. Sprintson, and I. Zelenko, “Weakly secure data exchange with generalized reed solomon codes,” in International Symposium on Information Theory (ISIT). IEEE, 2014, pp. 1366–1370.
 [9] A. Heidarzadeh and A. Sprintson, “An algebraiccombinatorial proof technique for the gmmds conjecture,” in International Symposium on Information Theory (ISIT). IEEE, 2017, pp. 11–15.
 [10] W. Song and K. Cai, “Generalized reedsolomon codes with sparsest and balanced generator matrices,” arXiv preprint arXiv:1801.02315, 2018.
Comments
There are no comments yet.