On the performance of binary extremal self-dual codes
The authors investigate an important measure for the quality of a code -- its decoding error probability. In the paper the authors compare different types of codes with regard to the decoding error probability. They give a good survey on the problem and review some of the known results about it. In the last two sections the authors investigate the performance of extremal self-dual codes of type I and type-I codes with minimal shadow vs type-II codes. They prove two theorems that show a comparison of the performance of codes with special parameters.
- Performance of ternary double circulant, double twistulant, and self-dual codes
- On the performance of optimal double circulant even codes
- The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
- Extremal binary self-dual codes
- A projection decoding of a binary extremal self-dual code of length 40
- Performance of ternary double circulant, double twistulant, and self-dual codes
- On the performance of optimal double circulant even codes
- Nonexistence of certain singly even self-dual codes with minimal shadow
- Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\)
- A projection decoding of a binary extremal self-dual code of length 40
- scientific article; zbMATH DE number 7123495 (Why is no real title available?)
This page was built for publication: On the performance of binary extremal self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275879)
