Results 41 to 50 of about 13,959 (300)

On p-Adic Estimates of Weights in Abelian Codes over Galois Rings [PDF]

open access: yes, 2005
Let p be a prime. We prove various analogues and generalizations of McEliece's theorem on the p-divisibility of weights of words in cyclic codes over a finite field of characteristic p. Here we consider Abelian codes over various Galois rings.
Katz, Daniel Jerome
core   +1 more source

Cracking the Combinatorial Semaphorin Code [PDF]

open access: yesNeuron, 2011
In this issue of Neuron, Wu et al. describe a combinatorial code of repulsive Sema-2a and attractive Sema-2b signaling that mediates mechanosensory axonal guidance, fasciculation, and synaptic target selection within the CNS of Drosophila. Their work exemplifies how a detailed, multilevel molecular-genetic analysis (from molecules to behavior) provides
Berke, Brett, Keshishian, Haig
openaire   +2 more sources

QC-LDPC Codes From Difference Matrices and Difference Covering Arrays

open access: yesIEEE Access, 2023
We give a framework that generalizes LDPC code constructions using transversal designs or related structures such as mutually orthogonal Latin squares. Our constructions offer a broader range of code lengths and codes rates. Similar earlier constructions
Diane M. Donovan   +3 more
doaj   +1 more source

Multicolor chromosome bar codes [PDF]

open access: yes, 2006
Chromosome bar codes are multicolor banding patterns produced by fluorescence in situ hybridization (FISH) with differentially labeled and pooled sub-regional DNA probes.
Müller, Stefan, Wienberg, Johannes
core   +1 more source

Bar Code and Janet-like division

open access: yesAtti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2022
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions.
Michela Ceria
doaj   +1 more source

Combinatorial Regression and Improved Basis Pursuit for Sparse Estimation [PDF]

open access: yes, 2012
Sparse representations accurately model many real-world data sets. Some form of sparsity is conceivable in almost every practical application, from image and video processing, to spectral sensing in radar detection, to bio-computation and genomic signal ...
Khajehnejad, M. Amin
core   +1 more source

Orthogonal Combinatorial Raman Codes Enable Rapid High-Throughput-Out Library Screening of Cell-Targeting Ligands

open access: yesResearch, 2023
High-throughput assays play an important role in the fields of drug discovery, genetic analysis, and clinical diagnostics. Although super-capacity coding strategies may facilitate labeling and detecting large numbers of targets in a single assay ...
Yuchen Tang   +2 more
doaj   +1 more source

Research on Universal Combinatorial Coding [PDF]

open access: yesThe Scientific World Journal, 2014
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory.
Jun Lu, Zhuo Zhang, Juan Mo
openaire   +3 more sources

Combinatorial Receptor Codes for Odors [PDF]

open access: yesCell, 1999
The discriminatory capacity of the mammalian olfactory system is such that thousands of volatile chemicals are perceived as having distinct odors. Here we used a combination of calcium imaging and single-cell RT-PCR to identify odorant receptors (ORs) for odorants with related structures but varied odors.
Malnic, Bettina   +3 more
openaire   +3 more sources

UAV‐assisted data dissemination based on network coding in vehicular networks

open access: yesIET Intelligent Transport Systems, 2022
Efficient and emergency data dissemination service in vehicular networks (VN) is very important in some situations, such as earthquakes, maritime rescue, and serious traffic accidents.
Shidong Huang   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy