Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings

DOI10.1007/s40314-022-01767-9OpenAlexW4283831929WikidataQ113898709 ScholiaQ113898709MaRDI QIDQ2167358

Reginaldo jun. Palazzo, Gustavo Terra Bastos, Mario E. Duarte-González

Publication date: 25 August 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-01767-9

zbMATH Keywords

cyclic codescodes over ringsChinese remainder theoremprotein identification

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) General commutative ring theory (13A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MDS and self-dual codes over rings
• Cyclic codes over the integers modulo \(p^m\).
• Self-dual codes over rings and the Chinese remainder theorem
• Transmission of intra-cellular genetic information: a system proposal
• On BCH codes over arbitrary integer tings (Corresp.)
• Codes over Zm, revisited
• On the decoding of Reed-Solomon and BCH codes over integer residue rings
• MDR codes over Z/sub k/
• On the Hamming distance of linear codes over a finite chain ring
• Cyclic product codes
• Codes over certain rings

This page was built for publication: Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings