On combinatorial DNA word design
We consider the problem of designing DNA codes, namely sets of equi-length words over
the alphabet {A, C, G, T} that satisfy certain combinatorial constraints. This problem is …
the alphabet {A, C, G, T} that satisfy certain combinatorial constraints. This problem is …
Spherical codes generated by binary partitions of symmetric pointsets
T Ericson, V Zinoviev - IEEE transactions on information theory, 1995 - ieeexplore.ieee.org
Several constructions are presented by which spherical codes are generated from groups of
binary codes. In the main family of constructions the codes are generated from equally …
binary codes. In the main family of constructions the codes are generated from equally …
Strand design for biomolecular computation
A Brenneman, A Condon - Theoretical Computer Science, 2002 - Elsevier
The design of DNA or RNA strands for DNA computations poses many new questions in
algorithms and coding theory. DNA strand design also arises in use of molecular bar codes …
algorithms and coding theory. DNA strand design also arises in use of molecular bar codes …
On the constructions of constant-weight codes
FW Fu, AJH Vinck, SY Shen - IEEE Transactions on Information …, 1998 - ieeexplore.ieee.org
Two methods of constructing binary constant-weight codes from (1) codes over GF (q) and
(2) constant-weight codes over GF (q) are presented. Several classes of binary optimum …
(2) constant-weight codes over GF (q) are presented. Several classes of binary optimum …
[PDF][PDF] The serial concatenation of rate-1 codes through uniform random interleavers
HD Pfister, PH Siegel - PROCEEDINGS OF THE ANNUAL …, 1999 - pfister.ee.duke.edu
The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers Page 1
The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers Henry D …
The Serial Concatenation of Rate-1 Codes Through Uniform Random Interleavers Henry D …
Constant weight codes for multiaccess channels without feedback
S Abdul-Jabbar, P de Laval - 8th European Conference on …, 1988 - ieeexplore.ieee.org
The design of superimposed codes for the multiaccess OR-channel is considered. The
performance of constant-weight codes when used as superimposed codes is investigated …
performance of constant-weight codes when used as superimposed codes is investigated …
Nonlinear unequal error-protection codes are sometimes better than linear ones
EK Englund - IEEE transactions on information theory, 1991 - ieeexplore.ieee.org
The parameters of some binary nonlinear two-level unequal error-protection (UEP) codes
are evaluated and compared with nonexistence bounds for linear UEP codes. The major …
are evaluated and compared with nonexistence bounds for linear UEP codes. The major …
Constructive codes with unequal error protection
EK Englund, AI Hansson - IEEE Transactions on Information …, 1997 - ieeexplore.ieee.org
An asymptotic lower bound on the rates of two-level binary codes with unequal error
protection is presented. The bound is based on a class of codes that are constructive in the …
protection is presented. The bound is based on a class of codes that are constructive in the …
[图书][B] Rank distance bicodes and their generalization
WBV Kandasamy, F Smarandache, NS Babu… - 2010 - books.google.com
Page 1 - "..." D L Titligiri £" 10|| olomolog2.J. e *: £o #: £o go', #: "olomolo,010' * - - - #:
Tolomonolol Coltovo. |-- - on 100,000,000 - WB WaSallia KalliaSally - Horentin …
Tolomonolol Coltovo. |-- - on 100,000,000 - WB WaSallia KalliaSally - Horentin …
Varshamov-Gilbert bounds for generalized concatenated codes in Euclidean space
T Ericson - SBT/IEEE International Symposium on …, 1990 - ieeexplore.ieee.org
The author suggests the Varshamov-Gilbert bound as a method for evaluating and
comparing various possible inner codes. The advantage is that in this way an evaluation can …
comparing various possible inner codes. The advantage is that in this way an evaluation can …