Linear constructions for DNA codes
From MaRDI portal
Publication:1779298
DOI10.1016/j.tcs.2004.11.004zbMath1080.68034MaRDI QIDQ1779298
Philippe Gaborit, Oliver D. King
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
Related Items
Biological computation of the solution to the quadratic assignment problem, Molecular solution to the optimal linear arrangement problem based on DNA computation, Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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