Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept
Information Processing Letters
Hi-index | 0.89 |
A new class of SEC-DED codes based on integer arithmetic is presented. The proposed approach is characterized by linear time complexity of coding and decoding procedures and constant time complexity of the single-bit error correction procedure. In addition, the presented codes can protect an arbitrary number of data bits, which makes them suitable for use in a wide range of communication systems.