On applying molecular computation to binary linear codes

DOI10.1109/18.979325MaRDI QIDQ4544803zbMATH OpenOpenAlexFDO

Authors Karl-Heinz Zimmermann

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.979325

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Efficient DNA sticker algorithms for NP-complete graph problems
• scientific article; zbMATH DE number 1156876
• scientific article; zbMATH DE number 1860687
• scientific article; zbMATH DE number 1072534
• scientific article; zbMATH DE number 1343483

Cited in

(8)

• Efficient DNA sticker algorithms for NP-complete graph problems
• scientific article; zbMATH DE number 1241377 (Why is no real title available?)
• scientific article; zbMATH DE number 1072534 (Why is no real title available?)
• scientific article; zbMATH DE number 1953210 (Why is no real title available?)
• scientific article; zbMATH DE number 2087503 (Why is no real title available?)
• DNA computing approach for automated test pattern generation for digital circuits
• Genetic code-based DNA computation for the Hamiltonian path problem
• Molecular solution to the optimal linear arrangement problem based on DNA computation

This page was built for publication: On applying molecular computation to binary linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544803)