Abstract
We describe and explore so-called linear hash functions and show how they can be used to build error detection and correction codes. The method can be applied for different types of errors (for example, burst errors). When the method is applied to a model where the number of distorted letters is limited, the obtained estimate of its performance is slightly better than the known Varshamov–Gilbert bound. We also describe random code whose performance is close to the same boundary, but its construction is much simpler. The proposed error correction codes are close to those obtained in the theory of linear codes, but there are examples when the proposed algorithms are more efficient.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.