On a class of generalized Roth-Lempel codes
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.
Tom: We're looking at the paper: "On a class of generalized Roth-Lempel codes".
Jane: Here's the gist of the paper. The paper focuses on finding an equivalent condition for generalized Roth-Lempel codes to be non-RS MDS, AMDS, or non-RS self-dual.
Tom: Code Definitions and Preliminaries The paper defines the Generalized Roth-Lempel (GRL) code GRLk(α, v, Al×l) and provides necessary lemmas.
Jane: The generator matrix G1 for the Reed-Solomon code RSk(α) is given by equation (1), and non-RS MDS codes are constructed by adding columns to this matrix.
Tom: The GRL code is defined as GRLk(α, v, Al×l):= (v1f (α1),..., vnf (αn), β)f(x) ∈ Fk q
x: where Al×l = (aij)l×l ∈ GLl (Fq) and β = (fk−l,.., fk−1) Al×l = a11fk−l + a21fk−(l-1) + · · · + al1lfk−(l-1),.., allfk−1.
Paper summary: Tom: So we're looking at this paper "On a class of generalized Roth-Lempel codes." It’s about finding specific conditions for these generalized Roth-Lempel codes to be non-RS MDS, or almost MDS, or non-RS self-dual.
Jane: Right, so the main idea is that they are building on some existing concepts from Reed Solomon codes and trying to figure out what makes these new generalized Roth-Lempel codes behave differently when you're looking for those maximum distance separable properties.
Lu: Basically, they define this whole generalized Roth-Lempel code GRLk(alpha, v, A3 times three) and then they provide a very specific mathematical condition that tells you if that code is non-RS MDS or its dual is almost MDS <ref:2506.03874#pg2,non-RS MDS or its dual>.
Meng: The paper focuses on the conditions for the non-RS MDS property when k is greater than three, which means we're talking about codes with at least four dimensions, and they have these two simultaneous requirements involving subsets of alpha elements.
Tom: And then there’s another part where they tackle the AMDS dual condition for the dual code RLperp k(alpha, v, A3 times three), which involves six different cases based on some submatrices M1 through M6 of a parity-check matrix <ref:2506.03874#pg2>.
Jane: And finally, they establish an equivalent condition for the non-RS self-dual property when n plus three equals two k. That condition relies on finding some specific scalar lambda such that the vector v i equals lambda u i for all of them, and a relationship involving the A3 times three matrix <ref:2506.03874#pg2>.
Lu: The paper also touches on proving that GRLk(alpha, v, A3 times three) is non-RS when k is greater than three by showing it's monomially equivalent to another code and deriving a contradiction based on the roots of a polynomial <ref:2506.03874#pg2>.
Meng: And they mention some examples in the paper. For instance, Example nineteen shows that for q equals nineteen n equals five, and k equals four, this code GRLk(alpha, v, A3 times three) turns out to be a non-RS AMDS self-dual code over the field F13.
Tom: It sounds like they're really digging into the algebraic structure here to find these necessary and sufficient conditions for these codes.
Jane: So what this means for us is that we have a clear roadmap, if you're building a generalized Roth-Lempel code, you can check if it has those specific properties without having to test every possible thing.
Lu: It connects this new class of codes to the existing theory of Reed Solomon codes by giving them these explicit conditions for being non-RS MDS or AMDS.
Meng: From a deployment standpoint, knowing these exact criteria helps us predict when we're going to hit those limitations at scale, you know, what breaks when the code runs on real traffic.
Tom: The paper is essentially providing the theoretical backbone for understanding the performance boundaries of this new code family in terms of distance and duality.
Jane: So to wrap up on this paper "On a class of generalized Roth-Lempel codes," it’s about giving us concrete algebraic tests to check if these codes meet those desirable properties like being non-RS MDS or self-dual.
Lu: It's important because it generalizes previous results from other papers, extending what was already known about similar structures.
Meng: And the paper flags a limitation on the self-dual code in a different work, saying that it's only suitable for the case where q is congruent to one modulo four.
Tom: So, while they give us these conditions and examples like Example nineteen over F13, we have to keep those specific constraints in mind when we think about real-world applications.
Jane: Exactly. We need to make sure our implementation respects the field size and the structural requirements they lay out for these generalized codes.
Lu: And looking ahead, they are generalizing results from paper twenty-one which suggests there's more to explore in this area regarding non-GRS type MDS codes <ref:2506.03874#pg1>.
Meng: The focus now shifts to what these conditions actually translate into when we try to build a practical system that needs high performance.
Tom: It’s a solid piece of work because it moves the discussion from just constructing codes to rigorously characterizing their properties using these algebraic tests.
Conclusion: Tom: So we've been diving into these generalized Roth-Lempel codes today, and now we're wrapping up by looking at what this paper actually says about them, specifically about those non-RS MDS and self-dual properties.
Jane: Right, so the title is "On a class of generalized Roth-Lempel codes," and it’s basically showing us the specific mathematical recipe you need to check if these codes are almost MDS or self-dual without having to test everything yourself.
Lu: The authors are focusing on making these non-Reed Solomon type codes more predictable by giving us exact conditions—like how the vectors line up—for when they achieve those important properties.
Meng: For me, what this means is that if we want to use a code structure like this in a real system and we need it to have high distance or specific dual properties, these conditions give us a checklist.
Tom: Exactly. It moves it from just saying "this code *might* be good" to giving us the hard math on exactly when it *is* good, which is what I need when I'm building something that actually has to work reliably under stress.
Jane: And while they give us these conditions, there are still caveats they mention, like needing a specific relationship between the field size and the code length for those self-dual codes to work properly.
Lu: They also show how this new approach connects back to older research on other non-Reed Solomon codes, which is pretty interesting for understanding the whole family of these mathematical structures.
Meng: I’m curious about what happens next—do these conditions actually translate into a practical code we can deploy easily, or is it still too theoretical?
Tom: That's the big question. We need to see if this algebraic structure translates into something that doesn't break when we start running it on massive amounts of data.
Sichuan Normal University
cs.IT, math.IT
Submitted: 2025-06-04
Updated: 2026-11-12
Comments: 21 pages
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 66/100
The gist: The paper focuses on finding an equivalent condition for generalized Roth-Lempel codes to be non-RS MDS, AMDS, or non-RS self-dual.
Key concepts
- Generalized Roth-Lempel (GRL) Code
- This is a specific class of codes defined by parameters like $\alpha$, $v$, and $A_{l\times l}$. It builds upon the classical Roth-Lempel code structure, allowing for more general constructions. The definition involves a generator matrix constructed from these parameters.
- Non-RS MDS Property Condition
- This condition provides two simultaneous requirements that must be met for the GRL code to be non-RS MDS when $k > 3$. It involves checking specific linear independence and dependency relationships between subsets of field elements ($\alpha_i$) and the matrix entries ($a_{ij}$).
- AMDS Dual Condition
- This condition characterizes when the dual code, $\text{RL}^{\perp k}(\alpha, v, A_{3\times 3})$, is Almost MDS. It requires checking six distinct cases based on submatrices of the parity-check matrix and specific linear dependencies among derived vectors.
- Non-RS Self-Dual Condition
- This condition applies when $n + 3 = 2k$. It is met if there exists a scalar $\lambda$ such that the code parameters satisfy $v_i = \lambda u_i$ for all $i$, and a specific relationship holds between the matrix $A_{3\times 3}$ and its transpose.
Terminology
Summary
The paper focuses on finding an equivalent condition for generalized Roth-Lempel codes to be non-RS MDS, AMDS, or non-RS self-dual. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
Code Definitions and Preliminaries
The paper defines the Generalized Roth-Lempel (GRL) code GRLk(α, v, Al×l) and provides necessary lemmas. The generator matrix G1 for the Reed-Solomon code RSk(α) is given by equation (1), and non-RS MDS codes are constructed by adding columns to this matrix. p. 0 Since MDS codes based on RS codes are equivalent to RS codes, and so it’s interesting to construct non-RS MDS codes
[16]–[26]. In 1989, Roth and Lempel [20] constructed a class of non-RS type MDS codes by adding two columns to the matrix
G1 given by (1), the corresponding linear code over Fq has the generator matrix
G2 =
G1
0
A1
k×(n+2)
, (2)
This paper is supported by National Natural Science Foundation of China (Grant No. , vn) ∈
F
∗
q
n
. The generalized Roth-Lempel (in short, GRL) code GRLk(α, v, Al×l) is
defined as
GRLk(α, v, Al×l) :=
(v1f (α1), . The generalized Roth-Lempel (in short, GRL) code GRLk(α, v, Al×l) is
defined as
GRLk(α, v, Al×l) :=
(v1f (α1), . , vnf (αn), β)|f(x) ∈ F
k
q
[x]
,
where Al×l = (aij )l×l ∈ GLl (Fq) and
β = (fk−l
, . , vnf (αn), β)|f(x) ∈ F
k
q
[x]
,
where Al×l = (aij )l×l ∈ GLl (Fq) and
β = (fk−l
, . , fk−1) Al×l =
a11fk−l + a21fk−(l−1) + · · · + al1fk−1, . , fk−1) Al×l =
a11fk−l + a21fk−(l−1) + · · · + al1fk−1, . , a1lfk−l + a2lfk−(l−1) + · · · + allfk−1
. (1) By taking v = (1, . , 1) and Al×l = A1 in Definition 1, then GRLk(α, v, Al×l) is a classical Roth-Lemmpel
(in short RL) code and denote by RLk(α, δ). This paper is organized as follows. In Section 2, we give the definition of the GRL code and some necessary lemmas.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Non-RS MDS Property Condition
Theorem 8 provides an equivalent condition for GRLk(α, v, A3×3) to be non-RS MDS when k > 3. This condition requires two simultaneous requirements: (1) for any subset J ⊆ α1,. p. 3 The equivalent condition for GRLk(α, v, A3×3) to be non-RS MDS
In this subsection, we give an equivalent condition for GRLk(α, v, A3×3) to be MDS as the following
Theorem 8. If k > 3, then GRLk(α, v, A3×3) is non-RS MDS if and only if the following two conditions hold simultaneously:
(1) for any subset J ⊆ {α1, . If k > 3, then GRLk(α, v, A3×3) is non-RS MDS if and only if the following two conditions hold simultaneously:
(1) for any subset J ⊆ {α1, . , αn} with size k − 1,
a1s
X
αil
̸=αij ∈J
αilαij + a3s ̸= a2s
X
αil
∈J
αil
(1 ≤ s ≤ 3);
(2) for any subset I ⊆ {α1, . , αn} with size k − 1,
a1s
X
αil
̸=αij ∈J
αilαij + a3s ̸= a2s
X
αil
∈J
αil
(1 ≤ s ≤ 3);
(2) for any subset I ⊆ {α1, . , αn} with size k − 2,
(−a1sa2t + a2sa1t)
X
αil
∈I
α
2
il +
X
αil
̸=αij ∈I
αilαij
̸= (a3sa1t − a1sa3t)
X
αil
∈I
αil + a2sa3t − a3sa2t(1 ≤ t < s ≤ 3).Where the paper says it
Where the paper says it
Where the paper says it
AMDS Dual Condition
Theorem 12 gives an equivalent condition for the dual code RL⊥k(α, v, A3×3) to be AMDS when k > 3. This involves six cases based on the submatrix M1 through M6 of the parity-check matrix G4, and conditions (1) through (6) which specify linear independence or dependency among certain vectors derived from the code parameters. p. 7 , 0, a13, a23, a33)
T
. Since G4 is the parity-check matrix of GRL⊥
k
(α, v, A3×3), then GRL⊥
k
(α, v, A3×3) is AMDS if and only if it has parameters
[n + 3, n + 3 − k, k].Where the paper says it
Non-RS Self-Dual Condition
Theorem 17 establishes an equivalent condition for GRLk(α, v, A3×3) to be non-RS self-dual when n + 3 = 2k. This condition is met if and only if there exists some λ ∈ F∗ q such that vi = λ ui for any 1 ≤ i ≤ n, and A3×3A T 3×3 = λ0 0 −1
0 −1 −Pn i=1 αi−1 −Pn i=1 αi−
P 5 i<j≤n αiαj!.
Examples and Conclusions
Example 19 demonstrates that for (q, n, k) = (19, 5, 4), the code GRLk(α, v, A3×3) is a non-RS AMDS self-dual code over F13. The authors conclude by generalizing previous results to obtain the main findings listed above. The paper also notes that the self-dual code in [22] is only suitable for the case q ≡ 1 (mod 4). p. 0 In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples. Index Terms
Non-GRS MDS code, AMDS code, Non-GRS self-dual code.Where the paper says it
References
[1] S. Dodunekov and I. Landgev, “On near-MDS codes,” J. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
[2] W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
[3] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[4] V. R. Cadambe, C. Huang, and J. Li, “Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems,” in 2011 IEEE International Symposium on Information Theory Proceedings, San Jose, CA, USA, 2011. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[5] M. A. De Boer, “Almost MDS codes,” Designs, Codes Cryptogr. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[6] Y. Zhou, F. Wang, Y. Xin, et al., “A secret sharing scheme based on near-MDS codes,” in 2009 IEEE International Conference on Network Infrastructure and Digital Content, Beijing, China, 2009. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[7] M. F. Ezerman, M. Grassl, and P. Sole, “The weights in MDS codes,” ´ IEEE Trans. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
[8] Z. Heng, C. Li, and X. Wang, “Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F∗q 2,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[9] J. I. Kokkala, D. S. Krotov, and P. R. J. Osterg ¨ ard, “On the classification of MDS codes,” ˚ IEEE Trans. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
[10] X. Geng, M. Yang, J. Zhang, et al., “A class of almost MDS codes,” Finite Fields Appl. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[11] X. Fang, M. Liu, and J. Luo, “New MDS Euclidean self-orthogonal codes,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[12] L. Jin and C. Xing, “New MDS self-dual codes from generalized Reed—Solomon codes,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[13] J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups.
[14] R. Cramer, V. Daza, I. Gracia, et al., “On codes, matroids, and secure multiparty computation from linear secret-sharing schemes,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[15] S. T. Dougherty, S. Mesnager, and P. Sole, “Secret-sharing schemes based on self-dual codes,” in 2008 IEEE Information Theory Workshop, Nice, France, 2008. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[16] L. Jin, L. Ma, C. Xing, et al., “New families of non-Reed-Solomon MDS codes,” arXiv preprint arXiv:2411. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[17] F. Li, Y. Chen, H. Chen, et al., “Non-Reed-Solomon Type Cyclic MDS Codes,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
Where the paper says it
Where the paper says it
[18] Y. Wu, J. Y. Hyun, and Y. Lee, “New LCD MDS codes of non-Reed-Solomon type,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
Where the paper says it
[19] S. Liu, H. Liu, and F. Oggier, “Constructions of non-Generalized Reed-Solomon MDS codes,” arXiv preprint arXiv:2412. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[20] R. M. Roth and A. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12]. Since MDS codes based on RS codes are equivalent to RS codes, and so it’s interesting to construct non-RS MDS codes
[16]–[26]. In 1989, Roth and Lempel [20] constructed a class of non-RS type MDS codes by adding two columns to the matrix
G1 given by (1), the corresponding linear code over Fq has the generator matrix
G2 =
G1
0
A1
k×(n+2)
, (2)
This paper is supported by National Natural Science Foundation of China (Grant No.Where the paper says it
Where the paper says it
Where the paper says it
[21] Y. Wu, Z. Heng, C. Li, et al., “More MDS codes of non-Reed-Solomon type,” arXiv preprint arXiv:2401. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[22] Li F, Jiang R, Liu Y. ”New MDS and self-dual generalized Roth-Lample codes as well as their deep holes,” Designs, Codes and Cryptography, 2025: 1-18. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
[23] Y. Zhi and S. Zhu, “New MDS codes of non-GRS type and NMDS codes,” Discrete Math. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[24] Y. Li and S. Zhu, “New non-GRS type MDS codes and NMDS codes,” arXiv preprint arXiv:2401. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[25] D. Han and C. Fan, “Roth–Lempel NMDS codes of non-elliptic-curve type,” IEEE Trans. p. 0 Since MDS codes based on RS codes are equivalent to RS codes, and so it’s interesting to construct non-RS MDS codes
[16]–[26]. In 1989, Roth and Lempel [20] constructed a class of non-RS type MDS codes by adding two columns to the matrix
G1 given by (1), the corresponding linear code over Fq has the generator matrix
G2 =
G1
0
A1
k×(n+2)
, (2)
This paper is supported by National Natural Science Foundation of China (Grant No. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
Where the paper says it
[26] Y. Li, S. Zhu, and Z. Sun, “Covering radii and deep holes of two classes of extended twisted GRS codes and their applications,” IEEE Trans. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
[27] R. M. Roth and G. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples. α
k−2
1 α
k−2
2
· · · α
k−2
n−1 α
k−2
n
α
k−1
1 α
k−1
2
· · · α
k−1
n−1 α
k−1
n
k×n
(1)
is a generator matrix of RSk(α) and RSk(α) have parameters [n, k, n − k + 1]. Since MDS codes based on RS codes are equivalent to RS codes, and so it’s interesting to construct non-RS MDS codes
[16]–[26]. If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
Where the paper says it
Where the paper says it
[28] D. Han and H. Zhang, “Explicit constructions of NMDS self-dual codes,” Designs, Codes Cryptogr. p. 0 If a
linear code is not equivalent to any RS code, then it is called to be non-Reed- Solomon (non-RS) type. Since MDS or AMDS
codes have important applications in communications, data storage, combinatorial theory and secret sharing, and so on [1]–[6],
the study for MDS codes or AMDS codes, including their weight distributions, constructions, equivalence, self-orthogonal, and
(almost) self-dual property, has attracted a lot of attentions [7]–[12].Where the paper says it
B A class of generalized Roth-Lempel codes is studied to determine equivalent conditions for them to be non-RS MDS, AMDS, or non-RS self-dual. p. 0 1
The equivalent condition for GRL codes to be
non-GRS MDS, AMDS or self-dual
Zhonghao Liang, Yongkang Wan and Qunying Liao*
Abstract
It’s well-known that MDS, AMDS or self-dual codes have good algebraic properties, and are applied in communication
systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes
which are not not equivalent to linear codes in [21], [22], and give an equivalent condition for them or their dual to be non-RS
MDS, AMDS or non-RS self-dual and some corresponding examples.Where the paper says it
Pruning redundant reasoning tokens
The paper proves that GRLk(α, v, A3×3) is non-GRS when k > 3 by showing it is monomially equivalent to GRLk(α, 1, A3×3) and deriving a contradiction based on the roots of a polynomial. Theorem 7 proves that if k > 3, then GRLk(α, v, A3×3) is non-GRS. p. 2 The non-RS property of GRLk(α, v, A3×3)
In this subsection, we prove that GRLk(α, v, A3×3)(k > 3) is non-RS as the following
Theorem 7. If k > 3, then GRLk(α, v, A3×3) is non-GRS.Where the paper says it
How the training signal is built
The parity-check matrix H5 for GRLk (α, v, A3×3) has a complex structure involving vectors ui and vn. The generator matrix G5 is given by equation (14). p. 0 Since MDS codes based on RS codes are equivalent to RS codes, and so it’s interesting to construct non-RS MDS codes
[16]–[26]. In 1989, Roth and Lempel [20] constructed a class of non-RS type MDS codes by adding two columns to the matrix
G1 given by (1), the corresponding linear code over Fq has the generator matrix
G2 =
G1
0
A1
k×(n+2)
, (2)
This paper is supported by National Natural Science Foundation of China (Grant No. In
Section 3, we give an equivalent condition for the code GRLk(α, v, A3×3) given by Remark 2 to be non-RS MDS or its dual
to be AMDS, respectively. In Section 4, we determine a parity-check matrix of GRLk(α, v, A3×3) given by Definition 1, and
then also give an equivalent condition for that it is non-RS self-dual.Where the paper says it
Where the paper says it
Where the gains come from
The conditions for non-RS MDS involve checking four cases (Case 1 to Case 4) based on the submatrix K1 to K4 of G4, which relate to the linear independence of columns. The AMDS condition involves checking six conditions (Condition 1 through Condition 6) related to subsets I and J of the field elements. p. 7 The equivalent condition for GRL⊥
k
(α, v, A3×3) to be AMDS
In this subsection, we give an equivalent condition for GRL⊥
k
(α, v, A3×3) to be AMDS as the following
Theorem 12. GRL⊥
k
(α, v, A3×3) if and only if the following conditions hold simultaneously:
(1) for any subset I ⊆ {α1, . In
Section 3, we give an equivalent condition for the code GRLk(α, v, A3×3) given by Remark 2 to be non-RS MDS or its dual
to be AMDS, respectively. In Section 4, we determine a parity-check matrix of GRLk(α, v, A3×3) given by Definition 1, and
then also give an equivalent condition for that it is non-RS self-dual. In
Section 3, we give an equivalent condition for the code GRLk(α, v, A3×3) given by Remark 2 to be non-RS MDS or its dual
to be AMDS, respectively. In Section 4, we determine a parity-check matrix of GRLk(α, v, A3×3) given by Definition 1, and
then also give an equivalent condition for that it is non-RS self-dual. , replaces A2 by A3×3 = (aij ) ∈ GL3 (Fq) and generalize the corresponding results. This paper is organized as follows.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved code construction capabilities: The system can generate non-Reed-Solomon MDS codes using generalized Roth-Lempel linear codes by applying specific structural conditions derived in Theorem 8 and Corollary 10, allowing for tailored code parameters based on chosen field elements like mu, delta, and tau.
-
Dual code analysis: The system can determine the exact conditions under which the dual of a GRL code is almost MDS using Theorem 12, enabling the design of codes with specific distance properties in communication systems or storage applications.
-
Self-dual code verification: The AI can verify if a given GRL code is non-RS self-dual by checking the existence of a specific lambda parameter and the condition on the matrix product A3 times A transpose derived in Theorem 17, which is crucial for quantum coding applications.
-
Parity-check matrix generation: The system can construct the parity-check matrix H5 for GRL k (alpha, v, A3x3) using Theorem 16, facilitating efficient decoding and error correction processes for these generalized codes.
-
Code equivalence testing: The system can test the equivalence of a constructed code with existing classes like classical Roth-Lempel codes or Reed-Solomon codes by checking if the generator matrix can be transformed into the standard forms as discussed in Remark 9.
Abstract
Maximum distance separable (MDS), almost MDS (AMDS), and self-dual codes have applications in communications, data storage, and quantum coding. The construction and structural study of MDS codes that are not equivalent to generalized Reed-Solomon (GRS) codes are important problems in coding theory and finite geometry. In this paper, we investigate the generalized Roth-Lempel (GRL) codes GRL k(α, v, A 3 times 3) introduced by Li et al. [28] in the case of a 3 times 3 appended matrix. Using the Cauchy matrix method of Roth and Lempel, we derive a sufficient condition under which these codes are not equivalent to GRS codes. We also establish necessary and sufficient conditions for their duals to be AMDS and for the codes to be self-dual. The self-duality criterion extends the corresponding result in [28], and we provide examples illustrating our results. Under suitable parameter assumptions and an explicit rank condition, we show that the Schur square of an [n, k] q GRL code GRL k(α, v, A 3 times 3) has dimension 2k + 2. Using this invariant, we show that, under certain conditions, these GRL codes are not equivalent to codes from several known non-GRS families.
Sources
- New families of non-Reed-Solomon MDS codes
- Constructions of non-Generalized Reed-Solomon MDS codes
- More MDS codes of non-Reed-Solomon type
- A family of linear codes that are either non-GRS MDS codes or NMDS codes
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound