A General Class of M-Spotty Byte Error Control Codes

Suzuki, Kazuyoshi; Kashiyama, Toshihiko; Fujiwara, Eiji

doi:10.1093/ietfec/e90-a.7.1418

Cited by 13 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The m-spotty weights were introduced since they are capable of modelling the errors that frequently appear in flash memory disks as bursts in bytes [44,45]. For further information on spotty byte errors the readers can refer to [12,41]. Due to this important fact the researchers have been extensively studying its properties and especially MacWilliams identities that relate the weight enumerators of codes to their duals.…”

Section: History and Motivation Of The Problemmentioning

confidence: 99%

MacWilliams identities for poset level weight enumerators of linear codes

Seda¹,

Vedat²

2014

Preprint

View full text Add to dashboard Cite

Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities are not admissible for codes over poset metrics in general [Kim and Oh, 2005]. Lately, to overcome this problem some further studies on MacWilliams identities over poset metrics has been presented. In this paper, we introduce new poset level weight enumerators of linear codes over Frobenius commutative rings. We derive MacWilliams-type identities for each of the given enumerators which generalize in great deal the previous results discussed in the literature. Most of the weight enumerators in the literature such as Hamming, Rosenbloom-Tsfasman and complete m-spotty weight enumerators follow as corollaries to these identities especially.

show abstract

Section: History and Motivation Of The Problemmentioning

confidence: 99%

MacWilliams identities for poset level weight enumerators of linear codes

Seda¹,

Vedat²

2014

Preprint

View full text Add to dashboard Cite

show abstract

“…These chips are very likely to have multiple random bit errors when exposed to strong electromagnetic waves, radio-active particles or high-energy cosmic rays. To make these memory systems more reliable, spotty [21] and m-spotty [20] byte errors are introduced, which can be effectively detected or corrected using byte error-control codes. To make clear the error-detecting and error-correcting capabilities of a code, the research has been done on some special types of polynomials, called weight enumerators.…”

Section: Introductionmentioning

confidence: 99%

AN IDENTITY BETWEEN THE m-SPOTTY ROSENBLOOM-TSFASMAN WEIGHT ENUMERATORS OVER FINITE COMMUTATIVE FROBENIUS RINGS

Özen¹,

Shi²,

Şiap³

2015

Bulletin of the Korean Mathematical Society

View full text Add to dashboard Cite

Abstract. This paper is devoted to presenting a MacWilliams type identity for m-spotty RT weight enumerators of byte error control codes over finite commutative Frobenius rings, which can be used to determine the error-detecting and error-correcting capabilities of a code. This provides the relation between the m-spotty RT weight enumerator of the code and that of the dual code. We conclude the paper by giving three illustrations of the results.

show abstract

“…Detailed construction method for the spotty byte error control codes can be found in recent papers [2,4]. The following shows a basic concept for construction of these spotty byte error control codes.…”

Section: 2: Spotty Byte Error Control Codesmentioning

confidence: 99%

“…Hamming codes and Reed-Solomon (RS) codes have been widely used in conventional solid state recorders (SSRs) of satellite systems. Recently, new classes of byte error control codes suitable for semiconductor memory systems, called spotty byte error control codes, have been proposed [2,3,4].…”

Section: : Introductionmentioning

confidence: 99%

Error control coding for semiconductor memory systems in the space radiation environment

Kaneko

20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (DFT'05)

View full text Add to dashboard Cite

Error control coding is essential for semiconductor memory systems used in the space radiation environment because memory chips in this environment often suffer from single event upsets (SEUs). This paper presents the development of encoders and decoders of error control codes suitable for the space radiation environment. To select suitable error control codes, we analyze error patterns and error counts in in-flight data of a solid state recorder installed in the Mission Demonstration test Satellite-1 (MDS-1). Based on this analysis, six classes of linear error control codes are selected, and encoders and decoders of these codes are designed and implemented using an FPGA. To reduce the decoding delay, the decoders are designed based on a parallel decoding method. Evaluation of the implemented FPGA shows that the decoders have 45K to 300K gates with decoding delay of about 20 ns.

show abstract

A General Class of M-Spotty Byte Error Control Codes

Cited by 13 publications

References 12 publications

MacWilliams identities for poset level weight enumerators of linear codes

MacWilliams identities for poset level weight enumerators of linear codes

AN IDENTITY BETWEEN THE m-SPOTTY ROSENBLOOM-TSFASMAN WEIGHT ENUMERATORS OVER FINITE COMMUTATIVE FROBENIUS RINGS

Error control coding for semiconductor memory systems in the space radiation environment

Contact Info

Product

Resources

About