一类小缺陷码的链条件

利用射影几何方法在小缺陷码中,NMDS码是链条件码;给出k维NμMDS(0μk-2)码满足链条件的一个充要条件与一些易判断的充分条件.     

Codes Over the p-adic Integers

We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4).     

Novel aromatic carboxamides from dehydroabietylamine as potential fungicides: Design,synthesis and antifungal evaluation

The present study was carried out to design and synthesize a number of novel aromatic carboxamide derivatives of dehydroabietylamine. The preliminary antifungal assay indicated that most of title compounds displayed moderate to good antifungal activity toward the six fungal strains in vitro. Compounds 3i, 3q, 4b and 4d showed significant antifungal activity against Sclerotinia sclerotiorum, with EC₅₀ values ranging from 0.067 ～ 0.393 mg/L. Compounds 3i, 4b and 4d also showed pronounced mycelial growth inhibition activities against B. cinerea and A. solani. Furthermore, in the in vivo assay, compound 4b exhibited brilliant protective activity against S. sclerotiorum-infected rape leaves. Meanwhile, the in vivo bioassay on tomato plants infected by B. cinerea showed that compound 3i and 4d displayed excellent protective activity at 200 mg/L, which were near to boscalid. Primary mechanistic study revealed that 4b could inhibit sclerotia formation as well as reduce the exopolysaccharide level. SEM and TEM analysis indicated that 4b possessed a strong ability to destroy the surface morphology of mycelia, cell structure and seriously interfere with the growth of the fungal pathogen. In addition, 4b exhibited good inhibitory activity (IC₅₀ = 23.3 ± 1.6 μM) toward succinate dehydrogenase (SDH). Molecular modeling study confirmed the binding modes between compound 4b and SDH. The above antifungal results and fungicidal mechanism study revealed that this class of dehydroabietylamine derivatives could be potential SDH inhibitors and lead compounds for novel fungicides development.     

Classification of Graeco‐Latin Cubes

A q‐ary code of length n, size M, and minimum distance d is called an code. An code with is said to be maximum distance separable (MDS). Here one‐error‐correcting () MDS codes are classified for small alphabets. In particular, it is shown that there are unique (5, 5³, 3)₅ and (5, 7³, 3)₇ codes and equivalence classes of (5, 8³, 3)₈ codes. The codes are equivalent to certain pairs of mutually orthogonal Latin cubes of order q, called Graeco‐Latin cubes.     

Deciphering the Role of Filamin B Calponin-Homology Domain in Causing the Larsen Syndrome,Boomerang Dysplasia,and Atelosteogenesis Type I Spectrum Disorders via a Computational Approach

Filamins (FLN) are a family of actin-binding proteins involved in regulating the cytoskeleton and signaling phenomenon by developing a network with F-actin and FLN-binding partners. The FLN family comprises three conserved isoforms in mammals: FLNA, FLNB, and FLNC. FLNB is a multidomain monomer protein with domains containing an actin-binding N-terminal domain (ABD 1–242), encompassing two calponin-homology domains (assigned CH1 and CH2). Primary variants in FLNB mostly occur in the domain (CH2) and surrounding the hinge-1 region. The four autosomal dominant disorders that are associated with FLNB variants are Larsen syndrome, atelosteogenesis type I (AOI), atelosteogenesis type III (AOIII), and boomerang dysplasia (BD). Despite the intense clustering of FLNB variants contributing to the LS-AO-BD disorders, the genotype-phenotype correlation is still enigmatic. In silico prediction tools and molecular dynamics simulation (MDS) approaches have offered the potential for variant classification and pathogenicity predictions. We retrieved 285 FLNB missense variants from the UniProt, ClinVar, and HGMD databases in the current study. Of these, five and 39 variants were located in the CH1 and CH2 domains, respectively. These variants were subjected to various pathogenicity and stability prediction tools, evolutionary and conservation analyses, and biophysical and physicochemical properties analyses. Molecular dynamics simulation (MDS) was performed on the three candidate variants in the CH2 domain (W148R, F161C, and L171R) that were predicted to be the most pathogenic. The MDS analysis results showed that these three variants are highly compact compared to the native protein, suggesting that they could affect the protein on the structural and functional levels. The computational approach demonstrates the differences between the FLNB mutants and the wild type in a structural and functional context. Our findings expand our knowledge on the genotype-phenotype correlation in FLNB-related LS-AO-BD disorders on the molecular level, which may pave the way for optimizing drug therapy by integrating precision medicine.     

Constacyclic codes over finite commutative semi-simple rings

Finite commutative semi-simple rings are direct sum of finite fields. In this study, we investigate the algebraic structure of λ-constacyclic codes over such finite semi-simple rings. Among others, necessary and sufficient conditions for the existence of self-dual, LCD, and Hermitian dual-containing λ-constacyclic codes over finite semi-simple rings are provided. Using the CSS and Hermitian constructions, quantum MDS codes over finite semi-simple rings are constructed.     

On the Number of k‐Dominating Independent Sets

We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.     

Types of superregular matrices and the number of n‐arcs and complete n‐arcs in PG (r,q)

Based on the classification of superregular matrices, the numbers of non‐equivalent n‐arcs and complete n‐arcs in PG(r, q) are determined (i) for 4 ≤ q ≤ 19, 2 ≤ r ≤ q ? 2 and arbitrary n, (ii) for 23 ≤ q ≤ 32, r = 2 and n ≥ q ? 8<$>. The equivalence classes over both PGL (k, q) and PΓL(k, q) are considered throughout the examinations and computations. For the classification, an n‐arc is represented by the systematic generator matrix of the corresponding MDS code, without the identity matrix part of it. A rectangular matrix like this is superregular, i.e., it has only non‐singular square submatrices. Four types of superregular matrices are studied and the non‐equivalent superregular matrices of different types are stored in databases. Some particular results on t(r, q) and m′(r, q)—the smallest and the second largest size for complete arcs in PG(r, q)—are also reported, stating that m′(2, 31) = 22, m′(2, 32) = 24, t(3, 23) = 10, and m′(3, 23) = 16. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 363–390, 2006     

XOR-based Visual Cryptography Schemes

A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has goodresolution, contrast and colour properties.Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show that n out of n schemes with optimal resolution and contrast exist, and that (2,n) schemes are equivalent to binary codes. It turns out that these schemes have much better resolution than their OR-based counterparts. Secondly, we provide two explicit constructions for general k out of n schemes. Finally, we derive bounds on the contrast and resolution of XOR-based schemes. It follows from these bounds that for k<n, the contrast is strictly smaller than one. Moreover, the bounds imply that XOR-based k out of n schemes for even k are fundamentally different from those for odd k.AMS Classification: 94A60