Linear codes on solid bursts and random errors
The paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. An example of such a code is also provided. Further, codes capable of detecting and simultaneous...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2015-06-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/pdf_6189_9619dd1f0360d22b7a321782e90bd715.html |