Results 11 to 20 of about 692,674 (293)
Combinatorial aspects of jump codes [PDF]
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 +4 more sources
Three Combinatorial Perspectives on Minimal Codes [PDF]
SIAM Journal on Discrete Mathematics, 2022 27 ...
Gianira N. Alfarano +3 more
openaire +12 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 +4 more sources
Multiset combinatorial batch codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of $n$ data items on $m$ servers, in such a way that any batch of $k$ data items can be retrieved by reading at most some $t$ symbols from each server. Combinatorial batch codes, are replication-based batch codes in which each server stores a
Hui Zhang 0030 +2 more
openaire +4 more sources
Low-complexity trellis decoding of linear block codes. [PDF]
, 1995 The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S. +2 more
core +4 more sources
On the generalized Hamming weights of certain Reed–Muller-type codes
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 There is a nice combinatorial formula of P. Beelen and M. Datta for the r-th generalized Hamming weight of an a ne cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the r-th generalized Hamming weight for a ...
González-Sarabia Manuel +2 more
doaj +1 more source
Кібернетика та комп'ютерні технології, 2022 Introduction. The application of binary-reflected (mirror, reflexive) Gray codes for solving combinatorial problems with pseudo-Boolean functions (polynomials from Boolean variables) is considered.
Oleksandr Trofymchuk +4 more
doaj +1 more source
Combinatorial Receptor Codes for Odors [PDF]
Cell, 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
Combinatorial representations [PDF]
, 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