Results 51 to 60 of about 13,959 (300)
Combinatorial Bounds for Authentication Codes with Arbitration [PDF]
Designs, Codes and Cryptography, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaoru Kurosawa, Satoshi Obana
openaire +1 more source
On the minimum stopping sets of product codes [PDF]
Transactions 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
On combinatorial structures in linear codes
CoRR, 2023 In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in Ω(k), \ |K_i| \in Ω(d)$, and the $K_i$'s are $\tildeΩ( \sqrt{{k}/{n}})$-expander. If the codes are classical we show instead that the $K_i$'s are $\tildeΩ\left({{k}/{n}}\right)$-expander.
openaire +2 more sources
Code‐aware combinatorial interaction testing [PDF]
IET 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 +5 more sources
, 2011 23pp. Submitted to J. Combinatorial Theory (Series A)arXiv:1109.1216v1 [math.CO]23pp. Submitted to J. Combinatorial Theory (Series A)23pp. Submitted to J.
Maximilien Gadouleau +10 more
core +1 more source
Coding Techniques for Data-Storage Systems [PDF]
, 2008 As information-bearing objects, data-storage systems are natural consumers of information-theoretic ideas. For many issues in data-storage systems, the best trade-off between cost, performance and reliability, passes through the application of error ...
Cassuto, Yuval
core +1 more source
DNA Code Design Based on the Bloch Quantum Chaos Algorithm
IEEE 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
PIR Codes from Combinatorial Structures
, 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 +3 more sources
Recognizing and realizing inductively pierced codes
Journal 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
Combinatorial NLTS From the Overlap Gap Property [PDF]
QuantumIn an important recent development, Anshu, Breuckmann, and Nirkhe \cite{anshu2022nlts} resolved positively the so-called No Low-Energy Trivial State (NLTS) conjecture by Freedman and Hastings.
Eric R. Anschuetz +2 more
doaj +1 more source