Processing math: 100%
Research article

Weight-2 input sequences of 1/n convolutional codes from linear systems point of view

  • Received: 15 June 2022 Revised: 19 August 2022 Accepted: 05 September 2022 Published: 11 October 2022
  • MSC : 94B10, 93C05, 11T71

  • Convolutional codes form an important class of codes that have memory. One natural way to study these codes is by means of input state output representations. In this paper we study the minimum (Hamming) weight among codewords produced by input sequences of weight two. In this paper, we consider rate 1/n and use the linear system setting called (A,B,C,D) input-state-space representations of convolutional codes for our analysis. Previous results on this area were recently derived assuming that the matrix A, in the input-state-output representation, is nonsingular. This work completes this thread of research by treating the nontrivial case in which A is singular. Codewords generated by weight-2 inputs are relevant to determine the effective free distance of Turbo codes.

    Citation: Victoria Herranz, Diego Napp, Carmen Perea. Weight-2 input sequences of 1/n convolutional codes from linear systems point of view[J]. AIMS Mathematics, 2023, 8(1): 713-732. doi: 10.3934/math.2023034

    Related Papers:

    [1] Muhammad Amir Asif, Rashad Ismail, Ayesha Razaq, Esmail Hassan Abdullatif Al-Sabri, Muhammad Haris Mateen, Shahbaz Ali . An application on edge irregular reflexive labeling for mt-graph of cycle graph. AIMS Mathematics, 2025, 10(1): 1300-1321. doi: 10.3934/math.2025060
    [2] Mohamed Basher . On the reflexive edge strength of the circulant graphs. AIMS Mathematics, 2021, 6(9): 9342-9365. doi: 10.3934/math.2021543
    [3] Gohar Ali, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková, Ahmad ALoqaily, Nabil Mlaiki . Modular total vertex irregularity strength of graphs. AIMS Mathematics, 2023, 8(4): 7662-7671. doi: 10.3934/math.2023384
    [4] Martin Bača, Muhammad Imran, Zuzana Kimáková, Andrea Semaničová-Feňovčíková . A new generalization of edge-irregular evaluations. AIMS Mathematics, 2023, 8(10): 25249-25261. doi: 10.3934/math.20231287
    [5] Ali N. A. Koam, Ali Ahmad, Martin Bača, Andrea Semaničová-Feňovčíková . Modular edge irregularity strength of graphs. AIMS Mathematics, 2023, 8(1): 1475-1487. doi: 10.3934/math.2023074
    [6] Fatma Salama, Randa M. Abo Elanin . On total edge irregularity strength for some special types of uniform theta snake graphs. AIMS Mathematics, 2021, 6(8): 8127-8148. doi: 10.3934/math.2021471
    [7] Mohamed Basher . Edge irregular reflexive labeling for the r-th power of the path. AIMS Mathematics, 2021, 6(10): 10405-10430. doi: 10.3934/math.2021604
    [8] Wei Gao, Zahid Iqbal, Shehnaz Akhter, Muhammad Ishaq, Adnan Aslam . On irregularity descriptors of derived graphs. AIMS Mathematics, 2020, 5(5): 4085-4107. doi: 10.3934/math.2020262
    [9] Sadik Delen, Ismail Naci Cangul . Effect of edge and vertex addition on Albertson and Bell indices. AIMS Mathematics, 2021, 6(1): 925-937. doi: 10.3934/math.2021055
    [10] Kooi-Kuan Yoong, Roslan Hasni, Gee-Choon Lau, Muhammad Ahsan Asim, Ali Ahmad . Reflexive edge strength of convex polytopes and corona product of cycle with path. AIMS Mathematics, 2022, 7(7): 11784-11800. doi: 10.3934/math.2022657
  • Convolutional codes form an important class of codes that have memory. One natural way to study these codes is by means of input state output representations. In this paper we study the minimum (Hamming) weight among codewords produced by input sequences of weight two. In this paper, we consider rate 1/n and use the linear system setting called (A,B,C,D) input-state-space representations of convolutional codes for our analysis. Previous results on this area were recently derived assuming that the matrix A, in the input-state-output representation, is nonsingular. This work completes this thread of research by treating the nontrivial case in which A is singular. Codewords generated by weight-2 inputs are relevant to determine the effective free distance of Turbo codes.



    In this paper, we discuss certain discrete fractional boundary value problems in the form

    {L+1α(α0(v()))+α0(L+1α(v()))+φp(v())=λf(,v()),[1,L]N0,v(0)=v(L+1)=0, (Pfλ)

    where 1<p<, α(0,1), λ>0, L+1α and α0 are the right and left discrete nabla fractional difference operators, f:[1,L]N0×RR is continuous, and φp stands for the operator that is defined in the usual way by φp(s)=|s|p2s.

    In this paper, we want to utilize a version of Ricceri's variational principle as given in [1]. We build the energy functional and we take some assumptions on the nonlinear term to get a functional that satisfies the conditions in the key theorem. In fact, by first requiring a simple algebraic inequality condition on the nonlinear term for small values of the parameter and requiring an additional asymptotical behavior of the potential at zero if f(,0)=0, the existence of one nontrivial solution is achieved. Moreover, we deduce the existence of solutions for small positive values of the parameter such that the corresponding solutions have smaller and smaller energies as the parameter goes to zero. Then, under an appropriate oscillating behavior of the nonlinear term, we discuss the existence of an unbounded sequence of solutions. We give exact collections for the parameter for each results, which cannot be found in other works in the literature related to these types of discrete problems.

    As is well known, fractional differential equations (FDEs) are valuable tools when modeling many phenomena in various areas of science and engineering. We refer to [2,3,4,5,6,7,8] and the references therein for a range of applications of FDEs in control, electrochemistry, viscoelasticity, electromagneticity, porous media, and other fields. Classical tools that have been employed in the study of nonlinear FDEs (see [9,10,11] and their references) include fixed point theory, monotone iterative methods, coincidence theory, and the upper and lower solutions method.

    Thanks to their wide range of applications in many fields such as science, economics, ecology, neural networks, cybernetics, etc., nonlinear difference equations have been studied extensively for the last 50 years. In addition, boundary value problems involving difference equations have received a lot of attention, see, e.g., [12,13,14,15] and references therein. Difference equations subjected to many different kinds of boundary conditions have also been extensively studied by using various techniques. A popular technique has been to use variational methods [16,17,18]. In the last few years, many researchers have investigated nonlinear problems of this type through various approaches. Moreover, such boundary value problems for ordinary differential equations, difference equations, and dynamic equations on time scales have been studied extensively, but there are only a few papers dealing with fractional boundary value problems, besides [19,20,21], especially for discrete fractional boundary value problems involving Caputo fractional difference operators. For example, Lv [22], by using the fixed point theorem of Schaefer, under certain nonlinear growth assumptions, obtained the existence of solutions to a discrete fractional boundary value problem. Furthermore, in [23,24], some existence and multiplicity results for (p,q)-Laplacian problems were considered. For example, in [23], by using suitable variational arguments and Ljusternik–Schnirelmann category theory, the multiplicity and concentration of positive solutions for (p,q)-Laplacian problems were obtained.

    In view of the facts presented above, in the current study, we discuss the existence of at least one solution to the boundary value problem (Pfλ), as well as the existence of an infinite number of solutions of (Pfλ). Our primary tool is [1, Theorem 2.1], which is a more precise variant of the famous variational principle of Ricceri [25]. In Theorem 9 below, we show that, subject to certain assumptions, the boundary value problem (Pfλ) possesses at least one nontrivial solution. We also offer Example 17, where all hypotheses of our Theorem 9 are satisfied. We present a series of remarks concerning our results. Moreover, under suitable assumptions of the oscillatory behavior at infinity of the nonlinearity, we investigate the existence of an infinite number of solutions for the boundary value problem (Pfλ). We prove the existence of a definite interval about λ, in which the boundary value problem (Pfλ) admits a sequence of solutions, which is unbounded in the space V, to be introduced later (Theorem 18). We present an example that illustrates Theorem 20 (see Example 21). Moreover, some corollaries of Theorem 18 are offered. Under different assumptions, we ensure the existence of a sequence of pairwise different solutions that strongly converges to zero (see Theorem 26).

    The paper is set up as follows. In Section 2, we remind the reader of some basic definitions and our main tool. In Sections 3 and 4, we state and prove our main results.

    The key argument in our results is the next version of the variational principle by Ricceri [25, Theorem 2.1], as presented in [1].

    Theorem 1. Suppose that X is a reflexive real Banach space. Assume that Φ,Ψ:XR are Gâteaux-differentiable functionals such that Ψ is sequentially weakly upper semicontinuous, and Φ is strongly continuous, sequentially weakly lower semicontinuous, and coercive. For every r>infXΦ, let us put

    φ(r):=infvΦ1(,r)supvΦ1(,r)Ψ(v)Ψ(v)rΦ(v)

    and

    θ:=lim infrφ(r),δ:=lim infr(infXΦ)+φ(r).

    One then has the following.

    (a) For every r>infXΦ and each λ(0,1φ(r)), the restriction of the functional Iλ=ΦλΨ to Φ1(],r[) possesses a global minimum, and this global minimum is a critical point, i.e., a local minimum, of Iλ in X.

    (b) If 0<θ<, then, for all λ(0,1θ), either

    (b1) Iλ possesses a global minimum, or

    (b2) for all nN, Iλ has a critical point un, and

    limnΦ(vn)=.

    (c) If 0<δ<, then, for all λ(0,1δ), either

    (c1) Φ possesses a global minimum, which is a local minimum of Iλ, or

    (c2) a sequence of pairwise different critical points of Iλ exists, and this sequence converges weakly to a global minimum of Φ.

    We refer to [9,26,27,28], in which Theorem 1 was applied successfully in order to prove the existence of at least one nontrivial solution for certain boundary value problems, and [29,30,31,32,33], in which Theorem 1 has been successfully employed in order to prove the existence of an infinite number of solutions for certain boundary value problems.

    In this section, we present several foundational definitions, notations, and results that are used in the remainder of this paper.

    Definition 2 (see [34]). (ⅰ) For mN, the m rising factorial of t is defined as

    t¯m=m1k=0(t+k),t¯0=1.

    (ⅱ) For tR{,2,1,0} and αR, the α rising function is increasing on N0 and

    t¯α=Γ(t+α)Γ(t),0¯α=0.

    Definition 3 (see [34]). For f defined on Na1b+1N, a<b, α(0,1), the left Caputo discrete fractional nabla difference operator is given by

    (Cαa1f)()=1Γ(1α)s=asf(s)(ρ(s))¯α(Na), (1)

    the right Caputo discrete fractional nabla difference operator is given by

    (Cb+1αf)()=1Γ(1α)bs=(Δsf)(s)(sρ())¯α(bN), (2)

    the left Riemann discrete fractional nabla difference operator is given by

    (Rαa1f)()=1Γ(1α)s=af(s)(ρ(s))¯α=1Γ(α)s=af(s)(ρ(s))¯α1(Na),

    the right Riemann discrete fractional nabla difference operator is given by

    (Rb+1αf)()=1Γ(1α)(Δ)bs=(f(s))(sρ())¯α=1Γ(α)bs=(f(s))(sρ())¯α1(bN),

    where ρ()=1 is the backward jump operator.

    Example 4. Let us give an example concerning Definition 3. Consider f:Na1b+1NR defined by f()1. For this f, from (1) and (2), we have

    Cαa11=Cb+1α1=0,NabN. (3)

    The relations among the right and left Riemann and Caputo nabla fractional difference operators are

    (Cαa1f)()=(Rαa1f)()(a+1)¯αΓ(1α)f(a1), (4)
    (Cb+1αf)()=(Rb+1αf)()(b+1)¯αΓ(1α)f(b+1). (5)

    Thus, by (3)–(5), we have

    Rb+1α1=(b+1)¯αΓ(1α),Rαa11=(a+1)¯αΓ(1α),NabN.

    With respect to the domains of the various fractional-type difference operators, we observe the following:

    (ⅰ) The nabla left fractional operator αa1 maps functions defined on a1N to functions defined on aN.

    (ⅱ) The nabla right fractional operator b+1α maps functions defined on b+1N to functions defined on bN.

    One can show that for α0, we have αa1f()f() and for α1, we have αa1f()f(). We note that the Caputo and Riemann nabla fractional difference operators for 0<α<1 coincide when f vanishes at the end points, i.e., f(a1)=0=f(b+1) (see (4), (5), and [2]). So, for convenience, for the remainder of this paper, we use the symbol αa1 instead of Cαa1 or Rαa1 and b+1α instead of Cb+1α or Rb+1α.

    Now we present the discrete fractional summation by parts formula.

    Theorem 5. (see [35, Theorem 4.4]). For f,g:NabNR, a<b, and α(0,1), the formulas

    b=af()(αa1g)()=b=ag()(b+1αf)()

    and

    b=af()(b+1αg)()=b=ag()(αa1f()

    hold.

    In order to give the variational formulation of the boundary value problem (Pfλ), let us introduce the finite L-dimensional Banach space

    V={v:[0,L+1]N0R:v(0)=v(L+1)=0},

    which is equipped with the norm

    v=(L=1|v()|2)12.

    According to the definition of the norm, the following lemma is obvious.

    Lemma 6. For all α(0,1) and for all vV, we have

    v=max[1,L]N0|v()|v. (6)

    For every vV, we define the functionals Φ and Ψ as

    Φ(v)=12L=1|(α0v)()|2+|(L+1αv)()|2+1pL=1|v()|p (7)

    and

    Ψ(v)=L=1F(,v()), (8)

    and we put

    Iλ(v)=Φ(v)λΨ(v).

    Definition 7. A (weak) solution of (Pfλ) is defined to be any function vV such that

    L=1{(α0v)()(α0˜v)()+(L+1αv)()(L+1α˜v)()}+L=1|v()|p2v()˜v()λL=1f(,v())˜v()=0 (9)

    for every ˜vV.

    Note that since V is a finite-dimensional space, every weak solution is a usual solution of the boundary value problem (Pfλ).

    Lemma 8. Let vV. Then v is a critical point of Iλ in V if and only if v solves (Pfλ).

    Proof. First assume that vV is a critical point of Iλ. Then, for any ˜vV, (9) holds. Bearing in mind that ˜vV is arbitrary, we get

    L+1α(α0(v()))+α0(L+1α(v()))+|v()|p1v()λf(,v())=0

    for all [1,L]N. Therefore, v solves (Pfλ). Since v was chosen arbitrarily, we deduce that all critical points of the functional Iλ in V solve (Pfλ). Conversely, if v solves (Pfλ), then, by reversing the above steps, the proof is completed.

    Put

    F(,ξ)=ξ0f(,x)dxfor all(,ξ)[1,L]N0×R.

    The following is our main result concerning the existence of a solution of (Pfλ).

    Theorem 9. Assume that f(,0)=0 and

    supθ>0θpL=1max|x|θF(,x)>p(L+1)p(p2)4 (10)

    and there are discrete intervals D=[1,L1]N0[1,L]N0 and B=[1,L2]N0[1,L1]N0 with L1,L22, such that

    lim supξ0+essinfBF(,ξ)|ξ|p=

    and

    lim infξ0+essinfDF(,ξ)|ξ|p>.

    Then, for every

    λΛ:=(0,(L+1)p(p2)4psupθ>0θpL=1max|x|θF(,x)),

    the boundary value problem (Pfλ) admits at least one nontrivial solution vλV.

    Proof. Our goal is to apply Theorem 1 to (Pfλ). We utilize the functionals Φ and Ψ as introduced in (7) and (8), respectively. Let us demonstrate that Φ and Ψ meet the required assumptions of Theorem 1. As V is embedded compactly in (C0([1,L]N0),R), we know that Ψ is Gâteaux-differentiable, and its Gâteaux derivative Ψ(v)V at vV is given by

    Ψ(v)(v)=L=1f(,v())˜v()

    for each ˜vV, and Ψ is sequentially weakly upper semicontinuous. Furthermore, Φ is also Gâteaux-differentiable, and its Gâteaux derivative at vV is the functional Φ(v)V given by

    Φ(v)(˜v)=L=1{(α0v())(α0˜v())+(L+1αv())(L+1α˜v())}+L=1|v()|p2v()˜v()

    for every ˜vV. Furthermore, by the definition of Φ, we observe that it is sequentially weakly lower semicontinuous and strongly continuous. Now, in light of (7), for each vV, we obtain

    1p(L+1)p(p2)4vpΦ(v)2L(L+1)v2+1p(L+1)2p2vp. (11)

    By employing the left inequality of (11), we get

    limvΦ(v)=.

    In other words, Φ is coercive. Using (10), there is ˉθ>0 with

    ˉθpL=1max|x|ˉθF(,x)>p(L+1)p(p2)4.

    Put

    r:=(L+1)p(p2)4pˉθp.

    From the way Φ is defined and considering (6), (7), and (11), since r>0, we have

    Φ1(,r)={vV:Φ(v)<r}{vV:vppr(L+1)p(p2)4}{vV:vppr(L+1)p(p2)4}={vV:vpˉθp},

    which implies

    supΦ(v)<rΨ(v)=supΦ(v)<rL=1F(,v())L=1max|x|ˉθF(,x).

    By considering these computations, as 0Φ1(,r) and Φ(0)=Ψ(0)=0, we get

    φ(r)=inf˜vΦ1(,r)(supvΦ1(,r)Ψ(v))Ψ(˜v)rΦ(˜v)supvΦ1(,r)Ψ(v)rp(L+1)p(p2)4L=1max|x|ˉθF(,x)ˉθp.

    Hence, we put

    λ=(L+1)p(p2)4psupθ>0θpL=1max|x|θF(,x).

    At this point, thanks to Theorem 1, for each λ(0,λ)(0,1φ(r)), Theorem 1 shows that Iλ possesses at least one critical point (local minimum) vλΦ1(,r). We show that vλ cannot be the trivial function. Let us prove

    lim supv0+Ψ(v)Φ(v)=. (12)

    Due to our required conditions at zero, we can find a sequence {ξk}R+ that converges to zero, and ζ>0 and κ with

    limkessinfBF(,ξk)|ξk|p=

    and

    essinfDF(,ξ)κ|ξ|p,ξ[0,ζ].

    Let [1,L3]N0[1,L2]N0, where L32, and let ˜vV be such that

    (ⅰ) ˜v()[0,1] for all [1,L]N0,

    (ⅱ) ˜v()=1R for all [1,L3]N0,

    (ⅲ) ˜v()=0 for all [L1+1,L]N0.

    Therefore, we fix an arbitrary Y>0 and η>0 with

    Y<ηL3+κL=L3+1|˜v()|p1p(L+1)2p2˜vp.

    Thus, there is n0N with εn<ζ and

    essinfBF(,ξn)η|ξn|p

    for all n>n0. Next, for all n>n0, using 0ξn˜v()<ζ for all large enough n, by (11), we get

    Ψ(ξn˜v)Φ(ξn˜v)=L3=1F(,ξn)+L=L3+1F(,ξn˜v())Φ(ξn˜v)>ηL3+κL=L3+1|˜v()|p1p(L+1)2p2˜vp>Y.

    Since Y can be as large as we desire, we conclude that

    limnΨ(ξn˜v)Φ(ξn˜v)=,

    which implies (12). Thus, we have a sequence {υn}V that converges strongly to zero, υnΦ1(,r), and

    Iλ(υn)=Φ(υn)λΨ(υn)<0.

    Since vλ is a global minimum of the restriction of Iλ to Φ1(,r), we get

    Iλ(vλ)<0, (13)

    and thus vλ is not trivial. The proof is complete.

    Some comments are given next.

    Remark 10. In Theorem 9, we sought for the critical points of Iλ, a functional that is intrinsically connected to the boundary value problem (Pfλ). We observe that, in a general case, Iλ may not be bounded in V. To see this, consider, for instance, the situation when f(ξ)=1+ξγ1 for each ξR, where γ>p. Let vV{0} and μR. We then find

    Iλ(μv)=Φ(μv)λL=1F(μv())2μ2L(L+1)v2+μpp(L+1)2p2vp+λμLvλμγγLvγ

    as μ. Thus, [36, (I2) in Theorem 2.2] is not satisfied. Therefore, we are unable to use direct minimization to find the critical points of Iλ.

    Remark 11. Note that Iλ is not coercive. To see this, let s(p,) and define F by F(ξ)=|ξ|s for each ξR. Let vV{0} and μR. We then find

    Iλ(μv)=Φ(μv)λL=1F(μv())2μ2L(L+1)v2+μpp(L+1)2p2vpλμsLvs

    as μ.

    Remark 12. If, in Theorem 9, f satisfies f(,x)0 for almost every (,x)[1,L]N0×R, then (10) assumes the simpler form

    supθ>0θpL=1F(,θ)>p(L+1)p(p2)4. (14)

    Moreover, if the assumption

    lim supθθpL=1F(,θ)>p(L+1)p(p2)4

    is satisfied, then (14) automatically holds.

    Remark 13. From (13), we can directly see that

    (0,λ)λIλ(vλ) (15)

    is indeed a negative map. Furthermore, we have

    limλ0+vλ=0.

    Indeed, by considering that Φ is coercive and that for λ(0,λ), the solution vλΦ1(,r), we have the existence of L>0 with vλL for every λ(0,λ). Next, it is also easy to see that M>0 exists with

    |L=1f(,vλ())vλ()|MvλML (16)

    for each λ(0,λ). Since vλ is a critical point of Iλ, Iλ(vλ)(˜v)=0 for any ˜vV and each λ(0,λ). In particular, Iλ(vλ)(vλ)=0, i.e.,

    Φ(vλ)(vλ)=λL=1f(,vλ())vλ() (17)

    for every λ(0,λ). Then, since

    0(L+1)p(p2)4vpΦ(vλ)(vλ),

    by using (17), it is concluded that

    0(L+1)p(p2)4vpΦ(vλ)(vλ)λL=1f(,vλ())vλ()

    for all λ(0,λ). If we now let λ0+, by (16), then we get limλ0+vλ=0. One has

    limλ0+vλ=0.

    Finally, we prove that

    λIλ(vλ) (18)

    decreases strictly in (0,λ). We observe that for all vV, we have

    Iλ(v)=λ(Φ(v)λΨ(v)). (19)

    Now, let 0<λ1<λ2<λ and let vλ1, vλ2 be the global minima of the functional Iλi restricted to Φ(,r) for i=1,2. Moreover, let

    mλi=(Φ(vλi)λiΨ(vλi))=inf˜vΦ1(,r)(Φ(˜v)λiΨ(˜v))

    for i=1,2. Obviously, (15), in connection with (19) and λ>0, yields

    mλi<0fori=1,2.

    In addition,

    mλ2mλ1, (20)

    because 0<λ1<λ2. Then, by observing (19)–(20) and as 0<λ1<λ2, we get

    Iλ2(ˉvλ2)=λ2mλ2λ2mλ1<λ1mλ1=Iλ1(ˉvλ1),

    so that (18) decreases strictly for λ(0,λ). Since λ<λ is arbitrary, we see that (18) indeed decreases strictly in (0,λ).

    Remark 14. We note that Theorem 9 represents a bifurcation result in the sense that (0,0) belongs to the closure of

    {(vλ,λ)V×(0,):vλ is a nontrivial solution of (Pfλ)}

    in V×R. To observe this, by Remark 13, we get

    vλ0asλ0.

    Therefore, there are sequences {vj} in V and {λi} in R+ (here, vj=vλ) with

    λi0+andvj0

    as j. In addition, we want to emphasize that because

    (0,λ)λIλ(vλ)

    is a strictly decreasing map, for all λ1,λ2(0,λ) such that λ1λ2, the solutions ˉvλ1 and ˉvλ2 ensured by Remark 13 are distinct.

    Remark 15. Under the assumption that f0, the solution that is ensured by Theorem 9 is nonnegative. To observe this, suppose that v0 is a nontrivial solution of (Pfλ). Assume that

    A={[1,L]N0:v0()<0}

    has positive measure. Put ˉ˜v()=min{0,v0()} for each [1,L]N0. We obtain ˉ˜vV and

    L=1{(α0v0())(α0ˉ˜v())+(L+1αv0())(α0ˉ˜v())}+L=1|v0()|p2v0()ˉ˜v()λL=1f(,v0())ˉ˜v()=0.

    Thus, from our imposed data sign assumptions, we have

    0(L+1)p(p2)4vpAA{(α0v0())2+(L+1αv0())2}+A|v0()|p=λAf(,v0())v0()0.

    Hence, v0=0 in A, which is impossible.

    The next result concerns a particular case of the previously presented results, in which the function f depends only on the second variable, considering the nonautonomous case of the problem.

    Theorem 16. Let f:RR be nonnegative with f(0)=0. Let F(ξ)=ξ0f(x)dx for all xR. Assume that

    limξ0+F(ξ)ξp=.

    Then, for every

    λ(0,(L+1)p(p2)4Lpsupθ>0θpF(θ)),

    the boundary value problem

    {L+1α(α0(v()))+α0(L+1α(v()))+φp(v())=λf(v()),[1,L]N0,v(0)=v(L+1)=0,

    possesses at least one nontrivial solution vλV satisfying

    limλ0+vλ=0,

    and the real function

    λ12L=1{|(α0v)()|2+|(L+1αv)()|2}+1pL=1|v()|pλL=1F(v())

    is negative and decreases strictly in (0,(L+1)p(p2)4Lpsupθ>0θpF(θ)).

    Finally, we present the following example to illustrate Theorem 16.

    Example 17. Let p=4 and L=2. We consider the problem

    {312(120(v()))+120(312(v()))+φ4(v())=λf(v()),{1,2},v(0)=v(3)=0, (21)

    where

    f(ξ)=34ξ3+2tan(ξ)sec2(ξ)+eξ,ξR.

    By simple computations, we have

    F(ξ)=ξ4+sec2(ξ)+eξ2,ξR.

    We see that all assumptions of Theorem 16 are satisfied, and this implies that the boundary value problem (21), for each λ(0,98), admits at least one nontrivial solution vλV such that

    limλ0+vλ=0,

    and the real function

    λ122=1{|(120v)()|2+|(312v)()|2}+142=1|v()|4λ2=1F(v())

    is negative and strictly decreasing in (0,98).

    Put

    B=lim supξL=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp.

    Our main result concerning the existence of infinitely many solutions of (Pfλ) is as follows.

    Theorem 18. Assume that two sequences {an} and {bn} exist with

    limnbn=

    such that

    a2n(Γ(1α))2L=1|¯α|2+Lapnp<(L+1)p(p2)4pbpnfor allnN, (A1)
    A=limnL=1max|t|bnF(,t)L=1F(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp)<B. (A2)

    In this case, for all λ(1B,1A), the boundary value problem (Pfλ) possesses an unbounded sequence of solutions.

    Proof. Our aim is to employ Theorem 1. We utilize the functionals Φ and Ψ as introduced in (7) and (8), respectively. Therefore, we observe that the regularity assumptions on Φ and Ψ, as required in Theorem 1, are satisfied. Hence vV is a solution of (Pfλ) if and only if v is a critical point of the function Iλ. Put

    rn=(L+1)p(p2)4pbpnfor allnN.

    We see that rn>0 for all nN. From the way Φ is defined and in light of (6), (8), and (11), for each rn>0, we have

    Φ1(,rn)={vV:Φ(v)<rn}{vV:vpprn(L+1)p(p2)4}{vV:vpprn(L+1)p(p2)4}={vV:vpbpn},

    which implies

    supΦ(v)<rnΨ(v)=supΦ(v)<rnL=1F(,v())L=1max|x|bnF(,x).

    Now, for each nN, we define

    υ()={anif[1,L]N0,0if{0,L+1}.

    Clearly, υV. Since υ vanishes at the end points (that is, υ(0)=0=υ(L+1)), its Riemann and Caputo fractional differences coincide. Hence, for any N1LN, we have

    (L+1αυ)()=(RL+1αυ)()=(CL+1αυ)()=an(L+1)¯αΓ(1α)

    and

    (α0υ)()=(Rα0υ)()=(Cα0υ)()=an()¯αΓ(1α).

    Thus,

    Φ(υ)=12L=1{|(α0υ)()|2+|(L+1αυ)()|2}+1pL=1|υ()|p=12L=1{|an()¯αΓ(1α)|2+|an(L+1)¯αΓ(1α)|2}+Lapnp=a2n2(Γ(1α))2L=1|¯α|2+|(L+1)¯α|2+Lapnp=a2n(Γ(1α))2L=1|¯α|2+Lapnp.

    We have

    Ψ(υ)=L=1F(,υ())=L=1F(,an).

    In addition, from (A1), we have Φ(υn)<rn. Thus, for all large enough values of n, we obtain

    φ(rn)=inf˜vΦ1(,rn)supvΦ1(,r)Ψ(v)Ψ(˜v)rnΦ(˜v)supvΦ1(,rn)Ψ(v)L=1F(,υ())rnΦ(υ)=supvΦ1(,rn)Ψ(v)L=1F(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp)L=1max|x|bnF(,x)L=1F(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp). (22)

    Hence, due to (A2), we get

    γlimnφ(rn)A<.

    Now, we can verify that Iλ is unbounded from below. First, assume that B=. Accordingly, fix N such that

    N<c2n(Γ(1α))2L=1|¯α|2+Lcpnp

    and let cn>0 for all nN such that cn as n and

    L=1F(,cn)>Nfor allnN.

    For each nN, define

    yn()=cnfor all[1,L]N0.

    Thus, ynV and

    Φ(yn)=c2n(Γ(1α))2L=1|¯α|2+Lcpnp.

    Therefore,

    Iλ(yn)=c2n(Γ(1α))2L=1|¯α|2+LcpnpλL=1F(,cn)<c2n(Γ(1α))2L=1|¯α|2+LcpnpλN,

    that is, limnIλ(yn)=. Next, suppose B<. As λ>1B, we can find ε>0 with ε<B1λ. Thus, again letting cn>0 for all nN such that cn as n and

    L=1F(,cn)>Bεfor allnN,

    as argued above, and by letting ynV as before, we obtain

    Iλ(yn)=c2n(Γ(1α))2L=1|¯α|2+LcpnpλL=1F(,cn)<c2n(Γ(1α))2L=1|¯α|2+Lcpnpλ(Bε).

    Therefore, limnIλ(yn)=. Hence, in either case, Iλ is not bounded from below. This completes the proof.

    Remark 19. If {an} and {bn} are real sequences such that limnbn= and such that (A1) from Theorem 18 is satisfied, then, assuming that A=0 and B=, Theorem 18 ensures that for each λ>0, the boundary value problem (Pfλ) admits an infinite number of solutions.

    Theorem 20. Assume that

    lim infξL=1max|x|ξF(,x)(L+1)p(p2)4pξp<lim supξL=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp. (A3)

    In this case, for all

    λ(ξ2(Γ(1α))2L=1|¯α|2+LξppL=1F(,ξ),(L+1)p(p2)4pξpL=1max|x|ξF(,x)),

    the boundary value problem (Pfλ) possesses an unbounded sequence of solutions.

    Proof. We pick bn>0 for all nN with bn as n and

    limnL=1max|x|bnF(,x)(L+1)p(p2)4pbpn=lim infξL=1max|x|ξF(,x)(L+1)p(p2)4pξp.

    Now, as Φ(0)=Ψ(0)=0, we may take an=0 for all nN in (22), and then the conclusion follows from Theorem 1.

    Now, we present an example that illustrates Theorem 20.

    Example 21. Let p=4 and L=3. We consider the boundary value problem

    {412(120(v()))+120(412(v()))+φ4(v())=λf(v()),{1,2,3},v(0)=v(4)=0, (23)

    where

    f(x)={0ifx(,0],4x3+4x3sin(πex)+πx4excos(πex))ifx(0,).

    Some computation yields

    F(x)={0ifx(,0],x4(1+sin(πex))ifx(0,).

    Since

    lim infξ3=1max|x|ξF(x)64ξ4=0

    and

    lim supξ3=1F(ξ)ξ2(Γ(1/2))23=1|¯12|2+3ξ44=8,

    we clearly see that all assumptions of Theorem 20 are satisfied, and then (23), for every λ(18,), has an unbounded sequence of solutions in {v:[0,4]N0R:v(0)=v(4)=0}.

    Here, we point out several simple corollaries of our main results.

    Corollary 22. Suppose that there are real sequences {an} and {bn} with bn as n and such that (A1) from Theorem 18 holds, A<1, and B>1. Then, the boundary value problem

    {L+1α(α0(v()))+α0(L+1α(v()))+φp(v())=f(,v()),[1,L]N0,v(0)=v(L+1)=0 (Pf)

    possesses an unbounded sequence of solutions.

    Corollary 23. Suppose B>1 and

    lim infξL=1max|x|ξF(,x)(L+1)p(p2)4pξp<1.

    Then the boundary value problem (Pf) possesses an unbounded sequence of solutions.

    Corollary 24. Suppose that there are real sequences {an} and {bn} with bn as n and such that (A1) from Theorem 18 holds, f1C([1,L]N0×R,R), and

    F1(,x)=x0f1(,ξ)dξfor all(,x)[0,L]N0×R.

    Moreover, assume

    limnL=1max|x|bnF1(,x)L=1F1(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp)< (A4)

    and

    lim supξL=1F1(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp=. (A5)

    Then, for all fiC([1,L]N0×R,R), by writing

    Fi(,x)=x0fi(,ξ)dξfor all(,x)[1,L]N0×R

    for 2in, such that

    max{supξRFi(,ξ):2in}0

    and

    min{lim infξFi(,ξ)ξ2:2in}>,

    for all

    λ(0,1limnL=1max|x|bnF1(,x)L=1F1(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp)),

    the boundary value problem

    {L+1α(α0(v()))+α0(L+1α(v()))+φp(v())=λfi(,v()),[1,L]N0,v(0)=v(L+1)=0 (24)

    has an unbounded sequence of solutions.

    Proof. Put F(,ξ)=ni=1Fi(,ξ) for (,ξ)[1,L]N0×R. (A4), along with

    min{lim infξFi(,ξ)ξ2:2in}>,

    ensures

    lim supξL=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp=lim supξni=1L=1Fi(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp=.

    Moreover, Assumption (A4), together with the condition

    max(supξRFi(,ξ):2in)0,

    implies

    limnL=1max|x|bnF(,x)L=1F(,σn)(L+1)p(p2)4pbpn(σ2n(Γ(1α))2L=1|¯α|2+Lσpnp)limnL=1max|x|bnF1(,x)L=1F1(,an)(L+1)p(p2)4pbpn(a2n(Γ(1α))2L=1|¯α|2+Lapnp)<.

    Hence, an application of Theorem 18 completes the proof.

    Corollary 25. Let f1C([1,L]N0×R,R) and put

    F1(,x)=x0f1(,ξ)dξfor all(,x)[1,L]N0×R.

    Assume that

    lim infξL=1max|x|σ(ξ)F1(,x)(L+1)p(p2)4pξp<

    and

    lim supξL=1F1(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp=.

    Then, for all fiC([1,L]N0×R,R), by writing

    Fi(,x)=x0fi(,ξ)dξfor all(,x)[1,L]N0×R

    for 2in, such that

    max{supξRFi(,ξ):2in}0

    and

    min{lim infξFi(,ξ)ξp:2in}>,

    for all

    λ(0,1lim infξL=1max|x|ξF(,x)(L+1)p(p2)4pξp),

    the boundary value problem (24) has an unbounded sequence of solutions.

    Now put

    B0=lim supξ0L=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp.

    With a proof similar to the proof of Theorem 18, but this time using Theorem 1 (c) instead of Theorem 1 (b), we can establish the next result. The proof is similar to the proof of Theorem 18, but here we have a real sequence {en} which tends to zero at constructing r, because in Theorem 1 (c) for δ, it requires r(infXΦ)+ instead of in Theorem 1 (b) for θ, it requires r.

    Theorem 26. Suppose that there are real sequences {dn} and {en} with limnen=0 such that

    d2n(Γ(1α))2L=1|¯α|2+Ldpnp<(L+1)p(p2)4pepnfor everynN, (A6)
    A0=limnL=1max|x|enF(,x)L=1F(,dn)(L+1)p(p2)4pepnd2n(Γ(1α))2L=1|¯α|2+Ldpnp<B0. (A7)

    Then, for each

    λ(λ3,λ4)withλ3:=1B0andλ4:=1A0,

    the boundary value problem (Pfλ) possesses a sequence of pairwise different solutions that strongly converges to 0 in V.

    Theorem 27. Suppose

    lim infξ0+L=1max|x|ξF(,x)(L+1)p(p2)4pξp<lim supξ0L=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp. (A8)

    Then, for each

    λ(1lim supξ0L=1F(,ξ)ξ2(Γ(1α))2L=1|¯α|2+Lξpp,1lim infξ0+L=1max|x|ξF(,x)(L+1)p(p2)4pξp),

    the boundary value problem (Pfλ) has a sequence of pairwise different solutions that converges strongly to 0 in V.

    Remark 28. By employing Theorem 26, we may obtain results that are similar to Remark 19 and Corollaries 22–25.

    In this paper, we investigated the existence of one and of infinitely many solutions for a class of discrete fractional boundary value problems. As a matter of fact, by demanding an algebraic condition on the nonlinear term for small values of the parameter and requiring an additional asymptotical behavior of the potential at zero, we obtain the existence of at least one nontrivial solution for the problem. Moreover, under suitable assumptions on the oscillatory behavior at infinity of the nonlinearity, for exact collections of the parameter, we get the existence of a sequence of solutions for the problem. The main results improve and extend recent results from the literature. We also presented some examples that illustrate the applicability of the main results. The main technique of the proofs involves variational methods and critical point theorems for smooth functionals.

    There is no conflict of interest.

    No AI tools have been used in the preparation of this study.



    [1] S. Benedetto, G. Montorsi, Design of parallel concatenated convolutional codes, IEEE T. Commun., 44 (1996), 591–600. https://doi.org/10.1109/26.494303 doi: 10.1109/26.494303
    [2] C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo Codes (1), Proc. of IEEE ICC 93– IEEE International Conference on Communications, 2 (1993), 1064–1070. https://doi.org/10.1109/ICC.1993.397441 doi: 10.1109/ICC.1993.397441
    [3] R. Bru, R. Cantó, B. Ricarte, V. Rumchev, A Basic Canonical Form of Discrete-time Compartmental Systems, Int. J. Contemp. Math. Sciences, 2 (2007), 261–273. http://dx.doi.org/10.12988/ijcms.2007.07020 doi: 10.12988/ijcms.2007.07020
    [4] P. Campillo, A. Devesa, V. Herranz, C. Perea, Modelization of turbo encoder from linear system point of view, Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering (CMMSE 2010), (2010), 314–317.
    [5] B. Cantó, C. Coll, E. Sánchez, On positive behaviour of periodic control systems, Appl. Math. Comput., 161 (2005), 779–786. https://doi.org/10.1016/j.amc.2003.03.001 doi: 10.1016/j.amc.2003.03.001
    [6] M. V. Carriegos, N. De Castro-García, Partitions of elements in a monoid and its applications to systems theory, Linear Algebra Appl., 491 (2016), 161–170. https://doi.org/10.1016/j.laa.2015.05.034 doi: 10.1016/j.laa.2015.05.034
    [7] N. De Castro-García, M. V. Carriegos, A. L. Muñoz Castañeda, A characterization of von Neumann rings in terms of linear systems, Linear Algebra Appl., 494 (2016), 236–244. https://doi.org/10.1016/j.laa.2016.01.019 doi: 10.1016/j.laa.2016.01.019
    [8] J.-J. Climent, V. Herranz, C. Perea, A first approximation of concatenated convolutional codes from linear systems theory viewpoint, Linear Algebra Appl., 425 (2007), 673–699. https://doi.org/10.1016/j.laa.2007.03.017 doi: 10.1016/j.laa.2007.03.017
    [9] J.-J. Climent, V. Herranz, C. Perea, Linear system modelization of concatenated block and convolutional codes, Linear Algebra Appl., 429 (2008), 1191–1212. https://doi.org/10.1016/j.laa.2007.09.006 doi: 10.1016/j.laa.2007.09.006
    [10] J.-J. Climent, D. Napp, C. Perea, R. Pinto, Maximum distance separable 2D convolutional codes, IEEE T. Inform. Theory, 62 (2016), 669–680. https://doi.org/10.1109/TIT.2015.2509075 doi: 10.1109/TIT.2015.2509075
    [11] J. J. Climent, V. Herranz, C. Perea, Parallel concatenated convolutional codes from linear systems theory viewpoint, Systems and Control Letters, 96 (2016), 15–22. https://doi.org/10.1016/j.sysconle.2016.06.016 doi: 10.1016/j.sysconle.2016.06.016
    [12] D. Divsalar, F. Pollara, Low Rate Turbo Codes for Deep Space Communications, Proceedings of 1995 IEEE Int. Symp. Info. Theory, (1995). https://doi.org/10.1109/ISIT.1995.531137
    [13] D. Divsalar, F. Pollara, Multiple turbo codes for deep-space communications, The Telecommunications and Data Acquisition Progress Report, (1995).
    [14] D. Divsalar, R. J. McEliece, The effective free distance of turbo codes, Electron. Lett., 32 (1996), 445–446. https://doi.org/10.1049/el:19960321 doi: 10.1049/el:19960321
    [15] D. Divsalar, R. J. McEliece, On the design of generalized concatenated coding systems with interleavers, TMO Progress Report 42-134, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA, (1998).
    [16] M. I. García-Planas, E. M. Soudit, L. E. Um, Convolutional codes under linear systems point of view. Analysis of output-controllability, WSEAS Press. World Scientific and Engineering Academy and Society, 11 (2012), 2224–2880.
    [17] M. I. García-Planas, N. deCastro, Concatenated linear systems over rings and their application to construction of concatenated families of convolutional codes, Linear algebra appl., 542 (2017), 624–647. https://doi.org/10.1016/j.laa.2017.12.009 doi: 10.1016/j.laa.2017.12.009
    [18] V. Herranz, D. Napp, C. Perea, Serial concatenation of a block code and a 2D convolutional code, Multidim. syst. sign. p., 30 (2019), 1113–1127. https://doi.org/10.1007/s11045-018-0591-3 doi: 10.1007/s11045-018-0591-3
    [19] V. Herranz, D. Napp, C. Perea, 1/n Turbo Codes from linear system point of view, Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 114 (2020). https://doi.org/10.1007/s13398-020-00850-2
    [20] S. Hong, R. Wu, On deep holes of generalized Reed-Solomon codes, AIMS Mathematics, 1 (2016), 96–101. https://doi.org/10.3934/Math.2016.2.96 doi: 10.3934/Math.2016.2.96
    [21] J. Lieb, J. Rosenthal, Erasure decoding of convolutional codes using first order representations, Math. Control Signal., 33 (2021), 499–513. https://doi.org/10.1007/s00498-021-00289-9 doi: 10.1007/s00498-021-00289-9
    [22] T. Kailath, Linear Systems, Prentice Hall information and system sciences series, Prentice-Hall, 1980.
    [23] J. L. Massey, M. K. Sain, Codes, automata, and continuous systems: explicit interconnections, IEEE T. Automat. Contr., 12 (1967), 644–650.} https://doi.org/10.1109/TAC.1967.1098736 doi: 10.1109/TAC.1967.1098736
    [24] R. J. McEliece, The algebraic theory of convolutional codes, Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. North-Holland: Elsevier (1998), 1065–1138.
    [25] A. L. M. Castañeda, J. M. Muñoz-Porras, F. J. Plaza-Martín, Rosenthal's Decoding Algorithm for Certain 1-Dimensional Convolutional Codes, IEEE T. Inform. Theory, 65 (2019), 7736–7741. https://doi.org/10.1109/TIT.2019.2921370 doi: 10.1109/TIT.2019.2921370
    [26] D. Napp, R. Pereira, R. Pinto, P. Rocha, Periodic state-space representations of periodic convolutional codes, Cryptography and Communications, 11 (2019), 585–595. https://doi.org/10.1007/s12095-018-0313-6 doi: 10.1007/s12095-018-0313-6
    [27] B. Ricarte, S. Romero-Vivó, An algebraic approach to the structural properties of positive state control systems, Math. Method. Appl. Sci., 41 (2018), 2370–2378. https://doi.org/10.1002/mma.4351 doi: 10.1002/mma.4351
    [28] J. Rosenthal, J. M. Schumacher, E. V. York, On behaviors and convolutional codes, IEEE T. Inform. Theory, 42 (1996), 1881–1891. https://doi.org/10.1109/18.556682 doi: 10.1109/18.556682
    [29] J. Rosenthal, E. V. York, BCH convolutional codes, IEEE T. Inform. Theory, 45 (1999), 1833–1844. https://doi.org/10.1109/18.782104 doi: 10.1109/18.782104
    [30] J. Rosenthal, Connections between linear systems and convolutional codes, Codes, Systems and Graphical Models, ser. The IMA Volumes in Mathematics and its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 123 (2001), 39–66. https://doi.org/10.1007/978-1-4613-0165-3_2
    [31] R. M. Roth, A. Lempel, On MDS codes via Cauchy matrices, IEEE T. Inform. Theory, 35 (1989), 1314–1319. https://doi.org/10.1109/18.45291 doi: 10.1109/18.45291
    [32] R. Smarandache, J. Rosenthal, Construction of Convolutional Codes using Methods from Linear Systems Theory, Proc. of the 35-th Annual Allerton Conf. on Commun., Control, and Computing, (1997), 953–960.
    [33] R. Smarandache, J. Rosenthal, A state space approach for constructing MDS rate 1/n convolutional codes, Proc. of the 1998 IEEE Inform. Theory Workshop (ITW 1998), (1998), 116–117. https://doi.org/10.1109/ITW.1998.706461
    [34] X. F. Xu, Y. C. Xu, S. F. Hong, Some results on ordinary words of standard Reed-Solomon codes, AIMS Mathematics, 4 (2019), 1336–1347. https://doi.org/10.3934/math.2019.5.1336 doi: 10.3934/math.2019.5.1336
  • 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(1491) PDF downloads(74) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog