Generalized Roth-Lempel Codes Overview

• Generalized Roth–Lempel (GRL) codes are a family of non-GRS linear codes defined by augmenting Reed–Solomon matrices with algebraically-structured columns.
• They enable construction of MDS, AMDS, NMDS, and self-dual codes, facilitating applications in quantum error correction, cryptography, and combinatorial design.
• GRL codes incorporate specialized decoding algorithms and clear algebraic criteria, ensuring efficient error correction and flexible control over code hull dimensions.

Generalized Roth–Lempel (GRL) codes are a family of non-GRS-type linear codes constructed via the augmentation of Reed–Solomon (RS) generator matrices with algebraically structured columns determined by invertible matrices acting on the polynomial coefficient space. These codes are parameterized by the choice of evaluation points, multipliers, and a tail matrix, enabling the construction of MDS, AMDS, NMDS, and self-dual codes with flexible hull dimensions. GRL codes have become central objects in the contemporary theory of code families not equivalent to generalized Reed–Solomon codes, with applications to quantum error correction (EAQECCs), LCD code constructions, and combinatorial design.

1. Algebraic Definition and Structural Properties

Let $\F_q$ be the finite field of order $q$. Fix integers $l+1 \le k+1 \le n \le q$. Select:

• $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$ with $\alpha_i \in \F_q$ all distinct,
• $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$,
• $A \in GL_l(\F_q)$ (an invertible $l \times l$ matrix).

Define a message polynomial $f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$. The appended $l$ coordinates are $q$0. The generalized Roth–Lempel code is constructed as

$q$1

with parameters $q$2 over $q$3 (Liang et al., 4 Jun 2025, Liang et al., 17 Aug 2025, Liang et al., 17 Mar 2026).

A prototypical generator matrix (for $q$4) takes the block form

$q$5

where the first $q$6 columns form a "twisted" RS block and the last $q$7 columns form the $q$8 block. When $q$9 and $l+1 \le k+1 \le n \le q$0, this recovers the original Roth–Lempel construction.

2. MDS, AMDS, NMDS, and Self-Dual Criteria

MDS Codes

The $l+1 \le k+1 \le n \le q$1 GRL code is MDS if and only if every $l+1 \le k+1 \le n \le q$2 columns of the generator matrix are linearly independent. For $l+1 \le k+1 \le n \le q$3 (classical RL codes), explicit combinatorial conditions relating minors of $l+1 \le k+1 \le n \le q$4 and structured sums over the set of evaluation points $l+1 \le k+1 \le n \le q$5 are required to never vanish [(Liang et al., 4 Jun 2025), Theorem 3.3]. Specifically, MDS-ness is characterized by non-vanishing of determinant expressions partitioned over all subsets of $l+1 \le k+1 \le n \le q$6 and $l+1 \le k+1 \le n \le q$7 evaluation points.

AMDS and NMDS Codes

The dual of a GRL code is AMDS if every $l+1 \le k+1 \le n \le q$8 columns of the generator (or parity-check) matrix are independent, but some $l+1 \le k+1 \le n \le q$9 columns are dependent. Six distinct conditions (arising from types of minors) must be examined, mirroring the MDS criteria with suitable modifications [(Liang et al., 4 Jun 2025), Theorem 3.6]. Extended GRL codes (EGRL), with an additional appended coordinate, allow for precise rank and weight-distribution analysis, producing infinite families of explicit NMDS codes generalizing Han et al. using full and punctured evaluation sets (Liang et al., 17 Aug 2025, Liang et al., 24 Jun 2025).

Self-Duality

Self-dual GRL codes require $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$0 and two simultaneous algebraic constraints:

• Existence of a scalar $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$1 such that $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$2 for all $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$3 (with $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$4),
• $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$5, where $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$6 is a structured symmetric matrix formed from the elementary symmetric sums of the $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$7 [(Liang et al., 4 Jun 2025), Theorem 4.3].

Non-RS self-dual MDS and AMDS GRL codes exist for specified field characteristics.

3. Decoding Algorithms and Complexity

List and unique decoding algorithms for GRL codes have been developed based on the Guruswami–Sudan interpolation paradigm. The decoding process consists of puncturing, interpolation, factorization, filtering, and final selection (potentially AMD-assisted):

1. Puncturing to a GRS code.
2. Interpolation: find $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$8 vanishing with multiplicity $\boldsymbol{\alpha} = (\alpha_1, \dots, \alpha_n)$9 at each $\alpha_i \in \F_q$0, where $\alpha_i \in \F_q$1 is the received symbol.
3. Factorization: enumerate all $\alpha_i \in \F_q$2 of degree $\alpha_i \in \F_q$3 such that $\alpha_i \in \F_q$4.
4. Filtering and re-encoding; output codewords within radius $\alpha_i \in \F_q$5.
5. Use of systematic AMD codes over $\alpha_i \in \F_q$6 enables high-probability identification of the correct codeword when list size exceeds one.

Under suitable parameters ($\alpha_i \in \F_q$7), unique decoding can be achieved up to $\alpha_i \in \F_q$8 errors, and list decoding exceeds this radius for $\alpha_i \in \F_q$9, with near-linear complexity $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$0 for fixed-rate codes (Zhu et al., 30 Dec 2025).

4. Linear Complementary Duality and Hull Structure

GRL codes support systematic construction of Euclidean and Hermitian LCD codes. A necessary and sufficient condition for a GRL code to be LCD is that $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$1 (Euclidean) or $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$2 (Hermitian) is nonsingular.

Key LCD results:

• If $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$3, a $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$4 GRL code (with suitable structure) is Euclidean-LCD.
• For Hermitian-LCD codes, with evaluation points forming cosets in the multiplicative group and suitable $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$5, upper bounds for the hull dimension are established and shown to be tight (Liang et al., 17 Mar 2026).

An upper bound $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$6 (similarly $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$7) holds in various parameter regimes, enabling controlled construction of small-hull codes.

5. Non-Equivalence to Generalized Reed–Solomon Codes

A fundamental property of generalized Roth–Lempel codes is that, for $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$8, they are not monomially equivalent to any generalized Reed–Solomon code. The lower-right $\boldsymbol{v} = (v_1, \dots, v_n) \in (\F_q^*)^n$9 columns of any presumed systematic GRS generator matrix must satisfy Cauchy-matrix relations, but in GRL these columns arise from polynomials of degree $A \in GL_l(\F_q)$0 and cannot satisfy the necessary vanishing conditions. This non-GRS property is provable via explicit row operations and analysis of the systematic form (Liang et al., 17 Mar 2026).

6. Applications: Quantum Codes, NMDS Codes, and Beyond

GRL codes are pivotal in constructing entanglement-assisted quantum error-correcting codes (EAQECCs), where the hull dimension determines the amount of required entanglement. For an $A \in GL_l(\F_q)$1 code $A \in GL_l(\F_q)$2 with Euclidean-hull dimension $A \in GL_l(\F_q)$3, there exists an MDS EAQECC $A \in GL_l(\F_q)$4 (Liang et al., 17 Mar 2026). When working over $A \in GL_l(\F_q)$5, Hermitian-hull results yield similar quantum code parameters.

In the context of NMDS codes, GRL constructions have yielded explicit families with completely determined weight distributions:

• Class (A): $A \in GL_l(\F_q)$6 of parameters $A \in GL_l(\F_q)$7
• Class (B): $A \in GL_l(\F_q)$8 of parameters $A \in GL_l(\F_q)$9,

with duals of distance $l \times l$0 (AMDS). The MacWilliams identity relates the weight enumerators of $l \times l$1 and $l \times l$2, and all small-weight multiplicities admit closed-form expressions (Liang et al., 24 Jun 2025, Liang et al., 17 Aug 2025).

GRL codes (and their extensions EGRL) admit deterministic control over code parameters and hull size, making them significant not only for classical and quantum error correction but also in cryptographic, secret sharing, and combinatorial design applications.

7. Concrete Examples

Select explicit instances include:

Code Type	Field $l \times l$3	Parameters	Matrix $l \times l$4	Special Properties
Non-RS MDS RL	$l \times l$5	$l \times l$6	$l \times l$7	Non-RS, MDS
Non-RS AMDS Self-Dual GRL	$l \times l$8	$l \times l$9	$f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$0, $f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$1	Non-RS, self-dual, AMDS
NMDS GRL (EGRL, $f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$2, $f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$3)	$f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$4	$f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$5	Any invertible $f(x) = f_0 + f_1 x + \dots + f_{k-1} x^{k-1} \in \F_q[x]$6, nonzero	NMDS, explicit weight distribution

The examples illustrate the parameter flexibility and the feasibility of the conditions ensuring MDS, AMDS, NMDS, and self-duality (Liang et al., 4 Jun 2025, Liang et al., 17 Aug 2025, Liang et al., 24 Jun 2025).

---

Generalized Roth–Lempel codes constitute a robust platform for constructing explicit, algebraically rich families of linear codes beyond the GRS paradigm, with broad impact on classical and quantum coding theory, combinatorial mathematics, and cryptography.