IBM Journal of Research and Development
Linear Codes and Polylinear Recurrences over Finite Rings and Modules
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Acceptable Testing of VLSI Components Which Contain Error Correctors
IEEE Transactions on Computers
Error-Correcting Codes for Byte-Organized Arithmetic Processors
IEEE Transactions on Computers
A Class of Linear Codes for Error Control in Byte-per-Card Organized Digital Systems
IEEE Transactions on Computers
Code Constructions for Error Control in Byte Organized Memory Systems
IEEE Transactions on Computers
Memory Package Error Detection and Correction
IEEE Transactions on Computers
A General Class of M-Spotty Byte Error Control Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Optimal rectangular code for high density magnetic tapes
IBM Journal of Research and Development
Error-correcting codes for semiconductor memory applications: a state-of-the-art review
IBM Journal of Research and Development
The maximum size of a partial 3-spread in a finite vector space over GF(2)
Designs, Codes and Cryptography
Extremal sizes of subspace partitions
Designs, Codes and Cryptography
| Hi-index | 15.00 |
The error-correcting codes for symbols from GF (2b) are often used for correction of byte-errors in binary data. In these byte-error-correcting codes each check symbol in GF (2b) is expressed as b binary check digits and each information symbol in GF (2b), likewise, is expressed by b binary information digits. A new class of codes for single-byte-error correction is presented. The code is general in that the code structure does not depend on symbols from GF (2b). In particular, the number of check bits are not restricted to the multiples of b as in the case of the codes derived from GF (2b) codes. The new codes are either perfect or maximal and are easily implementable using shift registers.