On the analysis and design of group theoretical t-syEC/AUED codes

Author

Laih, Chi-Sung ; Yang, Ching-Nung

Author_Institution

Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

Volume

45

Issue

1

fYear

1996

fDate

1/1/1996 12:00:00 AM

Firstpage

103

Lastpage

108

Abstract

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 Z_n. Since a field Z_p 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

Keywords

combinational circuits; error correction codes; error detection codes; group theory; balanced codes; combinatorics; error correcting; error detecting; group theoretical; partition; t-syEC/AUED codes; unidirectional error detecting codes; unidirectional errors; Algorithm design and analysis; Arithmetic; Computer architecture; Computer errors; Computer networks; Concurrent computing; Distributed computing; Error correction codes; Fault tolerance; Parallel processing;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.481491

Filename

481491