New single-error-correcting codes
From MaRDI portal
Recommendations
Cited in
(15)- On the failing cases of the Johnson bound for error-correcting codes
- A new class of error-correcting binary codes
- On the structure of optimal error-correcting codes
- New upper bounds for binary covering codes
- New lower bounds on error-correcting ternary, quaternary and quinary codes
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
- New lower bounds on \(q\)-ary error-correcting codes
- Improved lower bounds on sizes of single-error correcting codes
- Constructing error-correcting binary codes using transitive permutation groups
- Two new four-error-correcting binary codes
- scientific article; zbMATH DE number 3882342 (Why is no real title available?)
- A General Product Construction for Error Correcting Codes
- A Single and Adjacent Error Correction Code for Fast Decoding of Critical Bits
- Recent developments in Armstrong codes
- Error-correcting codes over an alphabet of four elements
This page was built for publication: New single-error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885731)