Abstract
New lower bounds for asymmetric single-error-correcting codes are derived. The codes are constructed by puncturing constant weight codes and by using a random coding argument.
Original language | English |
---|---|
Pages (from-to) | 1592-1597 |
Number of pages | 6 |
Journal | IEEE Transactions on Information Theory |
Volume | 38 |
Issue number | 5 |
DOIs | |
Publication status | Published - Sept 1992 |
Externally published | Yes |
Keywords
- Unidirectional errors
- asymmetric distance
- constant weight codes
- error correcting codes
- random coding and chains