Reflections about a single checksum

DOI10.1007/978-3-642-13797-6_17MaRDI QIDQ3578478zbMATH OpenOpenAlexFDO

Authors Ulrich Tamm

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13797-6_17

zbMATH Keywords

distributed computinggroup factorizationperfect codessingle error correctionsteganography

Mathematics Subject Classification ID

Cryptography (94A60) Arithmetic codes (94B40)

Recommendations

• scientific article; zbMATH DE number 4189861
• scientific article; zbMATH DE number 177879
• Sum codes with fixed values of multiplicities for detectable unidirectional and asymmetrical errors for technical diagnostics of discrete systems
• Synthesis of self-checking checkers for codes with addition
• On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

Cited in

(2)

• A remark of \(P_{i,k}\) on elliptic curves and application for Manchester coding
• On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

This page was built for publication: Reflections about a single checksum

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