|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes
February 1975 (vol. 24 no. 2)
pp. 210-212
| ASCII Text | x | ||
| J.F. Wakerly, "Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes," IEEE Transactions on Computers, vol. 24, no. 2, pp. 210-212, February, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224187, author = {J.F. Wakerly}, title = {Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {2}, issn = {0018-9340}, year = {1975}, pages = {210-212}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224187}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes IS - 2 SN - 0018-9340 SP210 EP212 EPD - 210-212 A1 - J.F. Wakerly, PY - 1975 KW - Arithmetic codes KW - capabilities of codes KW - error-detecting codes KW - low-cost codes KW - mass storage devices KW - multiple errors KW - repeated-use faults. VL - 24 JA - IEEE Transactions on Computers ER - | |||
We show that a low-cost arithmtetic code with group length n detects all unidirectional multiple errors that affect fewer than n bits, as well as a larger class of such errors confined to a restricted set of bit positions.
Index Terms:
Arithmetic codes, capabilities of codes, error-detecting codes, low-cost codes, mass storage devices, multiple errors, repeated-use faults.
Citation:
J.F. Wakerly, "Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes," IEEE Transactions on Computers, vol. 24, no. 2, pp. 210-212, Feb. 1975, doi:10.1109/T-C.1975.224187
Usage of this product signifies your acceptance of the Terms of Use.

