Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Global classical solutions for a class of reaction-diffusion system with density-suppressed motility

  • Received: 05 August 2021 Revised: 08 December 2021 Accepted: 11 December 2021 Published: 04 March 2022
  • This paper is concerned with a class of reaction-diffusion system with density-suppressed motility

    {ut=Δ(γ(v)u)+αuF(w),xΩ,t>0,vt=DΔv+uv,xΩ,t>0,wt=ΔwuF(w),xΩ,t>0,

    under homogeneous Neumann boundary conditions in a smooth bounded domain ΩRn(n2), where α>0 and D>0 are constants. The random motility function γ satisfies

    γC3((0,+)), γ>0, γ<0 on (0,+)  and  limv+γ(v)=0.

    The intake rate function F satisfies FC1([0,+)),F(0)=0 and F>0 on (0,+). We show that the above system admits a unique global classical solution for all non-negative initial data u0W1,(Ω),v0W1,(Ω),w0W1,(Ω). Moreover, if there exist k>0 and ¯v>0 such that

    infv>¯vvkγ(v)>0,

    then the global solution is bounded uniformly in time.

    Citation: Wenbin Lyu, Zhi-An Wang. Global classical solutions for a class of reaction-diffusion system with density-suppressed motility[J]. Electronic Research Archive, 2022, 30(3): 995-1015. doi: 10.3934/era.2022052

    Related Papers:

    [1] Wei Qi . The polycyclic codes over the finite field Fq. AIMS Mathematics, 2024, 9(11): 29707-29717. doi: 10.3934/math.20241439
    [2] Turki Alsuraiheed, Elif Segah Oztas, Shakir Ali, Merve Bulut Yilgor . Reversible codes and applications to DNA codes over F42t[u]/(u21). AIMS Mathematics, 2023, 8(11): 27762-27774. doi: 10.3934/math.20231421
    [3] Ismail Aydogdu . On double cyclic codes over Z2+uZ2. AIMS Mathematics, 2024, 9(5): 11076-11091. doi: 10.3934/math.2024543
    [4] Ted Hurley . Ultimate linear block and convolutional codes. AIMS Mathematics, 2025, 10(4): 8398-8421. doi: 10.3934/math.2025387
    [5] Chaofeng Guan, Ruihu Li, Hao Song, Liangdong Lu, Husheng Li . Ternary quantum codes constructed from extremal self-dual codes and self-orthogonal codes. AIMS Mathematics, 2022, 7(4): 6516-6534. doi: 10.3934/math.2022363
    [6] Adel Alahmadi, Tamador Alihia, Patrick Solé . The build up construction for codes over a non-commutative non-unitary ring of order 9. AIMS Mathematics, 2024, 9(7): 18278-18307. doi: 10.3934/math.2024892
    [7] Hatoon Shoaib . Double circulant complementary dual codes over F4. AIMS Mathematics, 2023, 8(9): 21636-21643. doi: 10.3934/math.20231103
    [8] Adel Alahmadi, Altaf Alshuhail, Patrick Solé . The mass formula for self-orthogonal and self-dual codes over a non-unitary commutative ring. AIMS Mathematics, 2023, 8(10): 24367-24378. doi: 10.3934/math.20231242
    [9] Xuesong Si, Chuanze Niu . On skew cyclic codes over M2(F2). AIMS Mathematics, 2023, 8(10): 24434-24445. doi: 10.3934/math.20231246
    [10] Yuezhen Ren, Ruihu Li, Guanmin Guo . New entanglement-assisted quantum codes constructed from Hermitian LCD codes. AIMS Mathematics, 2023, 8(12): 30875-30881. doi: 10.3934/math.20231578
  • This paper is concerned with a class of reaction-diffusion system with density-suppressed motility

    {ut=Δ(γ(v)u)+αuF(w),xΩ,t>0,vt=DΔv+uv,xΩ,t>0,wt=ΔwuF(w),xΩ,t>0,

    under homogeneous Neumann boundary conditions in a smooth bounded domain ΩRn(n2), where α>0 and D>0 are constants. The random motility function γ satisfies

    γC3((0,+)), γ>0, γ<0 on (0,+)  and  limv+γ(v)=0.

    The intake rate function F satisfies FC1([0,+)),F(0)=0 and F>0 on (0,+). We show that the above system admits a unique global classical solution for all non-negative initial data u0W1,(Ω),v0W1,(Ω),w0W1,(Ω). Moreover, if there exist k>0 and ¯v>0 such that

    infv>¯vvkγ(v)>0,

    then the global solution is bounded uniformly in time.



    Massey [1] introduced reversible codes that are known to exhibit useful properties in certain retrieval systems and data storage. Moreover, some reversible codes have been proven to possess excellent solid burst error correction capability and high transmission efficiency [2,3]. It has also recently been observed that reversible codes have broad applications in various areas of mathematics, including cryptography [4,5], and the theory of DNA codes [6,7,8].

    Interestingly, the class of reversible codes is closely connected to that of BCH codes because it is an important subclass of BCH codes. It is also closely related to the class of linear complementary dual codes (LCD codes, in short) introduced by Massey in [9]. In fact, Yang and Massey proved that a cyclic code is a reversible code if and only if it is an LCD code [10]. This interconnection between reversible codes, BCH codes, and LCD codes adds to their importance and potential applications in various domains.

    The Rosenbloom-Tsfasman metric, also known as the RT-metric, was first introduced by Rosenbloom and Tsfasman [11] in the field of coding theory. It was later introduced into the theory of uniform distributions by Skriganov [12] and Martin and Stinson [13]. RT-metric is a generalization of the classical Hamming metric, and it has immediately attracted the attention of many coding theorists, resulting in extensive research on codes equipped with this metric. The majority of research on codes in this metric focuses on various bounds [14], linearity [15,16,17], weight distribution and MacWilliam's identities [18,19,20,21], groups of automorphisms [22], maximum distance separability [23], burst error enumeration [24,25,26], normality [27], covering properties [28], construction of self-dual codes [29], and existence of LCD codes [30] over various algebraic structures.

    In the context of coding theory [11] and its corresponding notion in uniform distributions [12], the goal is to construct an RT-metric code with codewords that are maximally distant from each other, aiming for the smallest RT-distance between any two codewords to be as large as possible. Additionally, there is a desire for the RT-metric code to be as large as possible, akin to codes in the classical Hamming metric. However, these two objectives often conflict. Therefore, the aim is to achieve the maximum number of codewords with the greatest possible minimum distance or the largest minimum distance for a given number of codewords. Codes meeting these criteria are termed maximum distance separable (MDS) codes. Rosenbloom and Tsfasman [11] initially defined MDS codes over Fq with the ρ-metric in relation to potential information theoretic applications. Furthering their theory, Skriganov [12] related these codes to uniform distributions. An [n,k,dρ]q code in the RT-metric that attains the Singleton bound is considered an MDS code, meaning dρ=nk+1. Marka and Selvaraj [31] demonstrated that optimal codes in Fnq are MDS, and vice versa.

    As a result of this intriguing distinction of MDS codes in the RT metric, there arises a significant need for comprehensive study of MDS codes in this metric, such as the existence of MDS reversible codes. This paper aims to address this specific problem by investigating the presence of MDS reversible codes and subsequently exploring their properties if they are found to exist.

    Let u=(u1,u2,,un) and v=(v1,v2,,vn) be any two vectors in Fnq. The ρ-distance or RT-distance between them is denoted by dρ(u,v), defined as dρ(u,v)=max{i|uivi,1in}. A q-ary RT-metric code of length n refers to a subset of the space Fnq equipped with this metric. If this subset is a subspace, it is referred to as a linear RT-metric code. A generator matrix G of a k-dimensional linear code C in Fnq is a k×n matrix such that its rows form a basis for C. The coordinates of any set of k linearly independent columns of G represent the information set for code C.

    To derive MacWilliam's type relations for codes in the RT-metric, an essential inner product was introduced in [19] on the matrix space Matm×s(Fq). This particular inner product holds great importance in the investigation of codes in the RT-metric, as it influences various intriguing results. For instance, it indicates that the dual of an MDS code, under this specific inner product will also be an MDS code, which represents one of the noteworthy results in this context.

    For α=(α1,α2,...,αn),β=(β1,β2,...,βn)Fnq, the inner product of α and β is given by

    α,β=β,α=ni=1αiβni+1.

    Then, the dual C of the code C can be defined as

    C={αFnq|α,β=0forallβC}.

    An RT-metric code C is categorized based on certain properties. If C is contained within its dual code C, it is referred to as self-orthogonal. A self-dual code, on the other hand, satisfies the condition C=C. In contrast, for a code to be LCD, there are no non-zero codewords in common between C and its dual C. C is termed reversible if for every codeword c=(v1,v2,,vn) in C, its reverse Flip(c)=(vn,vn1,,v2,v1) is also an element of C and c is self-reversible if c=Flip(c).

    Let P=(pij)m×n be a matrix of size m×n. Then, we use the following notation (see Table 1) throughout this study.

    Table 1.  Notations and abbreviations.
    In the identity matrix of degree n
    Rn a matrix (rij)n×n, where rij=1, if i+j=n+1 and rij=0 otherwise
    PT the transpose of a matrix P, given by PT=(pji)n×m
    Flip(P) the column-reversed matrix of a matrix P, given by Flip(P)=(pi,nj+1)m×n
    RmP the row-reversed matrix of a rectangle matrix P
    PS the flip-diagonal transpose of a matrix P, which transposes the flip of P across its diagonal, i.e., PS=(pmi+1,nj+1)m×n
    Pk k×k square matrix
    RMDS reversible MDS
    SR self-dual reversible
    SRMDS self-dual reversible MDS
    x it rounds x up to the nearest integer

     | Show Table
    DownLoad: CSV

    Let P and Q be square matrices of order n. If PPT=In=PTP, then P is called orthogonal. If P=PT, then P is called symmetric. P is called centrosymmetric if P=PS. Furthermore, the following properties are straightforward:

    Rn=Flip(In);

    RTn=RSn=Rn;

    R2n=In;

    PS=RnPRn;

    (PT)S=(PS)T;

    (PS)S=P;

    (P+Q)S=PS+QS;

    (PQ)S=QSPS;

    Flip(P)=PRn.

    Lemma 3.1. If C is a reversible code of length n with dimension k over Fq with generator matrix G, then GS is also a generator matrix of C.

    Proof. Consider C as a reversible code with generator matrix G. Since C is reversible, Flip(G) is also a generator matrix of C. If Rk is non-singular, then GS = RkFlip(G) is also a generator matrix of C. Thus, the lemma holds true.

    Theorem 3.1. Let C be a linear code of even length n over Fq, with a generator matrix in the form G=[A|AS]. Then, C is reversible.

    Proof.

    G=[A|AS]isageneratormatrixofCFlip(G)=[Flip(AS)|Flip(A)]RkFlip(G)=Rk[Flip(AS)|Flip(A)]GS=[(AS)S|AS]GS=[A|AS]GS=G.

    Suppose C is not reversible. Then, Flip(G) cannot be a generator matrix of C. However, as Rk is non-singular, it implies that GS=RkFlip(G) is also not a generator matrix of C, leading to a contradiction. Therefore, C must be reversible.

    Theorem 3.2. Let C be a linear code of odd length n over Fq, with a generator matrix G in the form G=[A|y|AS], where y is a column vector such that y=yS. Then, C is reversible.

    Proof. The proof is similar to that of Theorem 3.1.

    Theorem 3.3. Let C be a reversible code of length n with dimension k over Fnq. Then:

    (i) If C has an odd length n, then we can express a generator matrix of C in the form G=[A|y|AS], where y is a column vector such that y=yS if and only if the total number of self-reversible codewords in code C is qk2.

    (ii) If C has an even length n, then we can represent a generator matrix of C in the form G=[A|AS] if and only if the total number of self-reversible codewords in C is qk2.

    Proof. Let C be a reversible code of length n with dimension k over Fnq.

    (ⅰ) Let us assume that G=[A|y|AS] represents a generator matrix for a reversible code C with an odd length n, where A is a matrix and y is a column vector satisfying y=yS.

    Case A: Assume k is even. Then, no self-reversible codeword exists as a row of generator matrix G=[A|y|AS]. Therefore, ri=Flip(rki+1),i{1,2,,k}, where ri is the ith row of G. Since C is reversible, ci=ri+rki+1(i=1,2,,k2) are k2 distinct self-reversible codewords. All distinct self-reversible codewords thus form a subspace of dimension k2 of C, leading to a total of qk2 self-reversible codewords.

    Case B: Assume k is odd. Then, exactly one self-reversible codeword exists as a row of generator matrix G=[A|y|AS] which is the (k+12)th row of G. Therefore, ri=Flip(rki+1),i{1,2,,k12}, where ri is the ith row of G. Since C is reversible, ci=ri+rki+1(i=1,2,,k12) and the (k+12)th row vectors as self-reversible codewords in G are k+12 distinct self-reversible codewords. Therefore, all distinct self-reversible codewords form a subspace of dimension k+12 of C, resulting in a total of qk+12 self-reversible codewords.

    From Cases A and B, we can conclude that the total number of self-reversible codewords in code C is qk2.

    Conversely, assume that the total number of self-reversible codewords in code C is qk2.

    Case A: Suppose k is even, and the total number of self-reversible codewords in C is qk2. Let U={u1,u2,,uk2} be a linearly independent subset of all self-reversible codewords in C. This subset forms a subspace with dimension k2 of C. Since C is reversible, every self-reversible codeword of subspace U can be written as ui=vi+Flip(vi)(i=1,2,,k2). Then, the sets Wi=<vi,Flip(vi)>, for i=1,2,,k2, span distinct subspaces of dimension 2 of C. For each j, WjijWi={0}, for i,j=1,2,,k2. Thus, B=k2i=1Wi, it contains k linearly independent codewords, and the direct sum of Wi's forms the basis of C, i.e., B=W1W2Wk2 is a basis of C.

    Case B: Suppose k is odd and the total number of self-reversible codewords in C is qk+12. Let t be one of the self-reversible codewords in C. Therefore, the subset t forms a subspace of dimension 1 of C. Let U={u1,u2,,uk12} be a linearly independent subset of all self-reversible codewords in C and it is disjoint from the subspace t in C. This subset forms a subspace with dimension k12 of C. Since C is reversible, every self-reversible codeword of subspace U can be written as ui=vi+Flip(vi)(i=1,2,,k12). Then, the sets Wi=<vi,Flip(vi)>,fori=1,2,,k12, span distinct subspaces of dimension 2 of C. For each j, WjijWi={0}, for i,j=1,2,,k12. Thus, B=k12i=1Wi, it contains k1 linearly independent codewords, and the direct sum of Wi's and t forms a basis of C, i.e., B=W1W2Wk12t is a basis of C.

    (ⅱ) The proof is similar to that for 3.3(i).

    Example 3.1. Consider a [7,3,4] reversible code C over GF(3) whose generator matrix is given by

    G=[121011200010002110121].

    The total number of self-reversible codewords in C is qk2=9 as the generators are (0,0,0,1,0,0,0) and (0,0,1,0,1,0,0). It is also to be observed that the generator matrix G above is in the form [A|y|AS]. This example follows from Theorem 3.3(i).

    Example 3.2. Consider a [6,4,2] reversible code C over GF(2) whose generator matrix is given by

    G=[110000101010010101000011].

    The total number of self-reversible codewords in C is qk2=4. It is also to be observed that the generator matrix G above is in the form G=[A|AS]. This example follows from Theorem 3.3(ii).

    Remark 3.1. Some of the reversible codes with a generator matrix G cannot be represented in the form G=[A|y|AS] or G=[A|AS], because the total number of self-reversible codewords in C is not equal to qk2. This can be seen from the following examples (Examples 3.3 and 3.4).

    Example 3.3. The matrix G given by

    G=[10000000001001000100001000000001]

    is a generator matrix for an [8,4,1] binary reversible code C in the RT-metric. However, this generator matrix G cannot be written in the form of [A|AS] for any matrix A. It is also to be noted that the total number of self-reversible codewords in C is 8, which is not equal to qk2=4.

    Example 3.4. The matrix G given by

    G=[101000102000101]

    is a generator matrix for a [5,3,3] ternary reversible code C in the RT-metric. However, this generator matrix G cannot be written in the form of G=[A|y|AS] for any matrix A. It is also to be noted that the total number of self-reversible codewords in C is 3, which is not equal to qk2=9.

    Theorem 3.4. Let C be a self-reversible code of length n with dimension k over Fnq. Then:

    (i) If C has an odd length n, then we can find a generator matrix of C in the form G=[A|y|Flip(A)], where y is a column vector, if and only if the total number of self-reversible codewords in C is qk.

    (ii) If C has an even length n, then we can find a generator matrix of C in the form G=[A|Flip(A)] if and only if the total number of self-reversible codewords in C is qk.

    Proof. The proof of this theorem is similar to the proof of Theorem 3.3.

    Theorem 3.5. Let C be an [n,k,d]q reversible code with the total number of self-reversible codewords qk2. Then, the dual C of C is an [n,nk,d]q reversible code, with the total number of self-reversible codewords qnk2.

    Proof. The proof of Theorem 3.5 is straightforward, relying on notations and basic algebraic manipulations.

    Theorem 4.1. Let C be a code of length n with dimension k (where kn2) in the RT-metric, whose generator matrix is in the form G=[Ak|Y|ASk], where Y is a k×(n2k) matrix. Then, C is MDS if and only if Ak is non-singular.

    Proof. Suppose that C is a code of length n with dimension k (where kn2) in the RT-metric, whose generator matrix is in the form G=[Ak|Y|ASk], where Y is a k×(n2k) matrix. Let C be an MDS code. Assume in contrary that Ak is singular. Then, ASk is also singular. Consequently, there exist at least two codewords x and z in C with the last k positions being the same, i.e., x=(x1,x2,,xnk,xnk+1,,xn) and z=(z1,z2,,znk,xnk+1,,xn). According to [31], "an (n,K,dρ)q code is MDS if and only if its partition number is ndρ+1." Thus, none of the two codewords have the same (ndρ+1)-tuple as their last ndρ+1 coordinates, which leads to a contradiction. Hence, Ak is non-singular.

    Conversely, assume that Ak is non-singular. Then, (ASk)1 is also non-singular. Thus, (ASk)1G is a generator matrix of C in the following form: (ASk)1G=[(ASk)1Ak|(ASk)1Y|(ASk)1ASk]=[(ASk)1Ak|(ASk)1Y|Ik]. Hence, C is an MDS.

    The following examples (Examples 5 and 6) illustrate Theorem 4.1.

    Example 4.1. Consider a [10,4,7] linear code C over GF(2) whose generator matrix is given by

    G=[1000100011001000101001010101001100110001].

    Here, d1=7, d2=8, d3=9, and d4=10. It is also to be observed that the generator matrix G above is in the form [Ak|Y|ASk] and that Ak is invertible.

    Example 4.2. Consider a [6,3,4] reversible code C over GF(3) whose generator matrix is given by

    G=[121122002200221121].

    Here, d1=4, d2=5, and d3=6. It is also to be observed that the generator matrix G above is in the form G=[Ak|ASk] and that Ak is invertible.

    Corollary 4.1. Let C be a code of length n with dimension k (where kn2) in the RT-metric, whose generator matrix is in the form G=[Ak|Y|ASk], where Y is a k×(n2k) matrix. Then, C is RMDS if and only if Ak is non-singular and Y is centrosymmetric.

    Proof. If we assume that C is RMDS in the RT-metric, from Theorem 4.1, Ak is non-singular. It is sufficient to prove that Y is centrosymmetric. As C is reversible, from Lemma 1, GS is also a generator matrix of C. Note that the rows of GS=[Ak|YS|ASk] and those of G=[Ak|Y|ASk] generate the same code C. This implies that Y=YS or Y is centrosymmetric.

    Conversely, assume that Ak is non-singular and Y is centrosymmetric. G=[Ak|Y|ASk] is a generator matrix of C, and (ASk)1G=[(ASk)1Ak|(ASk)1Y|(ASk)1ASk] is a generator matrix of C. This implies that G=[Bk|Y1|Ik] is a generator matrix of C, where Bk=(ASk)1Ak and Y1=(ASk)1Y. It is sufficient to prove that C is reversible, that is, to prove Y1=BkYS1 and (Flip(Bk))2=BkBSk=BSkBk=Ik. In [32], Theorem 3 states that the linear code C is RMDS code in the RT-metric if and only if Y1=BkYS1 and (Flip(Bk))2=BkBSk=BSkBk=Ik. Thus, Bk=(ASk)1AkandBSk=A1kR1kAkRk.

    ConsiderY1=(ASk)1YS(Yiscentrosymmetric)=(ASk)1(AkA1k)(RkFlip(Y))=((ASk)1Ak)(RkR1kA1k)(RkFlip(Y))=(Bk)Rk(RkAkRk)1(Flip(Y))(Bk=(ASk)1Ak)=(Bk)(Rk(ASk)1(Flip(Y)))=BkYS1(Y1=(ASk)1Y).
    Consider(Flip(Bk))2=BkBSk=((ASk)1Ak)(A1kR1kAkRk)=(RkAkRk)1(RkAkRk)=Ik.

    The following example (Example 4.3) illustrates Corollary 4.1.

    Example 4.3. Consider an [11,4,8] reversible code C over GF(2) whose generator matrix is given by

    G=[11100101000010001100111100110001000010100111].

    Here, d1=8, d2=9, d3=10, and d4=11. It is also to be observed that the generator matrix G above is in the form [Ak|Y|ASk]. Thus, Ak is invertible and Y is centrosymmetric.

    Theorem 4.2. Let C be a code of even length n with dimension k (n>k>n/2) in the RT-metric, where its generator matrix is in the form G=[A|AS], with Ak representing the first k×k square matrix of G. Then, the C is RMDS if and only if Ak is non-singular.

    Proof. The proof is similar to the proof of Theorem 4.1. The following example (Example 4.4) illustrates Theorem 4.2.

    Example 4.4. Consider a [6,4,3] reversible code C over GF(2) whose generator matrix is given by

    G=[100011001010010100110001].

    Here, d1=3, d2=4, d3=5, and d4=6. It is also to be observed that the generator matrix G above is in the form G=[A|AS] and that Ak is invertible.

    Theorem 4.3. Let C be a code of odd length n, with dimension k where n>k>n2, in the RT-metric. Its generator matrix is in the form G=[A|y|AS], where Ak represents the first k×k square matrix of G. Then, the C is RMDS if and only if Ak is non-singular and y is a column centrosymmetric vector.

    Proof. The proof is similar to the proof of Corollary 1. The following example (Example 4.5) illustrates Theorem 4.3.

    Example 4.5. Consider a [3,2,2] reversible code C over GF(5) whose generator matrix is given by

    G=[340043].

    Here, d1=2 and d2=3. It is also to be observed that the generator matrix G above is in the form G=[A|y|AS] and that Ak is invertible.

    Theorem 4.4. Every self-reversible [n=2k,k,dρ] code C in the RT-metric is MDS.

    Proof. Let C be any self-reversible [n=2k,k,dρ]q code with even length n=2k. Then, by using Definition 3 in [27], there exists a partition number l=k such that C is of type (k+1,k+2,2k). Hence, C is MDS. The following example (Example 4.6) illustrates Theorem 4.4.

    Example 4.6. Consider a [6,3,4] reversible code C over GF(2) whose generator matrix is given by

    G=[001100010010100001].

    Here, d1=4, d2=5, and d3=6. It is also to be observed that the generator matrix G above is in the form G=[Ak|Flip(Ak)] and that Ak is invertible.

    Theorem 4.5. Every self-reversible [n=2k1,k,dρ] code C with odd length n=2k1 in the RT-metric is MDS.

    Proof. The proof of this theorem is similar to the proof of Theorem 4.4. The following example (Example 4.7) illustrates Theorem 4.5.

    Example 4.7. Consider a [5,3,3] reversible code C over GF(3) whose generator matrix is given by

    G=[002000101020002].

    Here, d1=4, d2=5, and d3=6. It is also to be observed that the generator matrix G above is in the form G=[A|Flip(A)] and that Ak is invertible.

    Theorem 5.1. If C is an [n=2k,k,dρ] reversible code over Fq in the RT-metric with a minimum distance dρ=1, then C cannot be self-dual in the RT-metric.

    Proof. The proof of Theorem 5.1 is straightforward, relying on notations and basic algebraic manipulations.

    Remark 5.1. If C is an [n=2k,k,dρ] self-dual code over Fq in the RT-metric with a minimum distance of dρ=1, then C cannot be reversible. This can be seen from the following examples (Examples 5.1 and 5.2).

    Example 5.1. Consider a [6,3,1] linear code C over GF(2) whose generator matrix is given by

    G=[100000011000010110].

    Here, d1=1, d2=3, and d3=5. It can be observed that C is a [6,3,1] self-dual code in the RT-metric over GF(2), but it is not reversible.

    Example 5.2. Consider a [4,2,1] linear code C over GF(5) whose generator matrix is given by

    G=[40002030].

    Here, d1=1 and d2=3. It can be observed that C is a [4,2,1] self-dual code in the RT-metric over GF(5), but it is not reversible.

    Theorem 5.2. Let C be an [n=2k,k,dρ] binary reversible code in the RT-metric, with a generator matrix in the form [Ak|ASk]. Then, C is self-dual if and only if it satisfies one of the following conditions:

    (i) AkFlip(ATk)=(AkFlip(ATk))T;

    (ii) Flip(AkATk) is symmetric;

    (iii) AkATk is centrosymmetric.

    Proof. Consider:

    (i) Suppose C is self-dual [29], which implies that

    GG=0[Ak|ASk][(Flip(ASk))TFlip(Ak)T]=0Ak(Flip(ASk))T+ASk(Flip(Ak))T=0RkAkATk+AkFlip(ATk)=0RkAkATk=AkFlip(ATk)AkATkRk=(AkFlip(ATk))TAkFlip(ATk)=(AkFlip(ATk))T.

    (ii) Consider

    (AkATk)Rk=(AkFlip(ATk))TFlip(AkATk)=(AkATkRk)TFlip(AkATk)=(Flip(AkATk))TFlip(AkATk)is symmetric.

    (iii) Consider

    RkAkATk=AkFlip(ATk)RkAkATk=AkATkRkRk(AkATk)=(AkATk)Rk(AkATk)is centrosymmetric.

    Example 5.3. Consider a [6,3,3] reversible code C over GF(2) whose generator matrix is given by

    G=[101000010010000101].

    Here, d1=3, d2=5, and d3=6. It is also to be observed that the generator matrix G above is in the form G=[Ak|ASk] and that Flip(AkATk) is symmetric.

    Theorem 5.3. Let C be an [n=2k,k,dρ] non-binary reversible code in the RT-metric, with a generator matrix in the form [Ak|ASk]. Then, C is self-dual if and only if it satisfies one of the following conditions:

    (i) AkFlip(ATk)=(AkFlip(ATk))T;

    (ii) Flip(AkATk) is skew-symmetric.

    Proof. The proof of this theorem is similar to the proof of 5.2.

    Example 5.4. Consider a [4,2,3] reversible code C over GF(5) whose generator matrix is given by

    G=[40300304].

    Here, d1=3 and d2=4. It is also to be observed that the generator matrix G above is in the form G=[Ak|ASk] and that Flip(AkATk) is skew-symmetric.

    Theorem 5.4. Every binary self-reversible [n=2k,k,dρ] code C in the RT-metric is SR-MDS.

    Proof. The proof of Theorem 5.4 is straightforward, relying on notations and basic algebraic manipulations.

    Example 5.5. Consider a [4,2,3] binary self-reversible code C over GF(2) whose generator matrix is given by

    G=[10010110].

    Here, d1=3 and d2=4. It is also to be observed that the generator matrix G above is in the form G=[Ak|Flip(Ak)], and that C is self-dual.

    Theorem 6.1. Let G be a generator matrix of a self-dual code of length n. Then,

    [GOn/2,nOn/2,nFlip(G)]

    generates an SR code of length 2n in the RT-metric.

    Theorem 6.2. Let C be an [n1,k,d,R] RMDS code with a generator matrix in the form [AS|A] in the RT-metric. Then,

    [ORn2In2OASOOA]

    generates an RMDS code [2(n1+n2),n1+n2,dρ+n2,R+n2] with covering radius R+n.

    Proof. Consider

    [ORn2In2OASOOA][OFlip(A)TRn2OIn2OOFlip(AS)T]
    =[2In2OOAFlip(AT)+(AFlip(AT))T]
    =O(ifCisbinaryselfdual).

    In this study, we provided some basic properties of reversible linear codes and obtained a condition for a reversible code to be an MDS code. Furthermore, we established some necessary and sufficient conditions for a reversible code to be self-dual. Finally, some constructions of reversible codes in the RT-metric were proposed.

    Conceptualization: Bodigiri Sai Gopinadh formulated the initial research problem and developed the overarching mathematical framework. Validation: Venkatrajam Marka independently verified the correctness of the mathematical results, played a pivotal role in problem discussion, and providing continuous supervision. Both authors have read and approved the final version of the manuscript for publication.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare no conflicts of interest.



    [1] C. Liu, X. Fu, L. Liu, X. Ren, C. K. Chau, S. Li, et al., Sequential establishment of stripe patterns in an expanding cell population, Science, 334 (2011), 238–241. https://doi.org/10.1126/science.1209042 doi: 10.1126/science.1209042
    [2] X. F. Fu, L. H. Tang, C. L. Liu, J. D. Huang, T. Hwa, P. Lenz, Stripe formation in bacterial systems with density-suppressed motility, Phys. Rev. Lett., 108 (2012), 1981–1988. https://doi.org/10.1103/PhysRevLett.108.198102 doi: 10.1103/PhysRevLett.108.198102
    [3] H. Y. Jin, Z. A. Wang, Global dynamics and spatio-temporal patterns of predator-prey systems with density-dependent motion, Eur. J. Appl. Math., 32 (2021), 652–682. https://doi.org/10.1017/s0956792520000248 doi: 10.1017/s0956792520000248
    [4] P. Kareiva, G. T. Odell, Swarms of predators exhibit "preytaxis" if individual predators use area-restricted search, Am. Nat., 130 (1987), 233–270. https://doi.org/10.1086/284707 doi: 10.1086/284707
    [5] E. F. Keller, L. A. Segel, Models for chemtoaxis, J. Theor. Biol., 30 (1971), 225–234. https://doi.org/10.1016/0022-5193(71)90050-6
    [6] Z. A. Wang, On the parabolic-elliptic Keller-Segel system with signal-dependent motilities: a paradigm for global boundedness and steady states, Math. Methods Appl. Sci., 44 (2021), 10881–10898. https://doi.org/10.1002/mma.7455 doi: 10.1002/mma.7455
    [7] H. Y. Jin, Y. J. Kim, Z. A. Wang, Boundedness, stabilization, and pattern formation driven by density-suppressed motility, SIAM J. Appl. Math., 78 (2018), 1632–1657. https://doi.org/10.1137/17M1144647 doi: 10.1137/17M1144647
    [8] K. Fujie, J. Jiang, Global existence for a kinetic model of pattern formation with density-suppressed motilities, J. Differ. Equ., 269 (2020), 5338–5378. https://doi.org/10.1016/j.jde.2020.04.001 doi: 10.1016/j.jde.2020.04.001
    [9] H. Y. Jin, Z. A. Wang, The Keller-Segel system with logistic growth and signal-dependent motility, Discrete Contin. Dyn. Syst. Ser. B, 26 (2021), 3023–3041. https://doi.org/10.3934/dcdsb.2020218 doi: 10.3934/dcdsb.2020218
    [10] Z. R. Liu, J. Xu, Large time behavior of solutions for density-suppressed motility system in higher dimensions, J. Math. Anal. Appl., 475 (2019), 1596–1613. https://doi.org/10.1016/j.jmaa.2019.03.033 doi: 10.1016/j.jmaa.2019.03.033
    [11] J. P. Wang, M. X. Wang, Boundedness in the higher-dimensional Keller-Segel model with signal-dependent motility and logistic growth, J. Math. Phys., 60 (2019), 011507. https://doi.org/10.1063/1.5061738 doi: 10.1063/1.5061738
    [12] M. J. Ma, R. Peng, Z. A. Wang, Stationary and non-stationary patterns of the density-suppressed motility model, Phys. D, 402 (2020), 132259. https://doi.org/10.1016/j.physd.2019.132259 doi: 10.1016/j.physd.2019.132259
    [13] Z.A. Wang, X. Xu, Steady states and pattern formation of the density-suppressed motility model, IMA. J. Appl. Math., 86 (2021), 577–603. https://doi.org/10.1093/imamat/hxab006 doi: 10.1093/imamat/hxab006
    [14] W. B. Lv, Global existence for a class of chemotaxis-consumption systems with signal-dependent motility and generalized logistic source, Nonlinear Anal. Real World Appl., 56 (2020), 103160. https://doi.org/10.1016/j.nonrwa.2020.103160 doi: 10.1016/j.nonrwa.2020.103160
    [15] W. B. Lv, Q. Wang, A chemotaxis system with signal-dependent motility, indirect signal production and generalized logistic source: Global existence and asymptotic stabilization, J. Math. Anal. Appl., 488 (2020), 124108. https://doi.org/10.1016/j.jmaa.2020.124108 doi: 10.1016/j.jmaa.2020.124108
    [16] W. B. Lv, Q. Y. Wang, Global existence for a class of chemotaxis systems with signal-dependent motility, indirect signal production and generalized logistic source, Z. Angew. Math. Phys., 71 (2020), 53. https://doi.org/10.1007/s00033-020-1276-y doi: 10.1007/s00033-020-1276-y
    [17] W. B. Lv, Q. Y. Wang, An n-dimensional chemotaxis system with signal-dependent motility and generalized logistic source: global existence and asymptotic stabilization, Proc. Roy. Soc. Edinburgh Sect. A, 151 (2021), 821–841. https://doi.org/10.1017/prm.2020.38 doi: 10.1017/prm.2020.38
    [18] J. Ahn, C. W. Yoon, Global well-posedness and stability of constant equilibria in parabolic-elliptic chemotaxis systems without gradient sensing, Nonlinearity, 32 (2019), 1327–1351. https://doi.org/10.1088/1361-6544/aaf513 doi: 10.1088/1361-6544/aaf513
    [19] L. Desvillettes, Y. J. Kim, A. Trescases, C. W. Yoon, A logarithmic chemotaxis model featuring global existence and aggregation, Nonlinear Anal. Real World Appl., 50 (2019), 562–582. https://doi.org/10.1016/j.nonrwa.2019.05.010 doi: 10.1016/j.nonrwa.2019.05.010
    [20] C. Yoon, Y. J. Kim, Global existence and aggregation in a Keller-Segel model with Fokker-Planck diffusion, Acta Appl. Math., 149 (2017), 101–123. https://doi.org/10.1007/s10440-016-0089-7 doi: 10.1007/s10440-016-0089-7
    [21] H. Y. Jin, Z. A. Wang, Critical mass on the Keller-Segel system with signal-dependent motility, Proc. Amer. Math. Soc., 148 (2020), 4855–4873. https://doi.org/10.1090/proc/15124 doi: 10.1090/proc/15124
    [22] K. Fujie, J. Jiang, Comparison methods for a Keller–Segel-type model of pattern formations with density-suppressed motilities, Calc. Var. Partial Differ. Equ., 60 (2021), 92. https://doi.org/10.1007/s00526-021-01943-5 doi: 10.1007/s00526-021-01943-5
    [23] M. Burger, P. Lanrençot, A. Trescases, Delayed blow-up for chemotaxis models with local sensing, J. Lond. Math. Soc., 103 (2021), 1596–1617. https://doi.org/10.1112/jlms.12420 doi: 10.1112/jlms.12420
    [24] J. Smith-Roberge, D. Iron, T. Kolokolnikov, Pattern formation in bacterial colonies with density-dependent diffusion, Eur. J. Appl. Math., 30 (2019), 196–218. https://doi.org/10.1017/S0956792518000013 doi: 10.1017/S0956792518000013
    [25] R. Lui, H. Ninomiya, Traveling wave solutions for a bacteria system with density-suppressed motility, Discrete. Cont. Dyn. Syst.-B, 24 (2018), 931–940. https://doi.org/10.3934/dcdsb.2018213 doi: 10.3934/dcdsb.2018213
    [26] J. Li, Z. A. Wang, Traveling wave solutions to the density-suppressed motility model, J. Differ. Equ., 301 (2021), 1–36. https://doi.org/10.1016/j.jde.2021.07.038 doi: 10.1016/j.jde.2021.07.038
    [27] H. Y. Jin, S. J. Shi, Z. A. Wang, Boundedness and asymptotics of a reaction-diffusion system with density-dependent motility, J. Differ. Equ., 269 (2020), 6758–6793. https://doi.org/10.1016/j.jde.2020.05.018 doi: 10.1016/j.jde.2020.05.018
    [28] K. Fujie, Boundedness in a fully parabolic chemotaxis system with singular sensitivity, J. Math. Anal. Appl., 424 (2015), 675–684. https://doi.org/10.1016/j.jmaa.2014.11.045 doi: 10.1016/j.jmaa.2014.11.045
    [29] H. Amann, Nonhomogeneous linear and quasilinear elliptic and parabolic boundary value problems, Teubner, Stuttgart, 1993. https://doi.org/10.1007/978-3-663-11336-2_1
    [30] C. Stinner, C. Surulescu, M. Winkler, Global weak solutions in a PDE-ODE system modeling multiscale cancer cell invasion, SIAM J. Math. Anal., 46 (2014), 1969–2007. https://doi.org/10.1137/13094058X doi: 10.1137/13094058X
    [31] R. Temam, Infinite-dimensional dynamical systems in mechanics and physics, Springer-Verlag, New York, 1988. https://doi.org/10.1007/978-1-4612-0645-3
    [32] R. Kowalczyk, Z. Szymańska, On the global existence of solutions to an aggregation model, J. Math. Anal. Appl., 343 (2008), 379–398. https://doi.org/10.1016/j.jmaa.2008.01.005 doi: 10.1016/j.jmaa.2008.01.005
    [33] H. Brézis, W. A. Strauss, Semi-linear second-order elliptic equations in L1, J. Math. Soc. Japan, 25 (1973), 565–590. https://doi.org/10.2969/jmsj/02540565 doi: 10.2969/jmsj/02540565
    [34] Y. Lou, M. Winkler, Global existence and uniform boundedness of smooth solutions to a cross-diffusion system with equal diffusion rates, Comm. Partial Differ. Equ., 40 (2015), 1905–1941. https://doi.org/10.1080/03605302.2015.1052882 doi: 10.1080/03605302.2015.1052882
    [35] Y. S. Tao, M. Winkler, Effects of signal-dependent motilities in a Keller-Segel-type reaction-diffusion system, Math. Models Methods Appl. Sci., 27 (2017), 1645–1683. https://doi.org/10.1142/S0218202517500282 doi: 10.1142/S0218202517500282
    [36] M. Schechter, Self-adjoint realizations in another Hilbert space, Amer. J. Math., 106 (1984), 43–65. https://doi.org/10.2307/2374429 doi: 10.2307/2374429
    [37] N. D. Alikakos, Lp bounds of solutions of reaction-diffusion equations, Comm. Partial Differ. Equ., 4 (1979), 827–868. https://doi.org/10.1080/03605307908820113 doi: 10.1080/03605307908820113
    [38] Y. S. Tao, Z. A. Wang, Competing effects of attraction vs. repulsion in chemotaxis, Math. Models Methods Appl. Sci., 23 (2013), 1–36. https://doi.org/10.1142/S0218202512500443 doi: 10.1142/S0218202512500443
  • This article has been cited by:

    1. Bodigiri Sai Gopinadh, Venkatrajam Marka, Reversible codes in the Rosenbloom-Tsfasman metric, 2024, 9, 2473-6988, 22927, 10.3934/math.20241115
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2946) PDF downloads(244) Cited by(42)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog