Results 41 to 50 of about 692,674 (293)

Combinatorial Bounds for Authentication Codes with Arbitration [PDF]

open access: yesDesigns, Codes and Cryptography, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaoru Kurosawa, Satoshi Obana
openaire   +3 more sources

psp-codes/reduced-decoy-ensemble: Public Release

open access: yes, 2020
This is the public release of the codes for the project detailed in the manuscript titled "Reducing Ensembles of Protein Tertiary Structures Generated De Novo via Clustering".
psp-codes
core   +1 more source

On the minimum stopping sets of product codes [PDF]

open access: yesTransactions on Combinatorics, 2018
It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding. In this paper, the number of minimum stopping sets of a product code is determined by the number of the minimum stopping
Morteza Hivadi, Akbar Zare Chavoshi
doaj   +1 more source

Code‐aware combinatorial interaction testing [PDF]

open access: yesIET Software, 2019
Combinatorial interaction testing (CIT) is a useful testing technique to address the interaction of input parameters in software systems. CIT has been used as a systematic technique to sample the enormous test possibilities. Most of the research activities focused on the generation of CIT test suites as a computationally complex problem.
Bestoun S. Ahmed   +5 more
openaire   +7 more sources

DNA Code Design Based on the Bloch Quantum Chaos Algorithm

open access: yesIEEE Access, 2017
The design of DNA codes sets satisfying certain combinatorial constraints is important in reducing hybridization errors due to nonspecific hybridization between distinct codes and their complements in DNA computing, data encryption, and data storage. The
Qingji Guo   +4 more
doaj   +1 more source

Oriented matroids and combinatorial neural codes

open access: yesCombinatorial Theory, 2023
A combinatorial neural code $\mathscr C\subseteq 2^{[n]}$ is convex if it arises as the intersection pattern of convex open subsets of $\mathbb R^d$. We relate the emerging theory of convex neural codes to the established theory of oriented matroids, both categorically and with respect to geometry and computational complexity.
Alexander B. Kunin   +2 more
openaire   +4 more sources

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

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

PIR Codes from Combinatorial Structures

open access: yes, 2023
A $k$-server Private Information Retrieval (PIR) code is a binary linear $[m,s]$-code admitting a generator matrix such that for every integer $i$ with $1\le i\le s$ there exist $k$ disjoint subsets of columns (called recovery sets) that add up to the vector of weight one, with the single $1$ in position $i$.
Giulietti, Massimo   +2 more
openaire   +5 more sources

Recognizing and realizing inductively pierced codes

open access: yesJournal of Computational Geometry, 2023
We prove algebraic and combinatorial characterizations of the class of inductively pierced codes, resolving a conjecture of Gross, Obatake, and Youngs. Starting from an algebraic invariant of a code called its canonical form, we explain how to compute a
Nora Youngs   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy