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

Modeling the hourly consumption of electricity during period of power crisis

  • Received: 08 May 2023 Revised: 10 July 2023 Accepted: 19 July 2023 Published: 27 July 2023
  • In this paper, we capture the dynamic behavior of hourly consumption of electricity during the period of power crisis ("dumsor'' period) in Ghana using two-state Markov switching autoregressive (MS-AR) and autoregressive (AR) models. Hourly data between the periods of January 1, 2014 and December 31, 2014 was obtained from the Ghana Grid company and used for the study. Using different information criteria, the MS(2)-AR(4) is selected as the optimal model to describe the dynamic behavior of electricity consumption during periods of power crisis in Ghana. The parameters of the MS(2)-AR(4) model are then estimated using the expectation-maximization algorithm. From the results, the likelihood of staying under a low electricity consumption regime is estimated to be 87%. The expected duration for a low electricity consumption regime is 7.8 hours, and the high electricity consumption regime is expected to last 2.3 hours before switching to the low demand regime. The proposed model is robust as compared to the autoregressive model because it effectively captures the dynamics of electricity demand over time through the peaks and significant fluctuations in consumption patterns. Similarly, the model can identify distinct regime changes linked to electricity consumption during periods of power crises.

    Citation: Samuel Asante Gyamerah, Henry Ofoe Agbi-Kaiser, Keziah Ewura Adjoa Amankwah, Patience Anipa, Bright Arafat Bello. Modeling the hourly consumption of electricity during period of power crisis[J]. Clean Technologies and Recycling, 2023, 3(3): 148-165. doi: 10.3934/ctr.2023010

    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
  • In this paper, we capture the dynamic behavior of hourly consumption of electricity during the period of power crisis ("dumsor'' period) in Ghana using two-state Markov switching autoregressive (MS-AR) and autoregressive (AR) models. Hourly data between the periods of January 1, 2014 and December 31, 2014 was obtained from the Ghana Grid company and used for the study. Using different information criteria, the MS(2)-AR(4) is selected as the optimal model to describe the dynamic behavior of electricity consumption during periods of power crisis in Ghana. The parameters of the MS(2)-AR(4) model are then estimated using the expectation-maximization algorithm. From the results, the likelihood of staying under a low electricity consumption regime is estimated to be 87%. The expected duration for a low electricity consumption regime is 7.8 hours, and the high electricity consumption regime is expected to last 2.3 hours before switching to the low demand regime. The proposed model is robust as compared to the autoregressive model because it effectively captures the dynamics of electricity demand over time through the peaks and significant fluctuations in consumption patterns. Similarly, the model can identify distinct regime changes linked to electricity consumption during periods of power crises.



    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] Kumi EN (2017) The Electricity Situation in Ghana: Challenges and Opportunities, Washington DC: Center for Global Development.
    [2] Adeoye O, Spataru C (2019) Modelling and forecasting hourly electricity demand in west African countries. Appl Energ 242: 311–333. https://doi.org/10.1016/j.apenergy.2019.03.057 doi: 10.1016/j.apenergy.2019.03.057
    [3] Energy Commission, Energy Outlook for Ghana 2021. Energy Commission, 2021. Available from: http://www.energycom.gov.gh/planning/data-center/energy-outlook-for-ghana.
    [4] Eshun ME, Amoako-Tuffour J (2016) A review of the trends in Ghana's power sector. Energy Sustain Soc 6: 1–9. https://doi.org/10.1186/s13705-016-0075-y doi: 10.1186/s13705-016-0075-y
    [5] Gabreyohannes E (2010) A nonlinear approach to modelling the residential electricity consumption in Ethiopia. Energy Econ 32: 515–523. https://doi.org/10.1016/j.eneco.2009.08.008 doi: 10.1016/j.eneco.2009.08.008
    [6] Nwulu NI, Agboola OP (2012) Modelling and predicting electricity consumption using artificial neural networks. 2012 11th International Conference on Environment and Electrical Engineering, IEEE, 1059–1063. https://doi.org/10.1109/EEEIC.2012.6221536
    [7] Pielow A, Sioshansi R, Roberts MC (2012) Modeling short-run electricity demand with long-term growth rates and consumer price elasticity in commercial and industrial sectors. Energy 46: 533–540. https://doi.org/10.1016/j.energy.2012.07.059 doi: 10.1016/j.energy.2012.07.059
    [8] Nafidi A, Gutiérrez R, Gutiérrez-Sánchez R, et al. (2016) Modelling and predicting electricity consumption in spain using the stochastic gamma diffusion process with exogenous factors. Energy 113: 309–318. https://doi.org/10.1016/j.energy.2016.07.002 doi: 10.1016/j.energy.2016.07.002
    [9] Palacios-Garcia E, Moreno-Munoz A, Santiago I, et al. (2018) A stochastic modelling and simulation approach to heating and cooling electricity consumption in the residential sector. Energy 144: 1080–1091. https://doi.org/10.1016/j.energy.2017.12.082 doi: 10.1016/j.energy.2017.12.082
    [10] Dalkani H, Mojarad M, Arfaeinia H (2021) Modelling electricity consumption forecasting using the markov process and hybrid features selection. Int J Intell Syst Appl 13: 14–23. https://doi.org/10.5815/ijisa.2021.05.02 doi: 10.5815/ijisa.2021.05.02
    [11] Pérez-Montalvo E, Zapata-Velásquez ME, Benitez-Vazquez LM, et al. (2022) Model of monthly electricity consumption of healthcare buildings based on climatological variables using PCA and linear regression. Energy Rep 8: 250–258. https://doi.org/10.1016/j.egyr.2022.06.117 doi: 10.1016/j.egyr.2022.06.117
    [12] Hamilton JD (1989) MPCE: a maximum probability based cross entropy loss function for neural network classification. Econometrica 57: 357–384.
    [13] Bierbrauer M, Trück S, Weron R, et al. (2004) Modeling electricity prices with regime switching models. Computational Science-ICCS 2004: 4th International Conference, Kraków, Poland, 859–867. https://doi.org/10.1007/978-3-540-25944-2_111 doi: 10.1007/978-3-540-25944-2_111
    [14] Adom PK, Bekoe W (2013) Modelling electricity demand in ghana revisited: The role of policy regime changes. Energy Policy 61: 42–50. https://doi.org/10.1016/j.enpol.2013.05.113 doi: 10.1016/j.enpol.2013.05.113
    [15] Gyamerah SA, Ngare P (2018) Regime-switching model on hourly electricity spot price dynamics. J Math Financ 8: 102–110. https://doi.org/10.4236/jmf.2018.81008 doi: 10.4236/jmf.2018.81008
    [16] Cárdenas-Gallo I, Sánchez-Silva M, Akhavan-Tabatabaei R, et al. (2015) A markov regime-switching framework application for describing EI niño Southern Oscillation (ENSO) patterns. 12th International Conference on Applications of Statistics and Probability in Civil Engineering (ICASP12), Vancouver, Canada, 1–8.
    [17] Hamilton JD (1994) State-space models, Handbook of Econometrics, Amsterdam: Elsevier, 3039–3080. https://doi.org/10.1016/S1573-4412(05)80019-4
    [18] Avordeh TK, Gyamfi S, Opoku AA (2021) Quantitative estimation of the impact of climate change on residential electricity demand for the city of Greater Accra, Ghana. Int J Energy Sect Manag 15: 1066–1086. https://doi.org/10.1108/IJESM-08-2020-0008 doi: 10.1108/IJESM-08-2020-0008
    [19] Gyamerah SA, Agbi-Kaiser HO, Amankwah KEA, et al. (2022) Modelling the hourly consumption of electricity during period of power crisis. arXiv preprint.
  • 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
  • © 2023 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(1991) PDF downloads(139) Cited by(1)

Figures and Tables

Figures(9)  /  Tables(6)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog