30 research outputs found
Cross-Bifix-Free Codes Within a Constant Factor of Optimality
A cross-bifix-free code is a set of words in which no prefix of any length of
any word is the suffix of any word in the set. Cross-bifix-free codes arise in
the study of distributed sequences for frame synchronization. We provide a new
construction of cross-bifix-free codes which generalizes the construction in
Bajic (2007) to longer code lengths and to any alphabet size. The codes are
shown to be nearly optimal in size. We also establish new results on Fibonacci
sequences, that are used in estimating the size of the cross-bifix-free codes
Importance of Symbol Equity in Coded Modulation for Power Line Communications
The use of multiple frequency shift keying modulation with permutation codes
addresses the problem of permanent narrowband noise disturbance in a power line
communications system. In this paper, we extend this coded modulation scheme
based on permutation codes to general codes and introduce an additional new
parameter that more precisely captures a code's performance against permanent
narrowband noise. As a result, we define a new class of codes, namely,
equitable symbol weight codes, which are optimal with respect to this measure
Maximum Distance Separable Codes for Symbol-Pair Read Channels
We study (symbol-pair) codes for symbol-pair read channels introduced
recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair
codes is established and infinite families of optimal symbol-pair codes are
constructed. These codes are maximum distance separable (MDS) in the sense that
they meet the Singleton-type bound. In contrast to classical codes, where all
known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair
codes can have length \Omega(q^2). In addition, we completely determine the
existence of MDS symbol-pair codes for certain parameters
Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Generalized balance tournament packings (GBTPs) extend the concept of
generalized balanced tournament designs introduced by Lamken and Vanstone
(1989). In this paper, we establish the connection between GBTPs and a class of
codes called equitable symbol weight codes. The latter were recently
demonstrated to optimize the performance against narrowband noise in a general
coded modulation scheme for power line communications. By constructing classes
of GBTPs, we establish infinite families of optimal equitable symbol weight
codes with code lengths greater than alphabet size and whose narrowband noise
error-correcting capability to code length ratios do not diminish to zero as
the length grows
Complete Asymptotic and Bifurcation Analysis for a Difference Equation with Piecewise Constant Control
We consider a difference equation involving three parameters and a piecewise constant control function with an additional positive threshold . Treating the threshold as a bifurcation parameter that varies between 0 and , we work out a complete asymptotic and bifurcation analysis. Among other things, we show that all solutions either tend to a limit 1-cycle or to a limit 2-cycle and, we find the exact regions of attraction for these cycles depending on the size of the threshold. In particular, we show that when the threshold is either small or large, there is only one corresponding limit 1-cycle which is globally attractive. It is hoped that the results obtained here will be useful in understanding interacting network models involving piecewise constant control functions.</p
Complete Asymptotic and Bifurcation Analysis for a Difference Equation with Piecewise Constant Control
Generalized balanced tournament designs with block size four
In this paper, we remove the outstanding values m for which the existence of a GBTD(4;m) has not been decided previously. This leads to a complete solution to the existence problem regarding GBTD(4;m)s.Published versio
Maximum distance separable symbol-pair codes
We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound. In contrast to classical codes, where all known q-ary MDS codes have length O(q), we show that q-ary MDS symbol-pair codes can have length Ω(q2). We also construct equidistant cyclic MDS symbol-pair codes from Mendelsohn designs
Design of Active SiC MOSFET Gate Driver for Crosstalk Suppression Considering Impedance Coordination between Gate Loop and Power Loop
UFL1 Alleviates LPS-Induced Apoptosis by Regulating the NF-κB Signaling Pathway in Bovine Ovarian Granulosa Cells
Ubiquitin-like modifier 1 ligating enzyme 1 (UFL1) is an E3 ligase of ubiquitin fold modifier 1 (UFM1), which can act together with its target protein to inhibit the apoptosis of cells. Lipopolysaccharides (LPS) can affect the ovarian health of female animals by affecting the apoptosis of ovarian granulosa cells. The physiological function of UFL1 on the apoptosis of bovine (ovarian) granulosa cells (bGCs) remains unclear; therefore, we focused on the modulating effect of UFL1 on the regulation of LPS-induced apoptosis in ovarian granulosa cells. Our study found that UFL1 was expressed in both the nucleus and cytoplasm of bGCs. The results here demonstrated that LPS caused a significant increase in the apoptosis level of bGCs in cows, and also dramatically increased the expression of UFL1. Furthermore, we found that UFL1 depletion caused a significant increase in apoptosis (increased the expression of BAX/BCL-2 and the activity of caspase-3). Conversely, the overexpression of UFL1 relieved the LPS-induced apoptosis. In order to assess whether the inhibition of bGCs apoptosis involved in the nuclear factor-κB (NF-κB) signaling pathway resulted from UFL1, we detected the expression of NF-κB p-p65. LPS treatment resulted in a significant upregulation in the protein concentration of NF-κB p-p65, and knockdown of UFL1 further increased the phosphorylation of NF-κB p65, while UFL1 overexpression significantly inhibited the expression of NF-κB p-p65. Collectively, UFL1 could suppress LPS-induced apoptosis in cow ovarian granulosa cells, likely via the NF-κB pathway. These results identify a novel role of UFL1 in the modulation of bGC apoptosis, which may be a potential signaling target to improve the reproductive health of dairy cows