A generalization of the single b-Bit byte error correcting and double bit error detecting codes for high-speed memory systems

A generalization of the single b-Bit byte error correcting and double bit error detecting codes for high-speed memory systems

In this paper, a general method using the subsets (generating sets) of GF(2/sup b/) for constructing the SbEC-DED codes will be presented. The constructions given in Fujiwara and Hamada (1992) are special cases of ours. For some values of b, the generating sets used in our constructions are larger t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 1996-04, Vol.45 (4), p.508-511
Hauptverfasser: Sihai Xiao, Xiaofa Shi, Guiliang Feng, Rao, T.R.N.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Application software
Applied sciences
Computer errors
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Conductors
Error correction codes
Exact sciences and technology
Galois fields
Memory and file management (including protection and security)
Memory organisation. Data processing
Parity check codes
Polynomials
Software
Theoretical computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a general method using the subsets (generating sets) of GF(2/sup b/) for constructing the SbEC-DED codes will be presented. The constructions given in Fujiwara and Hamada (1992) are special cases of ours. For some values of b, the generating sets used in our constructions are larger than the cosets used in Fujiwara and Hamada (1992). Hence, a larger code length can be obtained.
ISSN:0018-9340
1557-9956
DOI:10.1109/12.494112