• Journal of the military operations research society of Korea
• /
• v.15 no.2
• /
• pp.56-77
• /
• 1989

A new concept, namely the error discrimination of a code defined as the capability to not only detect errors from two distinct error sets but also to distinguish between them has been introduced in [SAKA 89a]. Consider $E_+\;and\;E_-$ as the two distinct error sets, namely the positive error set and the negative error set respectively. If a code C is not only capable of detecting any error e in {$E_+,\;E_-$}, but also able to identify the error set to which e belongs then the code is said to be an $E_+\;&\;E_-$ error discriminating code. The error discriminating property enables construction of unidirectional error detecting/correcting codes using asymmetric error control code. We derive here theory for asymmetric t error correcting and d error detecting codes. Furthermore, unidirectional error control code construction methods are introduced using asymmetric error control codes and $E_+\;&\;E_-$ error discriminating codes.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.475-486
• /
• 2011

The paper deals with repeated low-density burst error detecting codes with a specied weight or less. Linear codes capable of detecting such errors have been studied. Further codes capable of correcting and simultaneously detecting such errors have also been dealt with. The paper obtains lower and upper bounds on the number of parity-check digits required for such codes. An example of such a code has also been provided.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.611-616
• /
• 2008

Error correcting codes (ECCs) are commonly used to protect against the soft errors. Single error correcting and double error detecting (SEC-DED) codes are generally used for this purpose. The proposed approach in this paper selectively reduced power consumption, delay, and area in single-error correcting, double error-detecting checker circuits that perform memory error correction. The multi-objective genetic algorithm is employed to solve the non -linear optimization problem. The proposed method allows that user can choose one of different non-dominated solutions depending on which consideration is important among them. Because we use multi-objective genetic algorithm, we can find various dominated solutions. Therefore, we can choose the ECC according to the important factor of the power, delay and area. The method is applied to odd-column weight Hsiao code which is well- known ECC code and experiments were performed to show the performance of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.6
• /
• pp.590-603
• /
• 1989

In tnis paper, the CRC-CCITT code and primitive polynomial CRC code are selected for analysing error detecting performance. However, general formulas for obtaining the weight distribution of these two CRC codes are not so far dericed. So, a new method for calculating the weight distribution of the shortened cyclic Hamming code is presented and an undetected error probability of these two codes is obtained when used in cell of ATM for broadband ISDN user-network interface. Consequently, we show that CRC code too much does affect its error detection performance. All the computer simulation is performed by IBM PC/AT.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.114-118
• /
• 2014

In this paper, we analyze the performance of a concatenated code with two different inner decoding schemes. One is the error-detecting inner decoding, and the other is the error-detecting-and-correcting inner decoding scheme. We compare the performances of the two decoding schemes for finite and infinite block length cases when the concatenated code is applied to slow frequency-hopping spread-spectrum multiple access (FH-SSMA) communication systems.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.231-238
• /
• 2002

In this paper, we study cyclic codes detecting a subclass of close-closed loop bursts viz. low-density close-closed loop bursts. A subclass of CT close-closed loop berets called CT low-density close-closed loop bursts is also studied.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.809-823
• /
• 2015

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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.3
• /
• pp.13-20
• /
• 1983

A method for the detecting defined vertices is described in this paper. An alogrithm detecting vertex position by means of calculating an error and distinguishing the defined inner and outer corners by the chain code of line segments is described. To calculate the error, virtual links are detected by means of a jointing relations of line segments for a contour. And so an error is calculated by measuring a minimum distance from a jointing point between the line segments to virtual link. As a result, this method is more flexible and effective than conventional Freeman's method.

• Proceedings of the KIEE Conference
• /
• 1985.07a
• /
• pp.254-256
• /
• 1985

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1438-1448
• /
• 2019

We present a new technique, called VED (very effective debugging), for detecting and correcting division by zero errors for all types of .NET application. We use applications written in C# because C# applications are distributed through the internet and its executable format is used extensively. A tool called Immunity Debugger is used to reverse engineer executable code to get binaries of source code. With this technique, we demonstrate integer division by zero errors, the location of the error causing assembly language code, as well as error recovery done according to user preference. This technique can be extended to work for other programming languages in addition to C#. VED can work on different platforms such as Linux. This technique is simple to implement and economical because all the software used here are open source. Our aims are to simplify the maintenance process and to reduce the cost of the software development life cycle.