Results 11 to 20 of about 13,959 (300)
Combinatorial batch codes [PDF]
Advances in Mathematics of Communications, 2009 In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of [n] items among [m] devices (servers) in such a way that any [k] items can be retrieved by reading at most [t] items from each of the servers.
Maura B Paterson, Douglas R Stinson
exaly +5 more sources
Combinatorial design-based quasi-cyclic LDPC codes with girth eight
Digital Communications and Networks, 2018 This paper presents a novel regular Quasi-Cyclic (QC) Low Density Parity Check (LDPC) codes with column-weight three and girth at least eight. These are designed on the basis of combinatorial design in which subsets applied for the construction of ...
Sina Vafi, Narges Rezvani Majid
doaj +4 more sources
Error characterization and error correction approaches in combinatorial DNA-based storage [PDF]
Scientific ReportsData storage in DNA has recently emerged as a promising archival solution, offering space-efficient and long-lasting digital storage. DNA’s ultra-high density and durability make it an attractive medium for long-term data storage.
Inbal Preuss +5 more
doaj +2 more sources
Three Combinatorial Perspectives on Minimal Codes [PDF]
SIAM Journal on Discrete Mathematics, 2022 27 ...
Gianira N. Alfarano +3 more
openaire +10 more sources
Combinatorial aspects of jump codes
Discrete Mathematics, 2005 Jump codes are a special class of quantum error correcting codes. The authors study combinatorial and symmetry properties of these codes. The paper considers the quantum correction model where errors are detected due to quantum jumps. This means that, for example a state of \(| 1>\) is spontaneously transformed into a state of \(| 0>\).
Chris Charnes, Thomas Beth
openaire +2 more sources
Combinatorial characterizations of authentication codes [PDF]
Designs, Codes and Cryptography, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. R. Stinson
openaire +3 more sources
Combinatorial polarization, code loops, and codes of high level [PDF]
International Journal of Mathematics and Mathematical Sciences, 2004 We first find the combinatorial degree of any map f:V→F, where F is a finite field and V is a finite-dimensional vector space over F. We then simplify and generalize a certain construction, due to Chein and Goodaire, that was used in characterizing code
Petr Vojtechovský
doaj +3 more sources
On the minimum distance of combinatorial codes
IEEE Transactions on Information Theory, 1990 A conjecture of V.C. Da Rocha (see Electron. Lett., vol.21, no.21, p.949-50, 1985) concerning the minimum distance of a class of combinatorial codes is proved. >
L Tolhuizen, J H Van Lint
exaly +2 more sources
Oriented matroids and combinatorial neural codes
Combinatorial 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 +5 more sources
Combinatorial Gray Codes — an Updated Survey
The Electronic Journal of Combinatorics, 2023 A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by a `small change'. Such listings are known for many different combinatorial objects, including bitstrings, combinations, permutations, partitions, triangulations, but also ...
Mütze, Torsten
openaire +4 more sources