Approximate algorithms of construction of largest error-correcting codes which correct one error on the Z-channel
From MaRDI portal
Publication:3553054
Recommendations
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- On zero-error codes produced by greedy algorithms
- A new approach to error-correcting codes
- Improved lower bounds on sizes of single-error correcting codes
- A general error-correcting code construction for run-length limited binary channels
This page was built for publication: Approximate algorithms of construction of largest error-correcting codes which correct one error on the \(Z\)-channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3553054)