New single asymmetric error-correcting codes
From MaRDI portal
Publication:4371908
DOI10.1109/18.623162zbMATH Open0884.94028OpenAlexW2017358938MaRDI QIDQ4371908FDOQ4371908
Authors: S. Al-Bassam, R. Venkatesan, Sultan Al-Muhammadi
Publication date: 21 January 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.623162
Recommendations
- A single asymmetric error-correcting code with 2/sup 13/ codewords of dimension 17
- New upper bounds for binary asymmetric error-correcting codes of length \(n\leq 28\) and asymmetric distance \(\Delta(2\leq \Delta\leq 5)\)
- Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
- scientific article
- Some new binary codes correcting asymmetric/unidirectional errors
Cited In (8)
- A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes
- Some new binary codes correcting asymmetric/unidirectional errors
- Improved lower bounds on sizes of single-error correcting codes
- Title not available (Why is that?)
- A Comment on “Systematic Single Asymmetric Error-Correcting Codes”
- A single asymmetric error-correcting code with 2/sup 13/ codewords of dimension 17
- On systematic single asymmetric error-correcting codes
- Estimate of the number of signals in codes correcting nonsymmetric errors
This page was built for publication: New single asymmetric error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371908)