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

Partially balanced network designs and graph codes generation

  • Received: 23 June 2021 Accepted: 28 October 2021 Published: 12 November 2021
  • MSC : 05B30, 0570, 94A60, 94A62

  • Partial balanced incomplete block designs have a wide range of applications in many areas. Such designs provide advantages over fully balanced incomplete block designs as they allow for designs with a low number of blocks and different associations. This paper introduces a class of partially balanced incomplete designs. We call it partially balanced network designs (PBNDs). The fundamentals and properties of PBNDs are studied. We are concerned with modeling PBNDs as graph designs. Some direct constructions of small PBNDs and generalized PBNDs are introduced. Besides that, we show that our modeling yields an effective utilization of PNBDs in constructing graph codes. Here, we are interested in constructing graph codes from bipartite graphs. We have proved that these codes have good characteristics for error detection and correction. In the end, the paper introduces a novel technique for generating new codes from already constructed codes. This technique results in increasing the ability to correct errors.

    Citation: A. El-Mesady, Y. S. Hamed, M. S. Mohamed, H. Shabana. Partially balanced network designs and graph codes generation[J]. AIMS Mathematics, 2022, 7(2): 2393-2412. doi: 10.3934/math.2022135

    Related Papers:

    [1] Doris Dumičić Danilović, Andrea Švob . On Hadamard 2-(51,25,12) and 2-(59,29,14) designs. AIMS Mathematics, 2024, 9(8): 23047-23059. doi: 10.3934/math.20241120
    [2] Menderes Gashi . On the symmetric block design with parameters (280,63,14) admitting a Frobenius group of order 93. AIMS Mathematics, 2019, 4(4): 1258-1273. doi: 10.3934/math.2019.4.1258
    [3] Yongli Zhang, Jiaxin Shen . Flag-transitive non-symmetric 2-designs with λ prime and exceptional groups of Lie type. AIMS Mathematics, 2024, 9(9): 25636-25645. doi: 10.3934/math.20241252
    [4] Yuna Zhao . Construction of blocked designs with multi block variables. AIMS Mathematics, 2021, 6(6): 6293-6308. doi: 10.3934/math.2021369
    [5] Bao-Hua Xing, Nurten Urlu Ozalan, Jia-Bao Liu . The degree sequence on tensor and cartesian products of graphs and their omega index. AIMS Mathematics, 2023, 8(7): 16618-16632. doi: 10.3934/math.2023850
    [6] Fei Yan, Junpeng Li, Haosheng Jiang, Chongqi Zhang . A-Optimal designs for mixture polynomial models with heteroscedastic errors. AIMS Mathematics, 2023, 8(11): 26745-26757. doi: 10.3934/math.20231369
    [7] Kittiwat Sirikasemsuk, Sirilak Wongsriya, Kanogkan Leerojanaprapa . Solving the incomplete data problem in Greco-Latin square experimental design by exact-scheme analysis of variance without data imputation. AIMS Mathematics, 2024, 9(12): 33551-33571. doi: 10.3934/math.20241601
    [8] Julian Osorio, Carlos Trujillo, Diego Ruiz . Construction of a cryptographic function based on Bose-type Sidon sets. AIMS Mathematics, 2024, 9(7): 17590-17605. doi: 10.3934/math.2024855
    [9] Qingyi Cui, Changjin Xu, Wei Ou, Yicheng Pang, Zixin Liu, Jianwei Shen, Muhammad Farman, Shabir Ahmad . Further study on Hopf bifurcation and hybrid control strategy in BAM neural networks concerning time delay. AIMS Mathematics, 2024, 9(5): 13265-13290. doi: 10.3934/math.2024647
    [10] Tariq A. Alraqad, Hicham Saber . On the structure of finite groups associated to regular non-centralizer graphs. AIMS Mathematics, 2023, 8(12): 30981-30991. doi: 10.3934/math.20231585
  • Partial balanced incomplete block designs have a wide range of applications in many areas. Such designs provide advantages over fully balanced incomplete block designs as they allow for designs with a low number of blocks and different associations. This paper introduces a class of partially balanced incomplete designs. We call it partially balanced network designs (PBNDs). The fundamentals and properties of PBNDs are studied. We are concerned with modeling PBNDs as graph designs. Some direct constructions of small PBNDs and generalized PBNDs are introduced. Besides that, we show that our modeling yields an effective utilization of PNBDs in constructing graph codes. Here, we are interested in constructing graph codes from bipartite graphs. We have proved that these codes have good characteristics for error detection and correction. In the end, the paper introduces a novel technique for generating new codes from already constructed codes. This technique results in increasing the ability to correct errors.



    Many fundamental problems in combinatorics and related areas can be formulated as decomposition problems-where the aim is to decompose a large discrete structure into suitable smaller ones. Hence, problems of combinatorial design may be efficiently modeled from viewpoint of graph theory. In graph theory, the problems of edge decomposition and graph covering have a great attention as it is of immense importance for numerous applications to a wide range of areas [1,2,3]. Here we are concerned with the problem of detecting and correcting the error that may occur through the communication network (system). Despite communication systems may be robust, during the long process of transmitting data, external sources can coincide with the system and manipulate the data. Such manipulation leads to errors in transmitting data. The data received will be different from what was originally transmitted. Consequently, the ability to correct or at least detecting errors is an important issue to the system. The objective of the paper is to construct combinatorial designs which have efficient properties in detecting and correcting errors from viewpoint of coding theory. We call such designs Partially Balanced Network Design (PBNDs). Balanced incomplete block designs (BIBDs) were introduced in (1936). A BIBD is an arrangement of v objects (points) into b blocks each of size δ such that

    1. Every object occurs at most once in each block.

    2. Every object occurs in exactly α blocks. (α is the number of replications)

    3. Every pair of objects occur together in exactly λ blocks.

    Any BIBD has to satisfy the following conditions [3]:

    bv,vα=bδ,λ(v1)=α(δ1).

    v,b,α,δ,λ are called the parameters of a BIBD. A restriction on using the BIBD is that it is not available for all parametric combinations. Moreover, even if a BIBD is available for given v objects and block of size δ, it may require too many replications α. Another restriction that makes BIBD is not desirable for some experiments design is that BIBD is efficiency balanced, i.e., in BIBD every pair of distinct objects should occur together in exactly λ blocks. The partially balanced incomplete block designs (PBIBDs) compromise these restrictions up to some extent and help in reducing the number of replications. PBIBDs remain connected like BIBDs but no more balanced. Rather they are partially balanced in the sense that some pairs of objects have the same number of replications whereas some other pairs of objects have the same replications but are different from the replications of earlier pairs of objects. According to such enhancement, PBIBDs are applied for the design of experiments in many areas such as statistics [4], game theory [5], agriculture [6], cryptographic schemes [7], and many others. PBIBD was firstly studied by Bose in 1951. Bose et al., [8,9,10] introduced a class of binary, equireplicate and proper designs, which called PBIBD with m-associate classes. An associate class is a set of objects pairs where each pair from the set occur together with the same number of times, λi.

    A PBIBD with m-associate classes is an arrangement of v objects in b blocks such that:

    a) Each object from the set of objects occurs in α blocks.

    b) Each block has δ objects (δ<v), and no object appears more than once in any block.

    c) If two objects are i-th associates of each other then, they occur together in λi(i=1,2,,m) blocks.

    The number λi is independent of the particular pair of i-th associate chosen. λi doesn't need to all be different and some of λi's may be zero. PBIBD is studied and analyzed from viewpoint of graph theory. The relation between PBIBDs and strongly regular graphs is investigated in [8]. Bose and Nair [9] introduced the concept of association schemes in PBIBDs. Bose and Shimamoto [10] studied association schemes of PBIBDs using the graph-theoretic method. Regular graph design (RGD) is an important class of PBIBDs with two association schemes. An RGD (v,δ,α) is a collection of blocks of size δ on a v-set (with no restriction on repeated blocks) such that every object occurs in αblocks and any pair of objects occur together in either λ1 or λ2 blocks, where λ1 is some constant and λ2=λ1+1. There are extensive research for RGDs [11,12,13,14,15,16].

    In this paper, we introduce a significant class of PBIBDs with two association classes with no repeated blocks. We call such a class a partially balanced network design (PBND). The aim of our paper is to show how PBND may be used to construct codes that process a high efficiency in detecting and correcting errors that may occur through the transmission process. The rest of the paper is organized as follows. Section 2 introduces the fundamentals and properties of PBND and the modeling of PBND as a graph design. Section 3 introduces the technique used to construct PBNDs that yield effective error detecting and correcting codes. Some direct constructions of PBNDs and general designs are constructed in Section 4. Section 5 studies the Cartesian product of designs and how that product will lead to codes able to detect and correct more errors. Section 6 shows the advantages of binary codes generated by PBNDs. In Section 7 we summarize the results and the conclusion of the paper.

    Network Design (ND) is a pair (ω,τ), where ω={ω1,ω2,,ωv} is the whole network (the universal set). The elements of ω are called points or objectives. τ={τ1,τ2,,τb} is a collection of nonempty subsets of ω.Each element from τ is called a subnetwork. ND is described by five parameters (v,b,α,δ,λ), which are nonnegative integers and represent the following:

    1) v the size of set ω.

    2) b the number of subnetworks in τ.

    3) α the number of subnetworks to which every point from ω belongs.

    4) δ the size of each subnetwork.

    5) λ the number of subnetworks that contain a pair of distinct points.

    A network design (ND) is a complete-ND if δ=v, whenever δ<v it refers as incomplete-ND. Let λω1,ω2 be the number of subnetworks to which two points ω1,ω2 appear together. If λωi,ωj is unique for i,j with 1i<jv, we call such design as balanced design. If all λωi,ωj's are not identical for i,jwith 1i<jv, then the design is stated as partially balanced-ND. Here, we are interested in partially balanced incomplete network designs (PBNDs). For our designs we restrict λ1. If λωi,ωj is a constant for i,j with 1i<jv, then the network design coincides with balanced incomplete block design (BIBD) and each subnetwork is viewed as a block of size δ. Through the paper we use (v,b,α,δ,λ)-ND for a network design (ND) with parameters (v,b,α,δ,λ).

    Another form to express and determine a PBND is the incidence matrix. Let (ω,τ) be a PBND with parameters (v,b,α,δ,λ). The incidence matrix M=(mi,j) of a (v,b,α,δ,λ)-ND is a b×v binary matrix, where every row corresponds to a subnetwork, and every column corresponds to a point in the set ω.

    mi,j={1;ωjτi,0;ωjτi.

    Theorem 1. Any PBND with parameters (v,b,α,δ,λ) should satisfy the following condition vα=bδ.

    Proof. Consider the number of 1’s in the incidence matrix M of the given PBND. As matrix M inherited from its PBND then it has the following certain properties:

    1) Every row has δ number of 1's.

    2) Every column has α number of 1's.

    3) Two distinct columns both have 1's in at most λ rows.

    Since M has b rows and following property 1, then the number of 1's in the matrix is bδ. Now we are analyzing the columns of M. Property 2 and the number of columns of M imply that M has vα of 1's. Hence, vα=bδ.

    We now review the connection between graph codes and PBND. When a PBND is transformed into an incidence matrix, the rows and the columns can be both viewed as binary codes. The binary code formed from the rows will be denoted as Crow, and the binary code formed from the columns will be referred as Ccolumn. The minimum distance in binary codes is a significant concept. The role of such a concept is to check whether the binary code can detect or correct errors [17,18,19,20].

    Let C be a binary code where every element (coding word) belongs to C has length n. Let P=(p1,p2,...,pn) and Q=(q1,q2,...,qn) be two coding words from C. The minimum distance d(P,Q) between P and Q is calculated from the following relation:

    d(P,Q)=ni=1d(pi,qi),d(pi,qi)={1;piqi,0;pi=qi. (1)

    According to relation (1), the minimum distance between two coding words P and Q defines the number of positions where P and Q differ i.e. piqi for 1in. The minimum distance θ of a code C is defined as:

    θ(C)=min{d(P,Q);P,QC,PQ}. (2)

    In the following sections, we show how to use the minimum distance in detecting and correcting errors of constructed codes. All graphs described here are finite, undirected, without loops and multiple edges. Let V(H) and E(H) be the vertex set and edge set of the graph H, respectively. The degree of a vertex uV(H) is the number of vertices from V(H) that are adjacent to u. The graph is regular if and only if all vertices have a unique degree.

    Hereafter, we illustrate the modeling of PBND in terms of graphs.

    Definition 1. Let H be a s-regular graph of ordern. An (H,F,k,X)-graph design is a collection φ={F0,F1,,Fb1} of b subgraphs of H such that:

    1) For every 0ib1;FiF.

    2) For every 0ib1;Fi is a spanning subgraph of H.

    3) Every Fi contains at most s edges.

    4) Every edge of H exists in exactly k subgraphs from φ.

    5) For any i,j such that ij,FiFjX.

    From Definition 1 an (H,F,k,X)-graph design is a PBDN. There is a correspondence between the parameters (H,F,k,X) of a graph design and the parameters for the corresponding PBDN. Namely, v=|E(H)|,b=|φ|,α=k,δ=|E(F)| and λ=|E(X)|. According to that correspondence, in the following we use (H,F,k,X)-ND for an (H,F,k,X)-graph design. Moreover, if the graph H is a complete bipartite graph Kn,n,XK1,1 and |E(F)|<n then (Kn,n,F,k,K2)-ND is a sub-orthogonal double cover (SODC) of Kn,nby F. The construction of SODCs of Kn,n and Kn by Ffor different classes of F has been studied in [21,22,23,24,25]. The design (Kn,n,F,k,K2)-ND is equivalent to an orthogonal double cover (ODC) of Kn,n by F if and only if |E(F)|=n, see [26,27,28,29,30,31,32,33,34,35]. If H is a Cayley graph and |E(F)|=s<n,then the constructed design (Kn,n,F,k,K2)-ND is considered as an ODC of Cayley graphs which have been studied in [36]. For the (H,F,k,X)-ND, if the graph H is a complete bipartite graph Kn,n,k3,XK2,and |E(F)|=n, then (Kn,n,F,k,K2)-ND is a mutually orthogonal k cover (MOkC) of Kn,n by F, see [37,38,39,40,41,42,43,44]. In [45], the authors have constructed the circular intensely ODC design of balanced complete multipartite graphs. Additional background material for this field may be found in [46,47,48,49,50]. For many communication systems (networks), bipartite graphs are good tools in modeling such systems. In the next section, we are concerned with (H,F,k,X)-ND for a network H modeled as a bipartite graph and refer to it as a bipartite network.

    The complete bipartite network Kn,n consists of two independent sets of nodes. The first set of the nodes is labeled by {0,1,...,n1}×{0}, and the second set of the nodes is labeled by {0,1,...,n1}×{1}. Each link u0v1 in the network has a weight equals to vu (sums and differences are calculated modulon).

    The network design (H,F,k,X)-ND is a collection G={Gij0,Gij1,...,Gijn1};i{0,1,...,n1},j{0,1,...,k1} of kn isomorphic subnetworks (each of them is isomorphic to the networkF)of the complete bipartite network Kn,n such that:

    a) For a certain j=η,j{0,1,...,k1}, every link of the complete bipartite network Kn,n is found in exactly one subnetwork of {Giη0,Giη1,...,Giηn1}.

    b) For any two subnetworks Gawc,Gxyz from the collection G, if ax,w=y,cz, then there are no common links between these two subnetworks.

    c) For any two subnetworks Gawc,Gxyz from the collection G, if wy, then these two subnetworks intersect in a common network which is isomorphic to the subnetwork X.

    In the (H,F,k,X)-ND, we have v=|E(Kn,n)|=n2,b=k|E(F)|=kn,α=k,δ=|E(F)|=n,XK1,1. Then, vα=kn2,bδ=kn2vα=bδ.

    The incidence matrix I=(Iij) for the (Kn,n,F,k;K1,1)-ND is a kn×n2 binary matrix showing the relation between the links and the subnetworks of the complete bipartite network Kn,n,where every row in I corresponds to a subnetwork Fi in (Kn,n,F,k;K1,1)-ND and every column in I corresponds to a link lj in the complete bipartite network Kn,n,

    Iij={1;ljFi,0;ljFi.

    Any code word from Crow represents a bipartite graph that is isomorphic to the graph F. In this case, the Crow is called a F-graph code. The rules of building the incidence matrix I=(Iij) of (H,F,k,X)-ND lead to the following lemma.

    Lemma 1. An F-graph code exists if and only if the (H,F,k,X)-ND is available.

    Moreover, since I is a binary matrix, then its rows or columns can be used as binary codes. For instance, the encoding function of the code Ccolumn is defined as; with W=Z2n, let encoding function E:WZkn2, be given by E(ij)=Cni+j(I) (the (ni+j)th column of the matrix I). Section 4 contains examples explain the methodology of the coding and decoding processes with the help of the minimum distance of the considered code.

    Definition 2. ([18]) For m,λZ+ and εZm2, the sphere of radius λ centered at ε is defined as S(ε,λ)={γm2:d(ε,γ)λ}.

    Theorem 2. ([18]) Supposeis E:WC is an encoding function where WZn2 is the set of messages and E(W)=CZm2 is the set of code words with n<m. If the minimum distance between code words is at least λ+1,λZ+, then we can detect all transmission errors of weight λ.

    Theorem 3. ([18]) Suppose E:WC is an encoding function where WZn2 is the set of messages and E(W)=CZm2 is the set of code words with n<m. If the minimum distance between code words is at least 2λ+1,λZ+, then we can construct a decoding function D:Zm2W that corrects all transmission errors of weight λ.

    The following theorem gives the range of errors that can be detected or corrected when either Crowor Ccolumn is used.

    Theorem 4. Let Crow, Ccolumn be the binary codes constructed from the rows and columns of the incidence matrix of (Kn,n,F,k;K1,1)-ND, respectively. We have the following:

    1) For the binary code Crow, we can detect up to 2n3 errors or correct up to 2n32 errors.

    2) For the binary code Ccolumn, we can detect up to 2k3 errors or correct up to 2k32 errors.

    Proof. From the definition of the (Kn,n,F,k;K1,1)-ND, in the incidence matrix of (Kn,n,F,k;K1,1)-ND, there exists n number of 1's in every row. Any two rows have at most 1 position of 1's in common. Then the minimum distance of Crow is θ(Crow)=2(n1)=2n2. Therefore, for Crow, we can detect up to θ(Crow)1=2n3 errors and correct up to θ(Crow)12=2n32. Considering Ccolumn there exists k number of 1's in every column. Any two columns have at most 1 position of 1's in common, then the minimum distance of Ccolumn is θ(Ccolumn)=2(k1)=2k2. Therefore, for Ccolumn we can detect up to (Ccolumn)1=2k3 and correct up to θ(Ccolumn)12=2k32.

    Method for constructing (Kn,n,F,k;K1,1)-ND

    In what follows, we are concerned with the links of the network G. Consequently, we will use G for the links set of G.

    Definition 3. If we have a subnetwork G={(u10,v11),(u20,v21),(u30,v31),...,(un0,vn1)} (the weights of these links are mutually distinct and equal to {0,1,,n1}) of the complete bipartite network Kn,n, then the translated subnetwork G+σ={(u10+σ,v11+σ),(u20+σ,v21+σ),(u30+σ,v31+σ),...,(un0+σ,vn1+σ)} is called the G-translate of the subnetwork G where σ{0,1,...,n1}. The union of the subnetworks G+σ gives the complete bipartite network Kn,n. The subnetwork G will be called the basis of the complete bipartite network Kn,n.

    In what follows, the basis G will be represented by a vector ϕ(G)=(φ0,φ1,,φn1) where ϕx{0,1,...,n1} and (ϕx)0 is the unique node (ϕx,0){0,1,...,n1}×{0} that belongs to the unique link of weight x in the basis G Note that the links of the basis Gare {(ϕx)0,(ϕx+x)1}, which will be represented by ((ϕx)0,(ϕx+x)1).

    Definition 4. The two bases G and H represented by the vectors ϕ(G) and ψ(H) are said to be intersected if {ϕi(G)ψi(H):i{0,1,,n1}}={0,1,...,n1}.

    Definition 5. If the two bases vectors ϕ(G) and ψ(H) are intersected and GH, then the translated subnetworks G+σ and H+σ,σ{0,1,...,n1} gives a (Kn,n,G,2;K1,1)-ND.

    Definition 6. The subnetwork Hs of the complete bipartite network Kn,n is the symmetric subnetwork of the subnetwork H if H={(u10,v11),(u20,v21),(u30,v31),...,(un0,vn1)},Hs={(v10,u11),(v20,u21),(v30,u31),...,(vn0,un1)}. It is clear that if the subnetwork H is a basis, then the subnetwork Hs is also a basis. If the two bases H and Hs are intersected, then the basis H is called a symmetric basis.

    Definition 7. The basis H represented by the vector ψ(H) is a symmetric basis if {ψτ(H)ψnτ(H)+τ:τ{0,1,...,n1}}={0,1,,n1}.

    In this section, we introduce some small PBNDs based on the direct construction method. Also, we introduce some generalized PBNDs.

    Lemma 2. There exists a (K4,4,2K1,2,3;K1,1)-ND. Hence, there is a 2K1,2-code.

    Proof. Let G={G000,G101,G202,G303,G010,G111,G212,G313,G020,G121,G222,G323}with G000={0021,2021,1001,3001},G101={0011,2011,1031,3031},G202={0001,2001,1021,3021}, G303={0031,2031,1011,3011},G010={0001,1001,3031,2031},G111={2021,3021,1011,0011}, G212={2011,3011,1021,0021},G313={1031,0031,2001,3001},G020={0021,3021,2031,1031},G121={0011,3011,2001,1001},G222={2011,1011,0001,3001},G322={2021,1021,0031,3031}, see Figure 1. All the subnetworks are isomorphic to 2K1,2. Let i0j1 be a link from the complete bipartite network K4,4. The constructed design forces every link i0j1 to occur in exactly 3 subnetworks from G. Moreover, such design fulfills the following total function :A{0,1}, where A={Gawc,Gxyz} be a set of 2-elements subsets of G and ({Gawc,Gxyz})={1;wy,0;ax,w=y,cz. Here, ({Gawc,Gxyz})=1 means that the intersection of two subnetworks Gawc,Gxyz is isomorphic to subnetwork K1,1, and ({Gawc,Gxyz})=0 refers that they have no subnetworks in common.

    Figure 1.  (K4,4,2K1,2,3;K1,1)-ND.

    The incidence matrix Ifor (K4,4,2K1,2,3;K1,1)-ND is

    I((K4,4,2K1,2,3;K1,1)ND)=F0F1F2F3F4F5F6F7F8F9F10F11[001010000010010001000100100000101000000100010001100010000100000101000010001000100001010000011000001000010100010000100010100001000001000110001000100000010010000100100100001001001000010010000001].

    Example 1. From Lemma 2,

    W=Z24={0,1,2,3}×{0,1,2,3}={00,01,02,03,10,11,12,13,20,21,22,23,30,31,32,33},

    Example 1. From Lemma 2, W=Z24={0,1,2,3}×{0,1,2,3}={00,01,02,03,10,11,12,13,20,21,22,23,30,31,32,33},E:WZ122,E(ij)=C4i+j(I), hence,

    E(00)=C0(I)=001010000010,E(01)=C1(I)=010001000100,E(02)=C2(I)=100000101000,E(03)=C3(I)=000100010001,E(10)=C4(I)=100010000100,E(11)=C5(I)=000101000010,E(12)=C6(I)=001000100001,E(13)=C7(I)=010000011000,E(20)=C8(I)=001000010100,E(21)=C9(I)=010000100010,E(22)=C10(I)=100001000001,E(23)=C11(I)=000110001000,E(30)=C12(I)=100000010010,E(31)=C13(I)=000100100100,E(32)=C14(I)=001001001000,E(33)=C15(I)=010010000001.

    The minimum distance between code words is 4, so we can correct all single and double errors. For instance,

    S(C0(I),2)={001010000010}{101010000010,011010000010,001110000010,001011000010,001010100010,001010010010,001010001010,001010000110,001010000011}{111010000010,101110000010,101011000010,101010100010,101010010010,101010001010,101010000110,101010000011,011110000010,011011000010,011010100010,011010010010,011010001010,011010000110,001110010010,001110001010,001110000110,011010000011,001111000010,001110100010,001110000011,001011100010,001011010010,001011001010,001011000110,001011000011,001010110010,001010101010,001010100110,001010100011,001010011010,001010010110,001010010011,001010001110,001010001011,001010001110,001010001011,001010000111}.

    The decoding function D:Z122W gives D(ε)=C0(I)=001010000010 for allεS(C0(I),2).

    Lemma 3. There exists a (K4,4,K2,2,3;K1,1)-ND. Hence, there is a K2,2-code.

    Proof. Let G={G000,G101,G202,G303,G010,G111,G212,G313,G020,G121,G222,G323} with G000={2001,2031,1001,1031},G101={3011,3021,0011,0021},G202={3031,3001,0031,0001}, G303={1011,1021,2011,2021},G010={1021,1001,3021,3001},G111={2011,2031,0011,0031}, G212={2021,2001,0021,0001},G313={1011,1031,3011,3031},G020={2021,2031,3021,3031}, G121={1021,1031,0021,0031},G222={2011,2001,3011,3001},G322={1011,1001,0011,0001}. All the subnetworks are isomorphic to K2,2. Let i0j1 be a link from the complete bipartite network K4,4.The constructed design forces every link i0j1 to occur in exactly 3 subnetworks from G. Moreover, such design fulfills the following total function :A{0,1}, where A={Gawc,Gxyz} be a set of 2-elements subsets of G and ({Gawc,Gxyz})={1;wy,0;ax,w=y,cz.

    Here, ({Gawc,Gxyz})=1 means that the intersection of two subnetworks Gawc,Gxyz is isomorphic to subnetwork K1,1 and ({Gawc,Gxyz})=0 refers that they have no subnetworks in common.

    Theorem 5. There exists a (Kn,n,Pn+1,n;K1,1)-ND where n is a prime number.

    Proof. We define ψτ(Hx)=τ(xτ) where τ,x{0,1,,n1}.Assume that pq{0,1,,n1},then ψτ(Hp)ψτ(Hq)=τ(pq);τ{0,1,,n1}. It is easy to check that the differences ψτ(Hp)ψτ(Hq) give the group {0,1,,n1} since n is a prime and pq is not equal to zero. Hence, Hp and Hq are intersected. Now, we will prove that all the bases Hp,p{0,1,,n1} are paths. The basis Hp={(τ(pτ))0,(τ(pτ)+τ)1:τ,p{0,1,,n1}}, it is trivial to show that Hp is a path at n=2,forn>2,assume that r=s/2, then for each λ{0,1,,n1},lλ=((λ+r)(srλ))0,((λ+r)(srλ)+λ+r)1), where lλ is the link of weight λ+r. Consider the two links lλ and lμ with λμ, these two links are adjacent and incident in the node with zero subscript if (λ+r)(srλ)=(μ+r)(srμ). Putting s=2rgives (λ+μ)(λμ)=0. This means that λ+μ=0 since λμ. Now, we can conclude that lλ=lμ=lnμ. Hence, there is only value of μ verifies the previous claim provided that λ0. Similarly, the two links lλ and lμ with λμ are adjacent and incident in the node with one subscript if (λ+r)(srλ)+(λ+r)=(μ+r)(srμ)+(μ+r). This gives (λ+μ1)(λμ)=0. Hence, lμ=l1λ and there is only value of μ verifies the previous claim provided that λ1/2. Finally, the sequence l0,l1,ln1,l2,ln2,,l(n1)/2,ln(n1)/2represents a path.

    Lemma 4. There exists a(K3,3,P4,3;K1,1)-ND. Hence, there is a P4-code, where P4 is a path graph with four vertices and three edges.

    Proof. Let G={G000,G101,G202,G010,G111,G212,G020,G121,G222} with G000={0001,0011,1001}, G101={2001,2021,0021},G202={1021,1011,2011},G010={0001,0021,1021},G111={0011,2011,2021}, G212={1001,2001,1011},G020={0001,2001,2011},G121={0011,0021,1011},G222={1001,1021,2021}. All the subnetworks are isomorphic to P4. Let i0j1 be a link from the complete bipartite network K3,3.The constructed design forces every link i0j1 to occur in exactly 3 subnetworks from G. Moreover, such design fulfills the following total function :A{0,1}, where A={Gawc,Gxyz} be a set of 2-elements subsets of G and ({Gawc,Gxyz})={1;wy,0;ax,w=y,cz.

    Here, ({Gawc,Gxyz})=1 means that the intersection of two subnetworks Gawc,Gxyz is isomorphic to subnetwork K1,1, and ({Gawc,Gxyz})=0 refers that they have no subnetworks in common.

    In what follows, the link (a0,b1) will be written as (a,b) for simplification.

    Theorem 6. There exists a (Kn,n,n12P3K1,1,n;K1,1)-ND where n>2 is a prime number. Hence, there is a (n12P3K1,1)-code.

    Proof. Define all subnetworks of a (Kn,n,n12P3K1,1,n;K1,1)-ND by the following table where x{0,1,,n1}.

    From Table 1, we have a collection G={Gij0,Gij1,...,Gijn1};i,j{0,1,...,n1} of n2 subnetworks. Now, we want to prove the isomorphism of all subnetworks in Table 1. Suppose ε{0,1,...,n1}is a fixed number and ξ{0,1,...,n1}is an arbitrary number. By taking the subnetworks in the first column of Table 1, we have to prove that x2+εx=ξ has a unique solution for exactly one ξ, two solutions for n12ξ's, and no solution for the remaining n12ξ's. There is a numberh{0,1,...,n1} with h=2ε since n>2 is a prime. Hence, (x+h)2=h2+ξ from the equation x2+εx=ξ. Now, we have a unique solution x=h if h2+ξ=0.For any other h2+ξ, the desired property is verified. Similarly, the isomorphism for the remaining subnetworks in Table 1 can be proved. Hence, all subnetworks in Table 1 are isomorphic to n12P3K1,1. It is clear that the subnetworks in the same row in Table 1 have no common links and any two subnetworks from two different rows have only one common link.

    Table 1.  All subnetworks of a (Kn,n,n12P3K1,1,n;K1,1)-ND.
    The elements of the collection G in Theorem 6
    G000={(x,x2)} G101={(x,x2+1)} G(n1)0n1={(x,x2+n1)}
    G010={(x,x2+x)} G111={(x,x2+x+1)} G(n1)1n1={(x,x2+x+n1)}
    G020={(x,x2+2x)} G121={(x,x2+2x+1)} G(n1)2n1={(x,x2+2x+n1)}
    G0(n1)0={(x,x2+(n1)x)} G1(n1)1={(x,x2+(n1)x+1)} G(n1)(n1)n1={(x,x2+(n1)x+n1)}

     | Show Table
    DownLoad: CSV

    Lemma 5. There exists a (K3,3,P3K1,1,3;K1,1)-ND. Hence, there is a P3K1,1-code.

    Proof. LetG={G000,G101,G202,G010,G111,G212,G020,G121,G222} with G000={0001,0011,2021}, G101={1001,1011,0021},G202={2001,2011,1021},G010={0001,0021,2011},G111={1001,1021,0011}, G212={2001,2021,1011},G020={1011,1021,0001},G121={2011,2021,1001},G222={0011,0021,2001}. All the subnetworks are isomorphic to P3K1,1. Let i0j1 be a link from the complete bipartite network K3,3.The constructed design forces every link i0j1 to occur in exactly 3 subnetworks from G. Moreover, such design fulfills the following total function :A{0,1}, where A={Gawc,Gxyz} be a set of 2-elements subsets of G and ({Gawc,Gxyz})={1;wy,0;ax,w=y,cz.

    Here, ({Gawc,Gxyz})=1 means that the intersection of two subnetworks Gawc,Gxyz is isomorphic to subnetwork K1,1, and ({Gawc,Gxyz})=0 refers that they have no subnetworks in common.

    Theorem 7. There exists a (Kn,n,nK1,1,n1;K1,1)-ND where n is a prime number. Hence, there is a (nK1,1)-code.

    Proof. Define all subnetworks of a (Kn,n,nK1,1,n1;K1,1)-ND by the following table wherex{0,1,,n1}.

    From Table 2, the collection G={Gij0,Gij1,...,Gijn1};i{0,1,...,n1},j{0,1,...,n2} of n(n1) subnetworks. Now, we want to prove the isomorphism of all subnetworks in Table 2. By taking the subnetworks in the first column of Table 2, for all ε{0,1,...,n1}, we have gcd(ε,n)=1. Hence, the nodes εx are mutually distinct in {1,2,...,n1} and all the subnetworks in the first column of Table 2 are isomorphic to nK1,1. Similarly, the isomorphism for the remaining subnetworks in Table 2 can be proved. Hence, all subnetworks in Table 2 are isomorphic to (nK1,1). It is clear that the subnetworks in the same row in Table 2 have no common links and any two subnetworks from two different rows have only one common link.

    Table 2.  All subnetworks of a (Kn,n,nK1,1,n1;K1,1)-ND.
    The elements of the collection G in Theorem 7
    G000={(x,x)} G101={(x,x+1)} G(n1)0n1={(x,x+n1)}
    G010={(x,2x)} G111={(x,2x+1)} G(n1)1n1={(x,2x+n1)}
    G020={(x,3x)} G121={(x,3x+1)} G(n1)2n1={(x,3x+n1)}
    G0(n2)0={(x,(n1)x)} G1(n2)1={(x,(n1)x+1)} G(n1)(n2)n1={(x,(n1)x+n1)}

     | Show Table
    DownLoad: CSV

    Theorem 8. There exists a (Kn,n,(n2)K1,1K1,2,n1;K1,1)-ND where n is a prime number. Hence, there is a (n2)K1,1K1,2-code.

    Proof. Define all subnetworks of a (Kn,n,(n2)K1,1K1,2,n1;K1,1)-ND by the following table wherex{0,1,,n1}.

    From Table 3, the collection G={Gij0,Gij1,...,Gijn1};i{0,1,...,n1},j{0,1,...,n2} of n(n1)subnetworks. Now, we want to prove the isomorphism of all subnetworks in Table 3. By taking the subnetworks in the first column of Table 3, for all ε{0,1,...,n1}, we have gcd(ε,n)=1. Hence, the nodes εx are mutually distinct in {1,2,...,n1} and the nodes εx+1 are mutually distinct in {1,2,...,n1}. Together with the link (0,0) we conclude that every subnetwork in the first column of Table 3 is isomorphic to ((n2)K1,1K1,2).Similarly, the isomorphism for the remaining subnetworks in Table 3 can be proved. Hence, all subnetworks in Table 3 are isomorphic to ((n2)K1,1K1,2). It is clear that the subnetworks in the same row in Table 3 have no common links and any two subnetworks from two different rows have only one common link.

    Table 3.  All subnetworks of a (Kn,n,(n2)K1,1K1,2,n1;K1,1)-ND.
    The elements of the collection G in Theorem 8
    G000={(0,0),(x,x+1)} G101={(0,1),(x,x+2)} G(n1)0n1={(0,n1),(x,x+n)}
    G010={(0,0),(x,2x+1)} G111={(0,1),(x,2x+2)} G(n1)1n1={(0,n1),(x,2x+n)}
    G020={(0,0),(x,3x+1)} G121={(0,1),(x,3x+2)} G(n1)2n1={(0,n1),(x,3x+n)}
    G0(n2)0={(0,0),(x,(n1)x+1)} G1(n2)1={(0,1),(x,(n1)x+2)} G(n1)(n2)n1={(0,n1),(x,(n1)x+n)}

     | Show Table
    DownLoad: CSV

    Theorem 9. There exists a (K9,9,3K1,2K1,3,3;K1,1)-ND. Hence, there is a 3K1,2K1,3-code.

    Proof. Define all subnetworks of a (K9,9,3K1,2K1,3,3;K1,1)-ND by the following table wherex{0,1,,8}.

    From Table 4, the collection G={Gij0,Gij1,...,Gij8};i{0,1,...,8},j{0,1,2} of 24 subnetworks. It is clear that all the subnetworks in the first column of Table 4 are isomorphic to the network (3K1,2K1,3). Similarly, the isomorphism for the remaining subnetworks in Table 4 can be proved. Hence, all subnetworks in Table 4 are isomorphic to (3K1,2K1,3). It is clear that the subnetworks in the same row in Table 4 have no common links and any two subnetworks from two different rows have only one common link.

    Table 4.  All subnetworks of a (K9,9,3K1,2K1,3,3;K1,1)-ND.
    The elements of the collection G in Theorem 9
    G000={(x,x2)} G101={(x,x2+1)} G808={(x,x2+8)}
    G010={(x,x2+x)} G111={(x,x2+x+1)} G818={(x,x2+x+8)}
    G020={(x,x2+2x)} G121={(x,x2+2x+1)} G828={(x,x2+2x+8)}

     | Show Table
    DownLoad: CSV

    Theorem 10. There exists a (K12,12,2K1,22K1,4,2;K1,1)-ND. Hence, there is a 2K1,22K1,4-code.

    Proof. Define all subnetworks of a (K12,12,2K1,22K1,4,2;K1,1)-ND by the following table wherex{0,1,,11}.

    From Table 5, the collection G={Gij0,Gij1,...,Gij11};i{0,1,...,11},j{0,1} of 24 subnetworks. It is clear that all the subnetworks in the first column of Table 5 are isomorphic to the network (2K1,22K1,4). Similarly, the isomorphism for the remaining subnetworks in Table 4 can be proved. Hence, all subnetworks in Table 5 are isomorphic to (2K1,22K1,4). It is clear that the subnetworks in the same row in Table 5 have no common links and any two subnetworks from two different rows have only one common link.

    Table 5.  All subnetworks of a (K12,12,2K1,22K1,4,2;K1,1)-ND.
    The elements of the collection G in Theorem 10
    G000={(x,x2)} G101={(x,x2+1)} G11,011={(x,x2+11)}
    G010={(x,x2+x)} G111={(x,x2+x+1)} G11,111={(x,x2+x+11)}

     | Show Table
    DownLoad: CSV

    Theorem 11. Let ϕ(G)=(φ0,φ1,,φn1) be a symmetric basis of (Kn,n,G,2;K1,1)-ND and ψ(H)=(ψ0,ψ1,,ψm1) be a symmetric basis of (Km,m,H,2;K1,1)-ND, then the Cartesian productϕ(G)×ψ(H)=(φ0,φ1,,φn1)×(ψ0,ψ1,,ψm1)=(φ0ψ0,φ0ψ1,,φρψυ,,φn1ψm1) where ρ{0,1,...,n1},v{0,1,...,m1} is a symmetric basis of (Kmn,mn,G×H,2;K1,1)-ND.

    Proof. Since ϕ(G)=(φ0,φ1,,φn1) is a symmetric basis of (Kn,n,G,2;K1,1)-ND, then

    {ϕρ(G)ϕnρ(G)+ρ:ρ{0,1,...,n1}}={0,1,...,n1}. (3)

    Since ψ(H)=(ψ0,ψ1,,ψm1)is a symmetric basis of (Km,m,H,2;K1,1)-ND, then

    {ψv(H)ψmv(H)+v:v{0,1,...,m1}}={0,1,...,m1}. (4)

    Then, ϕ(G)×ψ(H)=(φ0,φ1,,φn1)×(ψ0,ψ1,,ψm1)=(φ0ψ0,φ0ψ1,,φρψυ,,φn1ψm1) where ρ{0,1,...,n1},v{0,1,...,m1}.From (3) and (4), we can conclude {ϕρψvϕnρψmv+ρv:ρv{0,1,...,n1}×{0,1,...,m1}}={(ϕρ(G)ϕnρ(G)+ρ)(ψv(H)ψmv(H)+v):ρ{0,1,...,n1},v{0,1,...,m1}}={0,1,...,n1}×{0,1,...,m1}.Then, ϕ(G)×ψ(H) is a symmetric basis of (Kmn,mn,G×H,2;K1,1)-ND. The incidence matrix of (Kn,n,G,2;K1,1)-ND has 2n rows and n2 columns and the incidence matrix of (Km,m,H,2;K1,1)-ND has 2m rows and m2 columns. The incidence matrix of (Kmn,mn,G×H,2;K1,1)-ND has 2mn rows and n2×m2columns. Hence, |Ccolumn|=n2×m2 and |Crow|=2mn. When Crow is used for coding, we can detect up to θ(Crow)1=2mn3 errors and correct up to θ(Crow)12=2mn32.

    Example 2. Let ϕ(P3)=(0,0) be a symmetric basis of (K2,2,P3,2;K1,1)-ND and ψ(P4)=(0,1,1) be a symmetric basis of (K3,3,P4,2;K1,1)-ND, then the Cartesian product ϕ(P3)×ψ(P4)=(0,0)×(0,1,1)=(00,01,01,00,01,01) is a symmetric basis of (K6,6,P3×P4,2;K1,1)-ND. Note that if ijϕ(P3)×ψ(P4),then f(ij)=3i+j gives a compact representation for the vector ϕ(P3)×ψ(P4) which is (0,1,1,0,1,1).

    Combinatorial designs and several related structures can be used to generate codes based on the incidence matrix. Many interesting and useful results have been provided as a result of the interplay between designs and codes. For an excellent survey on the topic, see [51]. Recently there is more attention of codes generating from graphs. The connection of codes and graphs has been explored from different aspects in the literature. The main objective in these works is to take a special class of graphs and construct codes from the adjacency matrix of the graph. Nice codes can be generated by some strongly regular graphs [52,53]. Binary codes can be generated by different graphs such as Paley graphs, the block graphs of Steiner 2-designs, and the Latin square graphs [54]. Non-isomorphic codes have been produced by non-isomorphic graphs, see [54]. The structure of the graph may lead to different types of codes as a result, such as self-dual codes, self-orthogonal codes, etc. We refer the reader to [55,56,57,58,59,60,61] for some of these works. Higazy et al. [62] studied the group-generated graph designs for certain circulant graphs and the generation of codes from such designs. Here, we examine binary codes obtained from the row or column span of the incidence matrices of some graphs that occur as induced subgraphs of the complete bipartite graphs. In this paper, we introduce a method from which we can generate a special type of orthogonal codes. These codes are depending on the orthogonality of graphs found in the design (Kn,n,F,k;K1,1). Two graphs are orthogonal if they intersect in at most one edge. Our method constructs binary codes satisfying that the inner product of any two codewords 1. We introduce PBNDs that lead to efficient error detection and correction codes. In order to increase the dimension of code and keeping efficient properties for error detection and correction, we introduce a technique that generates codes based on the Cartesian product of earlier designs. We should notify the reader that our method for such a product differs from those studied in [63].

    In this paper, we studied binary codes based on PBNDs, (Kn,n,F,k;K1,1). For instances, the advantages of binary codes generated by (Kn,n,F,2;K1,1) are as follows: From the binary codeword generator of length n2, we can get 2n1 new binary codewords of length n2, this can be shown as follows, where these codewords represent the rows of the incidence matrix of (Kn,n,F,2;K1,1).

    Definition 8. For the binary codeword with length n2,vij is called a binary codeword generator, if (ji) gives {0,1,...,n1} for ij with which vij=1.

    Definition 9. If v0ij=1, then vx(i+x)(j+x)=1,x{0,1,...,n1} is called xtranslate of v0.

    Example 3. Let xZn,vxij={1;ijA={x}×Zn,0;ijZ2nA. and uxij={1;ijB=Zn×{x},0;ijZ2nB, the rows of the following matrix M represent 2n binary codewords of length n2,M=[v0ijv1ijvn1iju0iju1ijun1ij].

    Put n=4, then xZ4,vxij={1;ijA={x}×Z4,0;ijZ24A. and uxij={1;ijB=Z4×{x},0;ijZ24B, the rows of the following matrix M represent 8 binary codewords of length 16. Also, if vxij=1, then there is a graph corresponding to this vector with the edge set E(Gx)={(i0,j1):i,jZ4}, see Figure 2.

    M=[11110000000000000000111100000000000000001111000000000000000011111000100010001000010001000100010000100010001000100001000100010001].
    Figure 2.  The graphs and the corresponding binary codewords of (K4,4,K1,4,2;K1,1) for Example 3.

    Also we can add the following to the advantages of PBNDs: For the generalized binary codes generated by the Cartesian products of PBNDs. The Cartesian products of PBNDs is an easier method than the previously defined methods for constructing new binary codes from the old ones [64].

    In the paper, we propose a novel technique for constructing a partially balanced network design (PBND). These networks are used to model the information transmission represented by strings of the signals zero and one. Certain problems appear in the transmission of information in digital communications when this information is transmitted in the form of strings of zeros and ones. The noise in the transmission channel changes the original transmitted signal to a different signal. Therefore, the receiver takes a wrong decision. The PBND is a helping tool that manages us to detect and correct the errors in the coded messages. A graphical model is introduced for the PBND. Also, the PBNDs are represented by their corresponding incidence matrices. These matrices compromise new and several codes. The nodes of these networks are labeled by the Cartesian product of additive abelian groups. Some direct constructions of small and generalized PBND are introduced. Finally, we prove that the Cartesian product of two small symmetric bases gives a larger symmetric basis that generates new codes with larger lengths. The Cartesian products of PBNDs is an easier method than the previously defined methods for constructing new binary codes from the old ones. The following table presents the summary of the results in the paper. It should be noted thatpis a prime number in Table 6.

    Table 6.  Summary of the results.
    Kn,n F k X
    K3,3 P4 3 K1,1
    K3,3 P3K1,1 3 K1,1
    K4,4 2K1,2 3 K1,1
    K4,4 K2,2 3 K1,1
    Kp,p Pp+1 p K1,1
    Kp,p p12P3K1,1 p K1,1
    Kp,p pK1,1 p1 K1,1
    Kp,p (p2)K1,1K1,2 p1 K1,1
    K9,9 3K1,2K1,3 3 K1,1
    K12,12 2K1,22K1,4 2 K1,1

     | Show Table
    DownLoad: CSV

    This research was supported by Taif University Researchers Supporting Project Number (TURSP-2020/155), Taif University, Taif, Saudi Arabia.

    The authors declare no conflict of interest.



    [1] J. A. Bondy, U. S. R. Murty, Graph theory with applications, Elsevier Science Publishing Co., Inc., New York, USA, 1976. doi: 10.1057/jors.1977.45.
    [2] J. A. Bondy, U. S. R. Murty, Graph theory, Springer, Berlin, 2008.
    [3] D. R. Stinson, Combinatorial designs: Constructions and analysis, Springer, New York, 2004.
    [4] R. Khattree, On construction of constant block-sum partially balanced incomplete block designs, Commun. Stat. Theor. M., 49 (2020), 2585-2606. doi: 10.1080/03610926.2019.1576895. doi: 10.1080/03610926.2019.1576895
    [5] P. Kaur, D. G. Kumar, Construction of incomplete Sudoku square and partially balanced incomplete block designs, Commun. Stat. Theor. M., 49 (2020), 1462-1474. doi: 10.1080/03610926.2018.1563177. doi: 10.1080/03610926.2018.1563177
    [6] I. Iqbal, M. Parveen, Z. Mahmood, New diallel cross designs through resolvable balanced incomplete block designs for field experiments, Sarhad J. Agric., 34 (2018), 994-1000. doi: 10.17582/journal.sja/2018/34.4.994.1000. doi: 10.17582/journal.sja/2018/34.4.994.1000
    [7] A. Adhikari, M. Bose, D. Kumar, B. Roy, Applications of partially balanced incomplete block designs in developing (2, n)-visual cryptographic schemes, IEICE T. Fund. Electr., E90-A (2007), 949-951. doi: 10.1093/ietfec/e90-a.5.949. doi: 10.1093/ietfec/e90-a.5.949
    [8] R. C. Bose, Partially balanced incomplete block designs with two associate classes involving only two replications, Calcutta Stat. Assoc. Bul., 3 (1951), 120-125. doi: 10.1177/0008068319510304. doi: 10.1177/0008068319510304
    [9] R. C. Bose, K. R. Nair, Partially balanced incomplete block designs, Sankhya, 4 (1939), 337-372. Available from: https://www.jstor.org/stable/40383923.
    [10] R. C. Bose, T. Shimamoto, Classification and analysis of partially balanced incomplete block designs with two associate classes, J. Am. Stat. Assoc., 47 (1952), 151-184. doi: 10.2307/2280741. doi: 10.2307/2280741
    [11] W. D. Wallis, Regular graph designs, J. Stat. Plan. Infer., 51 (1996), 273-281. doi: 10.1016/0378-3758(95)00091-7. doi: 10.1016/0378-3758(95)00091-7
    [12] D. L. Kreher, G. F. Royle, W. D. Wallis, A family of resolvable regular graph designs, Discrete Math., 156 (1996), 269-275. doi: 10.1016/0012-365X(95)00052-X. doi: 10.1016/0012-365X(95)00052-X
    [13] H. B. Walikar, B. D. Acharya, H. S. Ramane, H. G. Shekharappa, S. Arumugam, Partially balanced incomplete block designs arising from minimal dominating sets of a graph, AKCE. Int. J. Graphs Co., 4 (2007), 223-232. doi: 10.1080/09728600.2007.12088837. doi: 10.1080/09728600.2007.12088837
    [14] F. R. Barandagh, A. R. Barghi, B. Pejman, M. R. Parsa, Strongly regular graphs arising from balanced incomplete block design with λ = 1, Gen. Math. Notes, 24 (2014), 70-77.
    [15] S. A. Cakiroglu, Optimal regular graph designs, Stat. Comput., 28 (2018), 103-112. doi: 10.1007/s11222-016-9720-8. doi: 10.1007/s11222-016-9720-8
    [16] R. Ahmed, F. Shehzad, M. Jamil, H. M. K. Rasheed, Construction of some circular regular graph designs in blocks of size four using cyclic shifts, J. Stat. Theory Appl., 19 (2020), 314-324. doi: 10.2991/jsta.d.200423.001. doi: 10.2991/jsta.d.200423.001
    [17] A. Boua, L. Oukhtite, A. Raji, O. A. Zemzami, An algorithm to construct error correcting codes from planar near-rings, Int. J. Math. Eng. Sci., 3 (2014), 614-623. Available from: https://vixra.org/pdf/1405.0130v1.pdf.
    [18] C. J. Colbourn, J. H. Dinitz, Handbook of combinatorial designs, 2 Eds., Chapman and Hall-CRC, 2007.
    [19] S. J. M. Hwang, Application of balanced incomplete block designs in error detection and correction, 2016. doi: 10.4135/9781473941977.
    [20] R. Merris, Combinatorics, 2 Eds., John Wiley & Sons, Inc., 2003.
    [21] U. Shumacher, Suborthogonal double covers of complete graphs by stars, Discret. Appl. Math., 95 (1999), 439-444. doi: 10.1016/S0166-218X(99)00091-8. doi: 10.1016/S0166-218X(99)00091-8
    [22] S. A Hartmann, Symptotic results on suborthogonal G-decompositions of complete digraphs, Discret. Appl. Math., 95 (1999), 311-320. doi: 10.1016/S0166-218X(99)00083-9. doi: 10.1016/S0166-218X(99)00083-9
    [23] S. Hartmann, U. Shumacher, Suborthogonal double covers of complete graphs, Congressus Numerantium, 147 (2000), 33-40.
    [24] R. El-Shanawany, H. Shabana, General cyclic orthogonal double covers of finite regular circulant graphs, Open J. Discret. Math., 4 (2014), 19-27. doi: 10.4236/ojdm.2014.42004. doi: 10.4236/ojdm.2014.42004
    [25] M. Higazy, Suborthogonal double covers of the complete bipartite graphs by all bipartite subgraphs with five edges over finite fields, Far East J. Appl. Math., 91 (2015), 63-80. doi: 10.17654/FJAMApr2015_063_080. doi: 10.17654/FJAMApr2015_063_080
    [26] H. D. O. F. Gronau, M. Grüttmüller, S. Hartmann, U. Leck, V. Leck, On orthogonal double covers of graphs, Design. Code. Cryptogr., 7 (2002), 49-91. doi: 10.1023/A:1016546402248. doi: 10.1023/A:1016546402248
    [27] R. El-Shanawany, M. Higazy, H. Shabana, A. El-Mesady, Cartesian product of two symmetric starter vectors of orthogonal double covers, AKCE Int. J. Graphs Co., 12 (2015), 59-63. doi: 10.1016/j.akcej.2015.06.009. doi: 10.1016/j.akcej.2015.06.009
    [28] S. El-Serafi, R. El-Shanawany, H. Shabana, Orthogonal double cover of complete bipartite graph by disjoint union of complete bipartite graphs, Ain. Shams Eng. J., 6 (2015), 657-660. doi: 10.1016/j.asej.2014.12.002. doi: 10.1016/j.asej.2014.12.002
    [29] R. El-Shanawany, A. El-Mesady, Cyclic orthogonal double covers of circulants by certain nerve cell graphs, Contrib. Discret. Math., 14 (2019), 105-116. doi: 10.11575/cdm.v14i1.62428. doi: 10.11575/cdm.v14i1.62428
    [30] R. El-Shanawany, A. El-Mesady, On cyclic orthogonal double covers of circulant graphs by special infinite graphs, AKCE Int. J. Graphs Co., 14 (2017), 199-207. doi: 10.1016/j.akcej.2017.04.002. doi: 10.1016/j.akcej.2017.04.002
    [31] R. Sampathkumar, S. Srinivasan, Cyclic orthogonal double covers of 4-regular circulant graphs, Discrete Math., 311 (2011), 2417-2422. doi: 10.1016/j.disc.2011.06.021. doi: 10.1016/j.disc.2011.06.021
    [32] R. El-Shanawany, A. El-Mesady, On the one edge algorithm for the orthogonal double covers, Prikl. Diskretn. Mat., 45 (2019), 78-84. doi: 10.17223/20710410/45/8. doi: 10.17223/20710410/45/8
    [33] R. Sampathkumar, Orthogonal double covers of complete bipartite graphs, Australas. J. Comb., 49 (2011), 15-18. Available from: https://ajc.maths.uq.edu.au/pdf/49/ajc_v49_p015.pdf.
    [34] R. El-Shanawany, H. D. O. F. Gronau, M. Grüttmüller, Orthogonal double covers of Kn, n by small graphs, Discret. Appl. Math., 138 (2004), 47-63. doi: 10.1016/S0166-218X(03)00269-5. doi: 10.1016/S0166-218X(03)00269-5
    [35] M. Higazy, R. Scapellato, Y. S. Hamed, A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers, J. Algebr. Comb., 2021. doi: 10.1007/s10801-020-01008-4. doi: 10.1007/s10801-020-01008-4
    [36] R. Scapellato, R. El Shanawany, M. Higazy, Orthogonal double covers of Cayley graphs, Discret. Appl. Math, 157 (2009), 3111-3118. doi: 10.1016/j.dam.2009.06.005. doi: 10.1016/j.dam.2009.06.005
    [37] R. Sampathkumar, S. Srinivasan, More mutually orthogonal graph squares, Utilitas Math., 91 (2013), 345-354.
    [38] R. El-Shanawany, A. El-Mesady, Mutually orthogonal graph squares for disjoint union of stars, Ars Comb., 149 (2020), 83-91.
    [39] M. Higazy, Lambda-mutually orthogonal covers of complete bipartite graphs, Adv. Appl. Discret. Mat., 17 (2016), 151-167. doi: 10.17654/DM017020151. doi: 10.17654/DM017020151
    [40] R. El-Shanawany, A. El-Mesady, On mutually orthogonal certain graph squares, Online J. Anal. Comb., 14 (2020).
    [41] R. Sampathkumar, S. Srinivasan, Mutually orthogonal graph squares, J. Comb. Des., 17 (2009), 369-373. doi: 10.1002/jcd.20216. doi: 10.1002/jcd.20216
    [42] R. El-Shanawany, On mutually orthogonal disjoint copies of graph squares, Note Mat., 36 (2016), 89-98. doi: 10.1285/i15900932v36n2p89. doi: 10.1285/i15900932v36n2p89
    [43] M. Higazy, A. El-Mesady, M. S. Mohamed, On graph-orthogonal arrays by mutually orthogonal graph squares, Symmetry, 12 (2020), 1895. doi: 10.3390/sym12111895. doi: 10.3390/sym12111895
    [44] C. J. Colbourn, J. H. Dinitz, Mutually orthogonal latin squares: A brief survey of constructions, J. Stat. Plan. Infer., 95 (2001), 9-48. doi: 10.1016/S0378-3758(00)00276-7. doi: 10.1016/S0378-3758(00)00276-7
    [45] M. Higazy, A. El-Mesady, E. E. Mahmoud, M. H. Alkinani, Circular intensely orthogonal double cover design of balanced complete multipartite graphs, Symmetry, 12 (2020), 1743. doi: 10.3390/sym12101743. doi: 10.3390/sym12101743
    [46] N. Yu. Erokhovets, Gal's conjecture for nestohedra corresponding to complete bipartite graphs, P. Steklov. Math., 266 (2009), 120-132. doi: 10.1134/S0081543809030079. doi: 10.1134/S0081543809030079
    [47] S. Hartmann, Orthogonal decompositions of complete digraphs, Graph. Combinator., 18 (2002), 285-302. doi: 10.1007/s003730200021. doi: 10.1007/s003730200021
    [48] D. Fronček, A. Rosa, Symmetric graph designs on friendship graphs, J. Comb. Des., 8 (2000), 201-206. doi: 10.1002/(sici)1520-6610(2000)8:3<201::aid-jcd5>3.0.co;2-#. doi: 10.1002/(sici)1520-6610(2000)8:3<201::aid-jcd5>3.0.co;2-#
    [49] H. D. O. F. Gronau, R. C. Mullin, A. Rosa, P. J. Schellenberg, Symmetric graph designs, Graph. Combinator., 16 (2000), 93-102. doi: 10.1007/s003730050006. doi: 10.1007/s003730050006
    [50] P. M. Gergely, Partitions with certain intersection properties, J. Comb. Des., 19 (2011), 345-354. doi: 10.1002/jcd.20290. doi: 10.1002/jcd.20290
    [51] Jr. E. Assmus, J. D. Key, Designs and codes: An update, Code. Des. Geom., 9 (1996), 7-27. doi: 10.1007/BF00169770. doi: 10.1007/BF00169770
    [52] A. E. Brouwer, C. A. Eijl, On the p-rank of the adjacency matrices of strongly regular graphs, J. Algebr. Comb., 1 (1992), 329-346. doi: 10.1023/A:1022438616684. doi: 10.1023/A:1022438616684
    [53] W. H. Haemers, C. Parker, V. Pless, V. D. Tonchev, A design and a code invariant under the simple group Co3, J. Comb. A., 62 (1993), 225-233. doi: 10.1016/0097-3165(93)90045-A. doi: 10.1016/0097-3165(93)90045-A
    [54] V. D. Tonchev, Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs, IEEE T. Inform. Theory, 43 (1997), 1021-1025. doi: 10.1109/18.568714. doi: 10.1109/18.568714
    [55] W. H. Haemers, R. Peeters, J. M. Rijckevorsel, Binary codes of strongly regular graphs, Design. Code. Cryptogr., 17 (1999), 187-209. doi: 10.1023/A:1026479210284. doi: 10.1023/A:1026479210284
    [56] D. Crnković, B. G; Rodrigues, S. Rukavina, L. Simčić, Ternary codes from the strongly regular (45, 12, 3, 3) graphs and orbit matrices of 2-(45, 12, 3) designs, Discrete Math., 312 (2012), 3000-3010. doi: 10.1016/j.disc.2012.06.012. doi: 10.1016/j.disc.2012.06.012
    [57] D. Crnković, M. Maximović, B. Rodrigues, S. Rukavina, Self-orthogonal codes from the strongly regular graphs on up to 40 vertices, Adv. Math. Commun., 10 (2016), 555-582. doi: 10.3934/amc.2016026. doi: 10.3934/amc.2016026
    [58] W. Fish, R. Fray, E. Mwambene, Binary codes from the complements of the triangular graphs, Quaest. Math., 33 (2010), 399-408. doi: 10.2989/16073606.2010.541595. doi: 10.2989/16073606.2010.541595
    [59] M. Grassl, M. Harada, New self-dual additive F4-codes constructed from circulant graphs, Discrete Math., 340 (2017), 399-403. doi: 10.1016/j.disc.2016.08.023. doi: 10.1016/j.disc.2016.08.023
    [60] J. D. Key, B. G. Rodrigues, LCD codes from adjacency matrices of graphs, Appl. Algebr. Eng. Comm., 29 (2018), 227-244. doi: 10.1007/s00200-017-0339-6. doi: 10.1007/s00200-017-0339-6
    [61] D. Leemans, B. G. Rodrigues, Binary codes of some strongly regular subgraphs of the McLaughlin graph, Design. Code. Cryptogr., 67 (2013), 93-109. doi: 10.1007/s10623-011-9589-7. doi: 10.1007/s10623-011-9589-7
    [62] M. Higazy, T. A. Nofal, On network designs with coding error detection and correction application, Comput. Mater. Con., 67 (2021), 3401-3418. doi: 10.32604/cmc.2021.015790. doi: 10.32604/cmc.2021.015790
    [63] W. Fish, J. D. Key, E. Mwambene, Special LCD codes from products of graphs, Appl. Algebr. Eng. Comm., 2021, doi: 10.1007/s00200-021-00517-4. doi: 10.1007/s00200-021-00517-4
  • This article has been cited by:

    1. A. El-Mesady, Omar Bazighifan, S. S. Askar, Serena Matucci, A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes, 2022, 2022, 2314-8888, 1, 10.1155/2022/9308708
    2. A. El-Mesady, Omar Bazighifan, Qasem Al-Mdallal, On infinite circulant-balanced complete multipartite graphs decompositions based on generalized algorithmic approaches, 2022, 61, 11100168, 11267, 10.1016/j.aej.2022.04.022
    3. A. El-Mesady, Omar Bazighifan, Miaochao Chen, Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach, 2022, 2022, 2314-8888, 1, 10.1155/2022/2017936
    4. H. Shabana, R. El-Shanawany, S.R. Halawa, Graph design for data authentication over insecure communication channel, 2023, 75, 11100168, 649, 10.1016/j.aej.2023.05.029
    5. R. Elshanawany, S. R. Halawa, S. A. El-Sheikh, H. Shabana, 2023, Recursive approach for constructing power graph squares, 979-8-3503-2351-1, 1, 10.1109/ICEEM58740.2023.10384655
  • 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(2271) PDF downloads(73) Cited by(5)

Figures and Tables

Figures(2)  /  Tables(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog