IEEE Transactions on Information Theory
Systematic t-Error Correcting/All Unidirectional Error Detecting Codes
IEEE Transactions on Computers
Error-control coding for computer systems
Error-control coding for computer systems
On t-Error Correcting/All Unidirectional Error Detecting Codes
IEEE Transactions on Computers
On Symmetric Error Correcting and all Unidirectional Error Detecting Codes
IEEE Transactions on Computers
Systematic Random Error Correcting and all Unidirectional Error Detecting Codes
IEEE Transactions on Computers
Theory and Design of t-Error Correcting/d-Error Detecting (d
IEEE Transactions on Computers
Design of Efficient Error-Correcting Balanced Codes
IEEE Transactions on Computers
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Theory of Unidirectional Error Correcting/Detecting Codes
IEEE Transactions on Computers
Another Method for Constructing t-EC/AUED Codes
IEEE Transactions on Computers
| Hi-index | 14.98 |
An efficient algorithm to count the cardinalities of certain subsets of constant weight binary vectors is presented in this paper. The algorithm enables us to design I-symmetric error correcting/all unidirectional error detecting (1-syEC/AUED) codes with the highest cardinality based on the group Zn. Since a field Zp is a group, this algorithm can also be used to design a field 1-syEC/AUED code. We can construct t-syEC/AUED codes for f=2 or 3 by appending a tail to the field 1-syEC/AUED codes. The information rates of the proposed t-syEC/AUED codes are shown to be better than the previously developed codes