Bounds for DNA codes with constant GC-content (Q1408538): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: P. G. Boyvalenkov / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: P. G. Boyvalenkov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0306197 / rank | |||
Normal rank | |||
Latest revision as of 20:25, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for DNA codes with constant GC-content |
scientific article |
Statements
Bounds for DNA codes with constant GC-content (English)
0 references
24 September 2003
0 references
DNA codes of constant GC-content are constant weight codes over an alphabet of four letters. In the paper under review the author uses known bounds and construction techniques to obtain (sometimes explicitly) information for the maximal possible cardinality of DNA codes of fixed length, GC-content and minimum Hamming distance \(d\) both with and without the requirement that the Hamming distance between any codeword and its reverse-complement be at least \(d\).
0 references
constant-weight codes
0 references
DNA codes
0 references
