Linear constructions for DNA codes
From MaRDI portal
Publication:1779298
DOI10.1016/j.tcs.2004.11.004zbMath1080.68034OpenAlexW2129910432MaRDI QIDQ1779298
Oliver D. King, Philippe Gaborit
Publication date: 1 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.004
Linear codes (general theory) (94B05) Bounds on codes (94B65) Protein sequences, DNA sequences (92D20)
Related Items (34)
A novel approach for constructing reversible codes and applications to DNA codes over the ring \(\mathbb{F}_2 [u /(u^{2 k} - 1)\)] ⋮ Generalized weights and the Ball-Blokhuis congruence ⋮ On cyclic DNA codes over \({\mathbb {F}}_2+u{\mathbb {F}}_2\) ⋮ On a generalization of lifted polynomials over finite fields and their applications to DNA codes ⋮ DNA codes over two noncommutative rings of order four ⋮ Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\) ⋮ Reversible \(G^k\)-codes with applications to DNA codes ⋮ Quasi-cyclic codes: algebraic properties and applications ⋮ Reversible complement cyclic codes over Galois rings with application to DNA codes ⋮ Unnamed Item ⋮ Deterministic polynomial-time algorithms for designing short DNA words ⋮ Construction of cyclic DNA codes over the ring \(\mathbb{Z}_4 [u / \langle u^2 - 1 \rangle\) based on the deletion distance] ⋮ Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing ⋮ Construction of DNA codes by using algebraic number theory ⋮ Unnamed Item ⋮ Construction of single-deletion-correcting DNA codes using CIS codes ⋮ Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing ⋮ Cyclic codes over \(\mathbb F_2[u/(u^4-1)\) and applications to DNA codes] ⋮ Designing DNA codes from reversible self-dual codes over \(\mathrm{GF}(4)\) ⋮ Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance] ⋮ Biological computation of the solution to the quadratic assignment problem ⋮ Molecular solution to the optimal linear arrangement problem based on DNA computation ⋮ DNA cyclic codes over the ring 𝔽2[u,v/〈u2 − 1,v3 − v,uv − vu〉] ⋮ Construction of reversible self-dual codes ⋮ Dipole codes attractively encode glue functions ⋮ Greedy construction of DNA codes and new bounds ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content ⋮ DNA codes for nonadditive stem similarity ⋮ On cyclic DNA codes over \(F_2+uF_2+u^2F_2\) ⋮ DNA codes over finite local Frobenius non-chain rings of length 4 ⋮ On conflict free DNA codes ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\), constant GC-content and a reverse-complement constraint ⋮ Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm ⋮ On the linear codes over the ring Z₄+v₁Z₄+...+v_{t}Z₄
Uses Software
Cites Work
- DNA sequence design using templates
- Bounds for DNA codes with constant GC-content
- Strand design for biomolecular computation.
- Sticky-free and overhang-free DNA languages
- Some ternary and quaternary codes and associated sphere packings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Fundamentals of Error-Correcting Codes
- Error-correcting codes over an alphabet of four elements
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear constructions for DNA codes
