Results 241 to 250 of about 74,437 (278)
TC-HUR: A Tri-Phase Cauchy-Assisted Hunger Games Search and Unified Runge-Kutta Optimizer for Robust DNA Data Storage. [PDF]
Int J Mol SciÖztürk B +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Computing, 1980
We consider families $\{ {\bf C}(n,k):O \leqq k \leqq n\} $ where each ${\bf C}(n,k)$ is a set of combinatorial objects, $C(n,k) = |{\bf C}(n,k)|$ satisfies a recursion $C(n,k)= a_{n,k}C(n - 1,k - 1) + b_{n,k} C(n - 1,k)$, and each object in ${\bf C}(n,k)$ is represented by an n-vector. We study “loop-free” or “uniformly bounded transition” algorithms,
Dennis E White
exaly +3 more sources
We consider families $\{ {\bf C}(n,k):O \leqq k \leqq n\} $ where each ${\bf C}(n,k)$ is a set of combinatorial objects, $C(n,k) = |{\bf C}(n,k)|$ satisfies a recursion $C(n,k)= a_{n,k}C(n - 1,k - 1) + b_{n,k} C(n - 1,k)$, and each object in ${\bf C}(n,k)$ is represented by an n-vector. We study “loop-free” or “uniformly bounded transition” algorithms,
Dennis E White
exaly +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
Data Compression Conference, 2003. Proceedings. DCC 2003, 2003
Summary form only given. A novel binary entropy code, called combinatorial coding (CC), is presented. The theoretical basis for CC has been described previously under the context of universal coding, enumerative coding, and minimum description length. The code described in these references works as follows: assume the source data are binary of length M,
Vito Dai, Avideh Zakhor
openaire +1 more source
Summary form only given. A novel binary entropy code, called combinatorial coding (CC), is presented. The theoretical basis for CC has been described previously under the context of universal coding, enumerative coding, and minimum description length. The code described in these references works as follows: assume the source data are binary of length M,
Vito Dai, Avideh Zakhor
openaire +1 more source
Coding Combinatorial Sources With Costs
IEEE Transactions on Information Theory, 2003Summary: We consider coding infinite sequences of a finite alphabet. The source is defined as a set of sequences (combinatorial source). The problem is to minimize the worst asymptotic compression ratio between each sequence and its coding output among the sequences in the combinatorial source.
Joe Suzuki, Boris Ryabko
openaire +1 more source
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory, 2001Summary: In order to protect copyrighted material, codes may be embedded in the content or codes may be associated with the keys used to recover the content. Codes can offer protection by providing some form of traceability (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in recent years.
Ruizhong Wei
exaly +4 more sources