Results 31 to 40 of about 74,437 (278)
Research on Universal Combinatorial Coding [PDF]
The 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
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
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
Entanglement-assisted quantum low-density parity-check codes [PDF]
, 2010 This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory.
C. J. Colbourn +25 more
core +4 more sources
UAV‐assisted data dissemination based on network coding in vehicular networks
IET 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
Classification of large partial plane spreads in $PG(6,2)$ and related combinatorial objects [PDF]
, 2018 In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space partitions of ...
Honold, Thomas +2 more
core +2 more sources
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 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
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