Algorithmic issues in coding theory

From MaRDI portal





The paper introduces shortly basic definitions in the theory of error-correcting block codes and some of the most common construction of block codes. It is the aim of the author to proof the error-correcting properties of these codes in a simple manner such that a computer scientist with only a basic knowledge of algebra should be able to understand them. In the second half of the paper some algorithmic tasks in error-correction related to the computational complexity of the decoding process are described and several open problems in this area are presented. For the entire collection see [Zbl 0879.00061].











This page was built for publication: Algorithmic issues in coding theory

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